/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/chl-chromosome-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 07:04:37,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 07:04:37,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 07:04:37,342 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 07:04:37,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 07:04:37,345 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 07:04:37,348 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 07:04:37,351 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 07:04:37,355 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 07:04:37,359 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 07:04:37,360 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 07:04:37,362 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 07:04:37,362 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 07:04:37,365 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 07:04:37,365 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 07:04:37,368 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 07:04:37,369 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 07:04:37,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 07:04:37,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 07:04:37,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 07:04:37,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 07:04:37,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 07:04:37,381 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 07:04:37,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 07:04:37,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 07:04:37,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 07:04:37,387 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 07:04:37,388 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 07:04:37,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 07:04:37,389 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 07:04:37,394 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 07:04:37,396 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 07:04:37,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 07:04:37,398 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 07:04:37,398 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 07:04:37,398 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 07:04:37,399 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 07:04:37,399 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 07:04:37,399 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 07:04:37,400 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 07:04:37,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 07:04:37,401 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 07:04:37,437 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 07:04:37,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 07:04:37,439 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 07:04:37,439 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 07:04:37,440 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 07:04:37,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 07:04:37,440 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 07:04:37,441 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 07:04:37,441 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 07:04:37,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 07:04:37,441 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 07:04:37,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 07:04:37,442 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 07:04:37,442 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 07:04:37,442 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 07:04:37,442 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 07:04:37,442 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 07:04:37,443 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 07:04:37,443 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 07:04:37,443 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 07:04:37,443 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 07:04:37,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:04:37,443 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 07:04:37,443 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 07:04:37,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 07:04:37,444 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 07:04:37,444 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 07:04:37,444 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 07:04:37,444 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 07:04:37,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 07:04:37,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 07:04:37,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 07:04:37,773 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 07:04:37,773 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 07:04:37,774 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-chromosome-symm.wvr.c [2022-12-13 07:04:38,918 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 07:04:39,142 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 07:04:39,143 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-symm.wvr.c [2022-12-13 07:04:39,155 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55f068647/3cc027ce4cc1458babee2cd33ac98ff8/FLAG759c9cd99 [2022-12-13 07:04:39,170 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55f068647/3cc027ce4cc1458babee2cd33ac98ff8 [2022-12-13 07:04:39,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 07:04:39,174 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 07:04:39,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 07:04:39,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 07:04:39,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 07:04:39,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:04:39" (1/1) ... [2022-12-13 07:04:39,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9e89996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:04:39, skipping insertion in model container [2022-12-13 07:04:39,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:04:39" (1/1) ... [2022-12-13 07:04:39,185 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 07:04:39,208 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 07:04:39,349 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-symm.wvr.c[2695,2708] [2022-12-13 07:04:39,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:04:39,363 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 07:04:39,382 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-symm.wvr.c[2695,2708] [2022-12-13 07:04:39,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:04:39,397 INFO L208 MainTranslator]: Completed translation [2022-12-13 07:04:39,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:04:39 WrapperNode [2022-12-13 07:04:39,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 07:04:39,399 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 07:04:39,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 07:04:39,399 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 07:04:39,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:04:39" (1/1) ... [2022-12-13 07:04:39,409 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:04:39" (1/1) ... [2022-12-13 07:04:39,434 INFO L138 Inliner]: procedures = 25, calls = 37, calls flagged for inlining = 15, calls inlined = 19, statements flattened = 194 [2022-12-13 07:04:39,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 07:04:39,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 07:04:39,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 07:04:39,435 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 07:04:39,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:04:39" (1/1) ... [2022-12-13 07:04:39,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:04:39" (1/1) ... [2022-12-13 07:04:39,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:04:39" (1/1) ... [2022-12-13 07:04:39,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:04:39" (1/1) ... [2022-12-13 07:04:39,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:04:39" (1/1) ... [2022-12-13 07:04:39,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:04:39" (1/1) ... [2022-12-13 07:04:39,455 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:04:39" (1/1) ... [2022-12-13 07:04:39,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:04:39" (1/1) ... [2022-12-13 07:04:39,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 07:04:39,465 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 07:04:39,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 07:04:39,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 07:04:39,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:04:39" (1/1) ... [2022-12-13 07:04:39,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:04:39,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:04:39,516 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 07:04:39,540 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 07:04:39,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 07:04:39,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 07:04:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 07:04:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 07:04:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 07:04:39,557 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 07:04:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 07:04:39,557 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 07:04:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 07:04:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 07:04:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 07:04:39,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 07:04:39,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 07:04:39,559 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 07:04:39,706 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 07:04:39,708 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 07:04:40,034 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 07:04:40,043 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 07:04:40,047 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 07:04:40,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:04:40 BoogieIcfgContainer [2022-12-13 07:04:40,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 07:04:40,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 07:04:40,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 07:04:40,070 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 07:04:40,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:04:39" (1/3) ... [2022-12-13 07:04:40,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174891c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:04:40, skipping insertion in model container [2022-12-13 07:04:40,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:04:39" (2/3) ... [2022-12-13 07:04:40,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174891c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:04:40, skipping insertion in model container [2022-12-13 07:04:40,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:04:40" (3/3) ... [2022-12-13 07:04:40,073 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-chromosome-symm.wvr.c [2022-12-13 07:04:40,104 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 07:04:40,105 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 07:04:40,105 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 07:04:40,265 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 07:04:40,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 227 transitions, 470 flow [2022-12-13 07:04:40,416 INFO L130 PetriNetUnfolder]: 21/225 cut-off events. [2022-12-13 07:04:40,417 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 07:04:40,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 225 events. 21/225 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 261 event pairs, 0 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 145. Up to 2 conditions per place. [2022-12-13 07:04:40,423 INFO L82 GeneralOperation]: Start removeDead. Operand has 213 places, 227 transitions, 470 flow [2022-12-13 07:04:40,433 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 203 places, 217 transitions, 446 flow [2022-12-13 07:04:40,435 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:04:40,456 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 217 transitions, 446 flow [2022-12-13 07:04:40,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 217 transitions, 446 flow [2022-12-13 07:04:40,518 INFO L130 PetriNetUnfolder]: 21/217 cut-off events. [2022-12-13 07:04:40,519 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 07:04:40,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 217 events. 21/217 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 260 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 145. Up to 2 conditions per place. [2022-12-13 07:04:40,525 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 203 places, 217 transitions, 446 flow [2022-12-13 07:04:40,525 INFO L226 LiptonReduction]: Number of co-enabled transitions 5400 [2022-12-13 07:04:46,142 INFO L241 LiptonReduction]: Total number of compositions: 197 [2022-12-13 07:04:46,160 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 07:04:46,168 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;@78e17e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 07:04:46,168 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 07:04:46,179 INFO L130 PetriNetUnfolder]: 4/19 cut-off events. [2022-12-13 07:04:46,180 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 07:04:46,180 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:04:46,180 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:04:46,181 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 07:04:46,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:04:46,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1077272917, now seen corresponding path program 1 times [2022-12-13 07:04:46,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:04:46,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692148969] [2022-12-13 07:04:46,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:04:46,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:04:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:04:46,572 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 07:04:46,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:04:46,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692148969] [2022-12-13 07:04:46,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692148969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:04:46,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:04:46,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:04:46,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424103042] [2022-12-13 07:04:46,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:04:46,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 07:04:46,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:04:46,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 07:04:46,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 07:04:46,597 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 07:04:46,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:04:46,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:04:46,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 07:04:46,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:04:46,652 INFO L130 PetriNetUnfolder]: 53/98 cut-off events. [2022-12-13 07:04:46,652 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-13 07:04:46,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 98 events. 53/98 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 191 event pairs, 33 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 160. Up to 97 conditions per place. [2022-12-13 07:04:46,654 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 18 selfloop transitions, 4 changer transitions 0/22 dead transitions. [2022-12-13 07:04:46,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 22 transitions, 100 flow [2022-12-13 07:04:46,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:04:46,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 07:04:46,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-12-13 07:04:46,663 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-13 07:04:46,666 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2022-12-13 07:04:46,666 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 22 transitions, 100 flow [2022-12-13 07:04:46,667 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 22 transitions, 100 flow [2022-12-13 07:04:46,668 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:04:46,668 INFO L89 Accepts]: Start accepts. Operand has 25 places, 22 transitions, 100 flow [2022-12-13 07:04:46,671 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:04:46,671 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:04:46,671 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 22 transitions, 100 flow [2022-12-13 07:04:46,674 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 22 transitions, 100 flow [2022-12-13 07:04:46,674 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:04:46,674 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:04:46,676 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 07:04:46,676 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 22 transitions, 100 flow [2022-12-13 07:04:46,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:04:46,676 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:04:46,676 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:04:46,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 07:04:46,677 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 07:04:46,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:04:46,677 INFO L85 PathProgramCache]: Analyzing trace with hash 639991075, now seen corresponding path program 1 times [2022-12-13 07:04:46,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:04:46,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381194280] [2022-12-13 07:04:46,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:04:46,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:04:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:04:46,855 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 07:04:46,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:04:46,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381194280] [2022-12-13 07:04:46,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381194280] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:04:46,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209117051] [2022-12-13 07:04:46,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:04:46,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:04:46,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:04:46,867 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 07:04:46,887 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 07:04:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:04:46,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 07:04:46,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:04:47,064 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 07:04:47,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:04:47,095 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 07:04:47,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209117051] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:04:47,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:04:47,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2022-12-13 07:04:47,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858683984] [2022-12-13 07:04:47,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:04:47,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:04:47,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:04:47,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:04:47,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:04:47,098 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 07:04:47,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 22 transitions, 100 flow. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:04:47,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:04:47,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 07:04:47,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:04:47,180 INFO L130 PetriNetUnfolder]: 53/104 cut-off events. [2022-12-13 07:04:47,180 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-13 07:04:47,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 104 events. 53/104 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 191 event pairs, 33 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 236. Up to 103 conditions per place. [2022-12-13 07:04:47,181 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 18 selfloop transitions, 10 changer transitions 0/28 dead transitions. [2022-12-13 07:04:47,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 28 transitions, 180 flow [2022-12-13 07:04:47,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:04:47,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:04:47,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-12-13 07:04:47,192 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2833333333333333 [2022-12-13 07:04:47,193 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 7 predicate places. [2022-12-13 07:04:47,193 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 28 transitions, 180 flow [2022-12-13 07:04:47,194 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 28 transitions, 180 flow [2022-12-13 07:04:47,195 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:04:47,195 INFO L89 Accepts]: Start accepts. Operand has 30 places, 28 transitions, 180 flow [2022-12-13 07:04:47,196 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:04:47,196 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:04:47,196 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 28 transitions, 180 flow [2022-12-13 07:04:47,197 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 28 transitions, 180 flow [2022-12-13 07:04:47,197 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:04:47,198 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:04:47,198 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 07:04:47,199 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 28 transitions, 180 flow [2022-12-13 07:04:47,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:04:47,199 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:04:47,199 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:04:47,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 07:04:47,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:04:47,400 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 07:04:47,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:04:47,401 INFO L85 PathProgramCache]: Analyzing trace with hash -2058199873, now seen corresponding path program 2 times [2022-12-13 07:04:47,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:04:47,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865037025] [2022-12-13 07:04:47,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:04:47,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:04:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:04:47,607 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 07:04:47,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:04:47,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865037025] [2022-12-13 07:04:47,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865037025] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:04:47,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632338886] [2022-12-13 07:04:47,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:04:47,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:04:47,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:04:47,610 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 07:04:47,613 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 07:04:47,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 07:04:47,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:04:47,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 07:04:47,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:04:47,772 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 07:04:47,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 07:04:47,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632338886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:04:47,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 07:04:47,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-12-13 07:04:47,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926753565] [2022-12-13 07:04:47,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:04:47,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:04:47,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:04:47,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:04:47,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-13 07:04:47,776 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 07:04:47,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 28 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:04:47,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:04:47,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 07:04:47,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:04:47,873 INFO L130 PetriNetUnfolder]: 64/123 cut-off events. [2022-12-13 07:04:47,873 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-13 07:04:47,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513 conditions, 123 events. 64/123 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 306 event pairs, 2 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 372. Up to 122 conditions per place. [2022-12-13 07:04:47,875 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-13 07:04:47,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 41 transitions, 346 flow [2022-12-13 07:04:47,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:04:47,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:04:47,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-12-13 07:04:47,878 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.425 [2022-12-13 07:04:47,879 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 10 predicate places. [2022-12-13 07:04:47,879 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 41 transitions, 346 flow [2022-12-13 07:04:47,880 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 41 transitions, 346 flow [2022-12-13 07:04:47,881 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:04:47,881 INFO L89 Accepts]: Start accepts. Operand has 33 places, 41 transitions, 346 flow [2022-12-13 07:04:47,883 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:04:47,884 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:04:47,884 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 41 transitions, 346 flow [2022-12-13 07:04:47,885 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 41 transitions, 346 flow [2022-12-13 07:04:47,885 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:04:47,886 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:04:47,887 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 07:04:47,888 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 41 transitions, 346 flow [2022-12-13 07:04:47,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:04:47,888 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:04:47,888 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:04:47,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 07:04:48,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-12-13 07:04:48,095 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 07:04:48,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:04:48,095 INFO L85 PathProgramCache]: Analyzing trace with hash 682966989, now seen corresponding path program 3 times [2022-12-13 07:04:48,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:04:48,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891954398] [2022-12-13 07:04:48,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:04:48,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:04:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:04:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 07:04:48,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:04:48,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891954398] [2022-12-13 07:04:48,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891954398] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:04:48,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709297656] [2022-12-13 07:04:48,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:04:48,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:04:48,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:04:48,259 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 07:04:48,268 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 07:04:48,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-13 07:04:48,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:04:48,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 07:04:48,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:04:48,405 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 07:04:48,405 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 07:04:48,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709297656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:04:48,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 07:04:48,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-12-13 07:04:48,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732230037] [2022-12-13 07:04:48,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:04:48,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:04:48,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:04:48,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:04:48,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-13 07:04:48,407 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 07:04:48,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 41 transitions, 346 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:04:48,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:04:48,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 07:04:48,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:04:48,498 INFO L130 PetriNetUnfolder]: 90/171 cut-off events. [2022-12-13 07:04:48,498 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-13 07:04:48,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 171 events. 90/171 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 471 event pairs, 2 based on Foata normal form. 2/137 useless extension candidates. Maximal degree in co-relation 691. Up to 170 conditions per place. [2022-12-13 07:04:48,500 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 54 selfloop transitions, 6 changer transitions 2/62 dead transitions. [2022-12-13 07:04:48,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 62 transitions, 647 flow [2022-12-13 07:04:48,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:04:48,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:04:48,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-13 07:04:48,501 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-12-13 07:04:48,502 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 13 predicate places. [2022-12-13 07:04:48,502 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 62 transitions, 647 flow [2022-12-13 07:04:48,503 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 60 transitions, 627 flow [2022-12-13 07:04:48,504 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:04:48,505 INFO L89 Accepts]: Start accepts. Operand has 36 places, 60 transitions, 627 flow [2022-12-13 07:04:48,506 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:04:48,506 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:04:48,506 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 60 transitions, 627 flow [2022-12-13 07:04:48,507 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 60 transitions, 627 flow [2022-12-13 07:04:48,507 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:04:48,507 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:04:48,508 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 07:04:48,508 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 60 transitions, 627 flow [2022-12-13 07:04:48,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:04:48,508 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:04:48,508 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:04:48,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 07:04:48,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:04:48,716 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 07:04:48,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:04:48,716 INFO L85 PathProgramCache]: Analyzing trace with hash -466567759, now seen corresponding path program 4 times [2022-12-13 07:04:48,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:04:48,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268637365] [2022-12-13 07:04:48,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:04:48,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:04:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:04:48,869 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 07:04:48,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:04:48,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268637365] [2022-12-13 07:04:48,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268637365] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:04:48,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76623471] [2022-12-13 07:04:48,870 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:04:48,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:04:48,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:04:48,871 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 07:04:48,873 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 07:04:48,994 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:04:48,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:04:48,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 07:04:48,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:04:49,076 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 07:04:49,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:04:49,153 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 07:04:49,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76623471] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:04:49,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:04:49,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-12-13 07:04:49,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909173004] [2022-12-13 07:04:49,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:04:49,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 07:04:49,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:04:49,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 07:04:49,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2022-12-13 07:04:49,156 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 07:04:49,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 60 transitions, 627 flow. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:04:49,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:04:49,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 07:04:49,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:04:49,265 INFO L130 PetriNetUnfolder]: 89/170 cut-off events. [2022-12-13 07:04:49,265 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-13 07:04:49,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 170 events. 89/170 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 462 event pairs, 2 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 810. Up to 169 conditions per place. [2022-12-13 07:04:49,267 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 50 selfloop transitions, 12 changer transitions 0/62 dead transitions. [2022-12-13 07:04:49,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 62 transitions, 771 flow [2022-12-13 07:04:49,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:04:49,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:04:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-12-13 07:04:49,272 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22857142857142856 [2022-12-13 07:04:49,273 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 19 predicate places. [2022-12-13 07:04:49,273 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 62 transitions, 771 flow [2022-12-13 07:04:49,275 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 62 transitions, 771 flow [2022-12-13 07:04:49,276 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:04:49,276 INFO L89 Accepts]: Start accepts. Operand has 42 places, 62 transitions, 771 flow [2022-12-13 07:04:49,279 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:04:49,280 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:04:49,280 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 62 transitions, 771 flow [2022-12-13 07:04:49,281 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 62 transitions, 771 flow [2022-12-13 07:04:49,281 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:04:49,283 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:04:49,283 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 07:04:49,283 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 62 transitions, 771 flow [2022-12-13 07:04:49,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:04:49,283 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:04:49,284 INFO L214 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:04:49,292 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 07:04:49,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:04:49,490 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 07:04:49,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:04:49,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1802292253, now seen corresponding path program 5 times [2022-12-13 07:04:49,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:04:49,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332171356] [2022-12-13 07:04:49,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:04:49,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:04:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:04:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 07:04:49,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:04:49,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332171356] [2022-12-13 07:04:49,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332171356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:04:49,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:04:49,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:04:49,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129145896] [2022-12-13 07:04:49,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:04:49,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:04:49,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:04:49,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:04:49,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:04:49,703 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 07:04:49,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 62 transitions, 771 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:04:49,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:04:49,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 07:04:49,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:04:49,786 INFO L130 PetriNetUnfolder]: 113/210 cut-off events. [2022-12-13 07:04:49,787 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-13 07:04:49,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1497 conditions, 210 events. 113/210 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 577 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 1224. Up to 209 conditions per place. [2022-12-13 07:04:49,789 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 74 selfloop transitions, 9 changer transitions 0/83 dead transitions. [2022-12-13 07:04:49,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 83 transitions, 1192 flow [2022-12-13 07:04:49,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:04:49,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:04:49,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-13 07:04:49,790 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4125 [2022-12-13 07:04:49,790 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 22 predicate places. [2022-12-13 07:04:49,791 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 83 transitions, 1192 flow [2022-12-13 07:04:49,793 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 83 transitions, 1192 flow [2022-12-13 07:04:49,794 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:04:49,794 INFO L89 Accepts]: Start accepts. Operand has 45 places, 83 transitions, 1192 flow [2022-12-13 07:04:49,796 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:04:49,796 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:04:49,796 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 83 transitions, 1192 flow [2022-12-13 07:04:49,797 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 83 transitions, 1192 flow [2022-12-13 07:04:49,797 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:04:49,798 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:04:49,798 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 07:04:49,799 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 83 transitions, 1192 flow [2022-12-13 07:04:49,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:04:49,799 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:04:49,799 INFO L214 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:04:49,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 07:04:49,799 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 07:04:49,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:04:49,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1574238918, now seen corresponding path program 1 times [2022-12-13 07:04:49,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:04:49,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664951662] [2022-12-13 07:04:49,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:04:49,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:04:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:04:50,059 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-13 07:04:50,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:04:50,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664951662] [2022-12-13 07:04:50,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664951662] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:04:50,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:04:50,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:04:50,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834303466] [2022-12-13 07:04:50,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:04:50,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:04:50,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:04:50,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:04:50,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:04:50,061 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 07:04:50,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 83 transitions, 1192 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 07:04:50,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:04:50,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 07:04:50,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:04:50,164 INFO L130 PetriNetUnfolder]: 159/296 cut-off events. [2022-12-13 07:04:50,164 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-13 07:04:50,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2407 conditions, 296 events. 159/296 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 959 event pairs, 0 based on Foata normal form. 4/240 useless extension candidates. Maximal degree in co-relation 1978. Up to 295 conditions per place. [2022-12-13 07:04:50,167 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 100 selfloop transitions, 11 changer transitions 6/117 dead transitions. [2022-12-13 07:04:50,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 117 transitions, 1920 flow [2022-12-13 07:04:50,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:04:50,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:04:50,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-13 07:04:50,169 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4875 [2022-12-13 07:04:50,169 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 25 predicate places. [2022-12-13 07:04:50,169 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 117 transitions, 1920 flow [2022-12-13 07:04:50,172 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 111 transitions, 1818 flow [2022-12-13 07:04:50,174 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:04:50,174 INFO L89 Accepts]: Start accepts. Operand has 48 places, 111 transitions, 1818 flow [2022-12-13 07:04:50,176 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:04:50,176 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:04:50,176 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 111 transitions, 1818 flow [2022-12-13 07:04:50,181 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 111 transitions, 1818 flow [2022-12-13 07:04:50,181 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:04:50,181 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:04:50,182 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 07:04:50,182 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 111 transitions, 1818 flow [2022-12-13 07:04:50,182 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 07:04:50,182 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:04:50,183 INFO L214 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:04:50,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 07:04:50,183 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 07:04:50,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:04:50,183 INFO L85 PathProgramCache]: Analyzing trace with hash 535660666, now seen corresponding path program 2 times [2022-12-13 07:04:50,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:04:50,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368526284] [2022-12-13 07:04:50,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:04:50,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:04:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:04:50,410 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-13 07:04:50,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:04:50,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368526284] [2022-12-13 07:04:50,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368526284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:04:50,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:04:50,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:04:50,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790358720] [2022-12-13 07:04:50,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:04:50,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:04:50,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:04:50,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:04:50,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:04:50,413 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 07:04:50,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 111 transitions, 1818 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 07:04:50,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:04:50,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 07:04:50,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:04:50,557 INFO L130 PetriNetUnfolder]: 141/258 cut-off events. [2022-12-13 07:04:50,557 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-13 07:04:50,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2355 conditions, 258 events. 141/258 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 751 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 1938. Up to 257 conditions per place. [2022-12-13 07:04:50,559 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 88 selfloop transitions, 10 changer transitions 0/98 dead transitions. [2022-12-13 07:04:50,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 98 transitions, 1797 flow [2022-12-13 07:04:50,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:04:50,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:04:50,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-12-13 07:04:50,562 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.425 [2022-12-13 07:04:50,563 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 27 predicate places. [2022-12-13 07:04:50,564 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 98 transitions, 1797 flow [2022-12-13 07:04:50,566 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 98 transitions, 1797 flow [2022-12-13 07:04:50,568 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:04:50,568 INFO L89 Accepts]: Start accepts. Operand has 50 places, 98 transitions, 1797 flow [2022-12-13 07:04:50,571 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:04:50,571 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:04:50,571 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 98 transitions, 1797 flow [2022-12-13 07:04:50,573 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 98 transitions, 1797 flow [2022-12-13 07:04:50,573 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:04:50,573 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:04:50,576 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 07:04:50,576 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 98 transitions, 1797 flow [2022-12-13 07:04:50,576 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 07:04:50,576 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:04:50,576 INFO L214 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:04:50,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 07:04:50,576 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 07:04:50,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:04:50,577 INFO L85 PathProgramCache]: Analyzing trace with hash -964215149, now seen corresponding path program 1 times [2022-12-13 07:04:50,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:04:50,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258150145] [2022-12-13 07:04:50,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:04:50,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:04:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:04:50,774 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 07:04:50,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:04:50,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258150145] [2022-12-13 07:04:50,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258150145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:04:50,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:04:50,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:04:50,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267603216] [2022-12-13 07:04:50,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:04:50,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:04:50,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:04:50,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:04:50,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:04:50,778 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 07:04:50,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 98 transitions, 1797 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:04:50,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:04:50,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 07:04:50,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:04:50,870 INFO L130 PetriNetUnfolder]: 124/227 cut-off events. [2022-12-13 07:04:50,870 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-13 07:04:50,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2302 conditions, 227 events. 124/227 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 627 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 1902. Up to 226 conditions per place. [2022-12-13 07:04:50,873 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 76 selfloop transitions, 9 changer transitions 0/85 dead transitions. [2022-12-13 07:04:50,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 85 transitions, 1727 flow [2022-12-13 07:04:50,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:04:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:04:50,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-13 07:04:50,874 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-13 07:04:50,874 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 29 predicate places. [2022-12-13 07:04:50,874 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 85 transitions, 1727 flow [2022-12-13 07:04:50,877 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 85 transitions, 1727 flow [2022-12-13 07:04:50,878 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:04:50,878 INFO L89 Accepts]: Start accepts. Operand has 52 places, 85 transitions, 1727 flow [2022-12-13 07:04:50,880 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:04:50,880 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:04:50,881 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 85 transitions, 1727 flow [2022-12-13 07:04:50,882 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 85 transitions, 1727 flow [2022-12-13 07:04:50,882 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:04:50,882 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:04:50,883 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 07:04:50,883 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 85 transitions, 1727 flow [2022-12-13 07:04:50,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:04:50,883 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:04:50,883 INFO L214 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:04:50,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 07:04:50,884 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 07:04:50,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:04:50,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2020566198, now seen corresponding path program 1 times [2022-12-13 07:04:50,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:04:50,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265934888] [2022-12-13 07:04:50,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:04:50,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:04:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:04:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 07:04:51,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:04:51,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265934888] [2022-12-13 07:04:51,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265934888] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:04:51,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442374401] [2022-12-13 07:04:51,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:04:51,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:04:51,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:04:51,944 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 07:04:51,969 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 07:04:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:04:52,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-13 07:04:52,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:04:52,290 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:04:52,294 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:04:52,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-13 07:04:52,325 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 07:04:52,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:04:52,897 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-13 07:04:52,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 52 [2022-12-13 07:04:52,939 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 07:04:52,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-12-13 07:04:52,945 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 07:04:52,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-12-13 07:04:52,947 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 07:04:52,961 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 07:04:52,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442374401] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:04:52,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:04:52,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 23 [2022-12-13 07:04:52,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848230392] [2022-12-13 07:04:52,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:04:52,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 07:04:52,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:04:52,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 07:04:52,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2022-12-13 07:04:52,963 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 07:04:52,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 85 transitions, 1727 flow. Second operand has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:04:52,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:04:52,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 07:04:52,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:04:53,918 INFO L130 PetriNetUnfolder]: 231/416 cut-off events. [2022-12-13 07:04:53,918 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-13 07:04:53,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4627 conditions, 416 events. 231/416 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1486 event pairs, 0 based on Foata normal form. 1/349 useless extension candidates. Maximal degree in co-relation 3793. Up to 415 conditions per place. [2022-12-13 07:04:53,923 INFO L137 encePairwiseOnDemand]: 9/20 looper letters, 124 selfloop transitions, 42 changer transitions 2/168 dead transitions. [2022-12-13 07:04:53,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 168 transitions, 3756 flow [2022-12-13 07:04:53,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 07:04:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 07:04:53,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 83 transitions. [2022-12-13 07:04:53,924 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29642857142857143 [2022-12-13 07:04:53,925 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 42 predicate places. [2022-12-13 07:04:53,925 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 168 transitions, 3756 flow [2022-12-13 07:04:53,930 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 166 transitions, 3709 flow [2022-12-13 07:04:53,933 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:04:53,934 INFO L89 Accepts]: Start accepts. Operand has 65 places, 166 transitions, 3709 flow [2022-12-13 07:04:53,936 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:04:53,936 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:04:53,937 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 166 transitions, 3709 flow [2022-12-13 07:04:53,939 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 166 transitions, 3709 flow [2022-12-13 07:04:53,939 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:04:55,020 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 07:04:55,021 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1088 [2022-12-13 07:04:55,021 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 164 transitions, 3665 flow [2022-12-13 07:04:55,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:04:55,021 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:04:55,021 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:04:55,035 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 07:04:55,235 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 07:04:55,236 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 07:04:55,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:04:55,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1788440015, now seen corresponding path program 1 times [2022-12-13 07:04:55,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:04:55,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700380013] [2022-12-13 07:04:55,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:04:55,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:04:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:04:56,122 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 07:04:56,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:04:56,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700380013] [2022-12-13 07:04:56,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700380013] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:04:56,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366842968] [2022-12-13 07:04:56,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:04:56,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:04:56,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:04:56,128 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 07:04:56,130 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 07:04:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:04:56,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-13 07:04:56,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:04:56,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:04:56,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-13 07:04:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 07:04:56,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:04:57,070 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-13 07:04:57,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 52 [2022-12-13 07:04:57,106 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 07:04:57,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-12-13 07:04:57,113 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 07:04:57,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-12-13 07:04:57,116 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 07:04:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 07:04:57,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366842968] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:04:57,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:04:57,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 22 [2022-12-13 07:04:57,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440377134] [2022-12-13 07:04:57,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:04:57,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 07:04:57,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:04:57,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 07:04:57,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2022-12-13 07:04:57,139 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 07:04:57,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 164 transitions, 3665 flow. Second operand has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:04:57,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:04:57,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 07:04:57,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:04:57,719 INFO L130 PetriNetUnfolder]: 258/463 cut-off events. [2022-12-13 07:04:57,719 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-13 07:04:57,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5610 conditions, 463 events. 258/463 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1737 event pairs, 0 based on Foata normal form. 1/386 useless extension candidates. Maximal degree in co-relation 4652. Up to 464 conditions per place. [2022-12-13 07:04:57,725 INFO L137 encePairwiseOnDemand]: 9/20 looper letters, 150 selfloop transitions, 32 changer transitions 1/183 dead transitions. [2022-12-13 07:04:57,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 183 transitions, 4455 flow [2022-12-13 07:04:57,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:04:57,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:04:57,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 60 transitions. [2022-12-13 07:04:57,726 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2727272727272727 [2022-12-13 07:04:57,727 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 48 predicate places. [2022-12-13 07:04:57,727 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 183 transitions, 4455 flow [2022-12-13 07:04:57,747 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 182 transitions, 4428 flow [2022-12-13 07:04:57,751 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:04:57,751 INFO L89 Accepts]: Start accepts. Operand has 71 places, 182 transitions, 4428 flow [2022-12-13 07:04:57,754 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:04:57,754 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:04:57,754 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 182 transitions, 4428 flow [2022-12-13 07:04:57,757 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 182 transitions, 4428 flow [2022-12-13 07:04:57,758 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:04:57,758 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:04:57,759 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 07:04:57,759 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 182 transitions, 4428 flow [2022-12-13 07:04:57,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:04:57,759 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:04:57,759 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:04:57,765 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 07:04:57,965 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 07:04:57,966 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 07:04:57,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:04:57,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1797954351, now seen corresponding path program 2 times [2022-12-13 07:04:57,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:04:57,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037192280] [2022-12-13 07:04:57,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:04:57,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:04:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:04:59,423 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 07:04:59,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:04:59,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037192280] [2022-12-13 07:04:59,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037192280] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:04:59,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065103175] [2022-12-13 07:04:59,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:04:59,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:04:59,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:04:59,425 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 07:04:59,451 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 07:04:59,557 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:04:59,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:04:59,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-13 07:04:59,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:04:59,681 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:04:59,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-13 07:04:59,753 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 07:04:59,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:05:00,397 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-13 07:05:00,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 52 [2022-12-13 07:05:00,432 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 07:05:00,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-12-13 07:05:00,444 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 07:05:00,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-12-13 07:05:00,447 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 07:05:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 07:05:00,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065103175] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:05:00,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:05:00,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 8] total 30 [2022-12-13 07:05:00,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250698934] [2022-12-13 07:05:00,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:05:00,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 07:05:00,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:05:00,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 07:05:00,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=807, Unknown=0, NotChecked=0, Total=930 [2022-12-13 07:05:00,476 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 07:05:00,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 182 transitions, 4428 flow. Second operand has 31 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 31 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 07:05:00,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:05:00,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 07:05:00,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:05:01,608 INFO L130 PetriNetUnfolder]: 291/520 cut-off events. [2022-12-13 07:05:01,608 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2022-12-13 07:05:01,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6818 conditions, 520 events. 291/520 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2058 event pairs, 0 based on Foata normal form. 1/429 useless extension candidates. Maximal degree in co-relation 5623. Up to 521 conditions per place. [2022-12-13 07:05:01,615 INFO L137 encePairwiseOnDemand]: 7/20 looper letters, 166 selfloop transitions, 38 changer transitions 6/210 dead transitions. [2022-12-13 07:05:01,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 210 transitions, 5532 flow [2022-12-13 07:05:01,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 07:05:01,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 07:05:01,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-12-13 07:05:01,616 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-13 07:05:01,617 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 61 predicate places. [2022-12-13 07:05:01,617 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 210 transitions, 5532 flow [2022-12-13 07:05:01,624 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 204 transitions, 5370 flow [2022-12-13 07:05:01,629 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:05:01,629 INFO L89 Accepts]: Start accepts. Operand has 84 places, 204 transitions, 5370 flow [2022-12-13 07:05:01,632 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:05:01,632 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:05:01,632 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 204 transitions, 5370 flow [2022-12-13 07:05:01,636 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 204 transitions, 5370 flow [2022-12-13 07:05:01,636 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:05:02,568 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 07:05:02,569 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 940 [2022-12-13 07:05:02,569 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 202 transitions, 5318 flow [2022-12-13 07:05:02,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 31 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 07:05:02,569 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:05:02,570 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:05:02,576 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 07:05:02,775 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 07:05:02,775 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 07:05:02,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:05:02,775 INFO L85 PathProgramCache]: Analyzing trace with hash 498874435, now seen corresponding path program 1 times [2022-12-13 07:05:02,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:05:02,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022141962] [2022-12-13 07:05:02,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:05:02,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:05:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:05:03,514 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 07:05:03,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:05:03,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022141962] [2022-12-13 07:05:03,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022141962] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:05:03,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103629344] [2022-12-13 07:05:03,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:05:03,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:05:03,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:05:03,516 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 07:05:03,518 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 07:05:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:05:03,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-13 07:05:03,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:05:03,733 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:05:03,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-13 07:05:03,819 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 07:05:03,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:05:04,412 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-13 07:05:04,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 52 [2022-12-13 07:05:04,441 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 07:05:04,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-12-13 07:05:04,448 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 07:05:04,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-12-13 07:05:04,451 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 07:05:04,469 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 07:05:04,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103629344] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:05:04,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:05:04,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 22 [2022-12-13 07:05:04,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808685179] [2022-12-13 07:05:04,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:05:04,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 07:05:04,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:05:04,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 07:05:04,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2022-12-13 07:05:04,471 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 07:05:04,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 202 transitions, 5318 flow. Second operand has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:04,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:05:04,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 07:05:04,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:05:05,079 INFO L130 PetriNetUnfolder]: 289/520 cut-off events. [2022-12-13 07:05:05,079 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-13 07:05:05,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7339 conditions, 520 events. 289/520 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2088 event pairs, 0 based on Foata normal form. 1/433 useless extension candidates. Maximal degree in co-relation 6110. Up to 521 conditions per place. [2022-12-13 07:05:05,087 INFO L137 encePairwiseOnDemand]: 9/20 looper letters, 172 selfloop transitions, 32 changer transitions 6/210 dead transitions. [2022-12-13 07:05:05,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 210 transitions, 5952 flow [2022-12-13 07:05:05,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 07:05:05,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 07:05:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 61 transitions. [2022-12-13 07:05:05,088 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25416666666666665 [2022-12-13 07:05:05,089 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 68 predicate places. [2022-12-13 07:05:05,089 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 210 transitions, 5952 flow [2022-12-13 07:05:05,095 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 204 transitions, 5778 flow [2022-12-13 07:05:05,100 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:05:05,100 INFO L89 Accepts]: Start accepts. Operand has 91 places, 204 transitions, 5778 flow [2022-12-13 07:05:05,104 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:05:05,104 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:05:05,104 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 204 transitions, 5778 flow [2022-12-13 07:05:05,108 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 204 transitions, 5778 flow [2022-12-13 07:05:05,108 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:05:05,109 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:05:05,110 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 07:05:05,110 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 204 transitions, 5778 flow [2022-12-13 07:05:05,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:05,110 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:05:05,110 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:05:05,122 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 07:05:05,322 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 07:05:05,322 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 07:05:05,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:05:05,323 INFO L85 PathProgramCache]: Analyzing trace with hash 535916395, now seen corresponding path program 2 times [2022-12-13 07:05:05,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:05:05,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121091195] [2022-12-13 07:05:05,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:05:05,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:05:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:05:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 07:05:06,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:05:06,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121091195] [2022-12-13 07:05:06,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121091195] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:05:06,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342484839] [2022-12-13 07:05:06,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:05:06,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:05:06,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:05:06,039 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 07:05:06,043 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 07:05:06,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:05:06,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:05:06,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-13 07:05:06,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:05:06,336 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:05:06,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-13 07:05:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 07:05:06,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:05:06,795 INFO L321 Elim1Store]: treesize reduction 15, result has 82.4 percent of original size [2022-12-13 07:05:06,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 165 treesize of output 107 [2022-12-13 07:05:06,892 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 07:05:06,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342484839] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:05:06,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:05:06,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 23 [2022-12-13 07:05:06,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642204663] [2022-12-13 07:05:06,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:05:06,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 07:05:06,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:05:06,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 07:05:06,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2022-12-13 07:05:06,894 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 07:05:06,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 204 transitions, 5778 flow. Second operand has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:06,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:05:06,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 07:05:06,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:05:07,799 INFO L130 PetriNetUnfolder]: 330/589 cut-off events. [2022-12-13 07:05:07,800 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-12-13 07:05:07,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8896 conditions, 589 events. 330/589 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2487 event pairs, 0 based on Foata normal form. 1/488 useless extension candidates. Maximal degree in co-relation 7520. Up to 590 conditions per place. [2022-12-13 07:05:07,806 INFO L137 encePairwiseOnDemand]: 10/20 looper letters, 194 selfloop transitions, 46 changer transitions 5/245 dead transitions. [2022-12-13 07:05:07,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 245 transitions, 7425 flow [2022-12-13 07:05:07,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 07:05:07,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 07:05:07,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 68 transitions. [2022-12-13 07:05:07,807 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24285714285714285 [2022-12-13 07:05:07,807 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 81 predicate places. [2022-12-13 07:05:07,807 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 245 transitions, 7425 flow [2022-12-13 07:05:07,815 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 240 transitions, 7269 flow [2022-12-13 07:05:07,821 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:05:07,821 INFO L89 Accepts]: Start accepts. Operand has 104 places, 240 transitions, 7269 flow [2022-12-13 07:05:07,824 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:05:07,824 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:05:07,825 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 240 transitions, 7269 flow [2022-12-13 07:05:07,829 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 240 transitions, 7269 flow [2022-12-13 07:05:07,829 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:05:09,141 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 07:05:09,142 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1321 [2022-12-13 07:05:09,142 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 238 transitions, 7209 flow [2022-12-13 07:05:09,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:09,142 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:05:09,142 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:05:09,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 07:05:09,347 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 07:05:09,348 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 07:05:09,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:05:09,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1404568005, now seen corresponding path program 1 times [2022-12-13 07:05:09,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:05:09,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691904217] [2022-12-13 07:05:09,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:05:09,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:05:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:05:10,171 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 07:05:10,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:05:10,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691904217] [2022-12-13 07:05:10,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691904217] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:05:10,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007850000] [2022-12-13 07:05:10,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:05:10,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:05:10,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:05:10,174 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 07:05:10,183 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 07:05:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:05:10,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-13 07:05:10,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:05:10,398 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:05:10,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-13 07:05:10,427 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 07:05:10,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:05:10,953 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-13 07:05:10,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 62 [2022-12-13 07:05:10,989 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-13 07:05:10,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-13 07:05:10,997 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-13 07:05:10,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-13 07:05:11,002 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 07:05:11,010 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-13 07:05:11,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-13 07:05:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 07:05:11,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007850000] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:05:11,041 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:05:11,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 20 [2022-12-13 07:05:11,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517118071] [2022-12-13 07:05:11,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:05:11,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 07:05:11,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:05:11,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 07:05:11,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2022-12-13 07:05:11,043 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 07:05:11,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 238 transitions, 7209 flow. Second operand has 21 states, 20 states have (on average 2.2) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:11,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:05:11,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 07:05:11,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:05:11,799 INFO L130 PetriNetUnfolder]: 351/620 cut-off events. [2022-12-13 07:05:11,799 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2022-12-13 07:05:11,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9983 conditions, 620 events. 351/620 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2660 event pairs, 0 based on Foata normal form. 1/509 useless extension candidates. Maximal degree in co-relation 8452. Up to 621 conditions per place. [2022-12-13 07:05:11,809 INFO L137 encePairwiseOnDemand]: 9/20 looper letters, 211 selfloop transitions, 41 changer transitions 5/257 dead transitions. [2022-12-13 07:05:11,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 257 transitions, 8302 flow [2022-12-13 07:05:11,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 07:05:11,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 07:05:11,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 65 transitions. [2022-12-13 07:05:11,810 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2708333333333333 [2022-12-13 07:05:11,811 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 88 predicate places. [2022-12-13 07:05:11,811 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 257 transitions, 8302 flow [2022-12-13 07:05:11,819 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 252 transitions, 8136 flow [2022-12-13 07:05:11,828 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:05:11,828 INFO L89 Accepts]: Start accepts. Operand has 111 places, 252 transitions, 8136 flow [2022-12-13 07:05:11,832 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:05:11,832 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:05:11,833 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 252 transitions, 8136 flow [2022-12-13 07:05:11,837 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 252 transitions, 8136 flow [2022-12-13 07:05:11,837 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:05:13,254 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 07:05:13,255 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1427 [2022-12-13 07:05:13,255 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 250 transitions, 8072 flow [2022-12-13 07:05:13,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.2) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:13,255 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:05:13,255 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:05:13,263 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 07:05:13,461 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 07:05:13,461 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 07:05:13,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:05:13,462 INFO L85 PathProgramCache]: Analyzing trace with hash 764274715, now seen corresponding path program 1 times [2022-12-13 07:05:13,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:05:13,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555447193] [2022-12-13 07:05:13,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:05:13,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:05:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:05:14,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:05:14,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:05:14,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555447193] [2022-12-13 07:05:14,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555447193] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:05:14,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297268455] [2022-12-13 07:05:14,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:05:14,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:05:14,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:05:14,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 07:05:14,208 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 07:05:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:05:14,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-13 07:05:14,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:05:14,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:05:14,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-13 07:05:14,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:05:14,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:05:14,862 INFO L321 Elim1Store]: treesize reduction 15, result has 82.4 percent of original size [2022-12-13 07:05:14,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 165 treesize of output 107 [2022-12-13 07:05:14,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:05:14,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297268455] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:05:14,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:05:14,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 23 [2022-12-13 07:05:14,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509111028] [2022-12-13 07:05:14,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:05:14,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 07:05:14,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:05:14,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 07:05:14,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2022-12-13 07:05:14,958 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 07:05:14,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 250 transitions, 8072 flow. Second operand has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:14,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:05:14,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 07:05:14,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:05:15,603 INFO L130 PetriNetUnfolder]: 351/622 cut-off events. [2022-12-13 07:05:15,604 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2022-12-13 07:05:15,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10638 conditions, 622 events. 351/622 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2706 event pairs, 0 based on Foata normal form. 1/513 useless extension candidates. Maximal degree in co-relation 9081. Up to 623 conditions per place. [2022-12-13 07:05:15,609 INFO L137 encePairwiseOnDemand]: 10/20 looper letters, 210 selfloop transitions, 42 changer transitions 6/258 dead transitions. [2022-12-13 07:05:15,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 258 transitions, 8850 flow [2022-12-13 07:05:15,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 07:05:15,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 07:05:15,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2022-12-13 07:05:15,617 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-13 07:05:15,618 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 96 predicate places. [2022-12-13 07:05:15,618 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 258 transitions, 8850 flow [2022-12-13 07:05:15,627 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 252 transitions, 8640 flow [2022-12-13 07:05:15,633 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:05:15,633 INFO L89 Accepts]: Start accepts. Operand has 119 places, 252 transitions, 8640 flow [2022-12-13 07:05:15,639 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:05:15,639 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:05:15,639 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 252 transitions, 8640 flow [2022-12-13 07:05:15,644 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 252 transitions, 8640 flow [2022-12-13 07:05:15,644 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:05:17,411 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 07:05:17,412 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1780 [2022-12-13 07:05:17,412 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 250 transitions, 8572 flow [2022-12-13 07:05:17,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:17,412 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:05:17,412 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:05:17,420 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 07:05:17,613 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 07:05:17,613 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 07:05:17,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:05:17,613 INFO L85 PathProgramCache]: Analyzing trace with hash -287386043, now seen corresponding path program 1 times [2022-12-13 07:05:17,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:05:17,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532559365] [2022-12-13 07:05:17,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:05:17,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:05:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:05:18,227 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 07:05:18,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:05:18,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532559365] [2022-12-13 07:05:18,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532559365] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:05:18,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596443625] [2022-12-13 07:05:18,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:05:18,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:05:18,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:05:18,232 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 07:05:18,258 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 07:05:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:05:18,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-13 07:05:18,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:05:18,492 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:05:18,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-13 07:05:18,525 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 07:05:18,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:05:19,040 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-13 07:05:19,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 62 [2022-12-13 07:05:19,080 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-13 07:05:19,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-13 07:05:19,087 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-13 07:05:19,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-13 07:05:19,092 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 07:05:19,098 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-13 07:05:19,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-13 07:05:19,129 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 07:05:19,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596443625] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:05:19,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:05:19,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 22 [2022-12-13 07:05:19,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144818735] [2022-12-13 07:05:19,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:05:19,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 07:05:19,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:05:19,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 07:05:19,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2022-12-13 07:05:19,130 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 07:05:19,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 250 transitions, 8572 flow. Second operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:19,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:05:19,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 07:05:19,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:05:19,687 INFO L130 PetriNetUnfolder]: 368/649 cut-off events. [2022-12-13 07:05:19,688 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-12-13 07:05:19,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11748 conditions, 649 events. 368/649 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2865 event pairs, 0 based on Foata normal form. 1/534 useless extension candidates. Maximal degree in co-relation 10064. Up to 650 conditions per place. [2022-12-13 07:05:19,694 INFO L137 encePairwiseOnDemand]: 11/20 looper letters, 226 selfloop transitions, 38 changer transitions 5/269 dead transitions. [2022-12-13 07:05:19,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 269 transitions, 9765 flow [2022-12-13 07:05:19,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 07:05:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 07:05:19,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-12-13 07:05:19,695 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25833333333333336 [2022-12-13 07:05:19,695 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 105 predicate places. [2022-12-13 07:05:19,695 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 269 transitions, 9765 flow [2022-12-13 07:05:19,703 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 264 transitions, 9579 flow [2022-12-13 07:05:19,728 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:05:19,729 INFO L89 Accepts]: Start accepts. Operand has 128 places, 264 transitions, 9579 flow [2022-12-13 07:05:19,732 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:05:19,732 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:05:19,732 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 264 transitions, 9579 flow [2022-12-13 07:05:19,737 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 264 transitions, 9579 flow [2022-12-13 07:05:19,737 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:05:19,738 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:05:19,739 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 07:05:19,739 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 264 transitions, 9579 flow [2022-12-13 07:05:19,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:19,739 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:05:19,739 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:05:19,749 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 07:05:19,945 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 07:05:19,945 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 07:05:19,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:05:19,946 INFO L85 PathProgramCache]: Analyzing trace with hash -2007513687, now seen corresponding path program 2 times [2022-12-13 07:05:19,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:05:19,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452076838] [2022-12-13 07:05:19,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:05:19,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:05:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:05:20,608 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 07:05:20,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:05:20,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452076838] [2022-12-13 07:05:20,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452076838] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:05:20,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476231922] [2022-12-13 07:05:20,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:05:20,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:05:20,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:05:20,610 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 07:05:20,613 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 07:05:20,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:05:20,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:05:20,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-13 07:05:20,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:05:20,812 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:05:20,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-13 07:05:20,862 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 07:05:20,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:05:21,336 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-13 07:05:21,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 62 [2022-12-13 07:05:21,366 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-13 07:05:21,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-13 07:05:21,373 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-13 07:05:21,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-13 07:05:21,388 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 07:05:21,395 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-13 07:05:21,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-13 07:05:21,433 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 07:05:21,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476231922] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:05:21,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:05:21,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 22 [2022-12-13 07:05:21,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295441408] [2022-12-13 07:05:21,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:05:21,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 07:05:21,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:05:21,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 07:05:21,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2022-12-13 07:05:21,435 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 07:05:21,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 264 transitions, 9579 flow. Second operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:21,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:05:21,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 07:05:21,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:05:21,988 INFO L130 PetriNetUnfolder]: 370/655 cut-off events. [2022-12-13 07:05:21,988 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-12-13 07:05:21,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12512 conditions, 655 events. 370/655 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2902 event pairs, 0 based on Foata normal form. 1/540 useless extension candidates. Maximal degree in co-relation 10736. Up to 656 conditions per place. [2022-12-13 07:05:21,994 INFO L137 encePairwiseOnDemand]: 11/20 looper letters, 229 selfloop transitions, 37 changer transitions 6/272 dead transitions. [2022-12-13 07:05:21,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 272 transitions, 10417 flow [2022-12-13 07:05:21,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:05:21,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:05:21,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 57 transitions. [2022-12-13 07:05:21,996 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2590909090909091 [2022-12-13 07:05:21,996 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 115 predicate places. [2022-12-13 07:05:21,996 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 272 transitions, 10417 flow [2022-12-13 07:05:22,004 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 266 transitions, 10183 flow [2022-12-13 07:05:22,010 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:05:22,010 INFO L89 Accepts]: Start accepts. Operand has 138 places, 266 transitions, 10183 flow [2022-12-13 07:05:22,014 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:05:22,014 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:05:22,014 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 266 transitions, 10183 flow [2022-12-13 07:05:22,019 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 266 transitions, 10183 flow [2022-12-13 07:05:22,019 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:05:22,020 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:05:22,024 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 07:05:22,024 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 266 transitions, 10183 flow [2022-12-13 07:05:22,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:22,024 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:05:22,024 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:05:22,033 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 07:05:22,230 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 07:05:22,230 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 07:05:22,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:05:22,230 INFO L85 PathProgramCache]: Analyzing trace with hash -296900379, now seen corresponding path program 3 times [2022-12-13 07:05:22,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:05:22,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026424104] [2022-12-13 07:05:22,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:05:22,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:05:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:05:22,871 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 07:05:22,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:05:22,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026424104] [2022-12-13 07:05:22,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026424104] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:05:22,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804640204] [2022-12-13 07:05:22,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:05:22,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:05:22,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:05:22,876 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 07:05:22,880 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 07:05:23,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 07:05:23,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:05:23,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-13 07:05:23,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:05:23,120 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:05:23,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-13 07:05:23,166 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 07:05:23,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:05:23,600 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-13 07:05:23,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 62 [2022-12-13 07:05:23,637 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-13 07:05:23,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-13 07:05:23,644 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-13 07:05:23,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-13 07:05:23,648 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 07:05:23,653 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-13 07:05:23,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-13 07:05:23,685 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 07:05:23,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804640204] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:05:23,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:05:23,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 22 [2022-12-13 07:05:23,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908220081] [2022-12-13 07:05:23,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:05:23,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 07:05:23,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:05:23,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 07:05:23,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2022-12-13 07:05:23,687 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 07:05:23,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 266 transitions, 10183 flow. Second operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:23,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:05:23,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 07:05:23,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:05:24,279 INFO L130 PetriNetUnfolder]: 372/662 cut-off events. [2022-12-13 07:05:24,280 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2022-12-13 07:05:24,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13309 conditions, 662 events. 372/662 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2960 event pairs, 2 based on Foata normal form. 1/548 useless extension candidates. Maximal degree in co-relation 11320. Up to 663 conditions per place. [2022-12-13 07:05:24,285 INFO L137 encePairwiseOnDemand]: 9/20 looper letters, 230 selfloop transitions, 41 changer transitions 3/274 dead transitions. [2022-12-13 07:05:24,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 274 transitions, 11041 flow [2022-12-13 07:05:24,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 07:05:24,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 07:05:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 64 transitions. [2022-12-13 07:05:24,287 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26666666666666666 [2022-12-13 07:05:24,287 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 126 predicate places. [2022-12-13 07:05:24,287 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 274 transitions, 11041 flow [2022-12-13 07:05:24,295 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 271 transitions, 10918 flow [2022-12-13 07:05:24,300 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:05:24,300 INFO L89 Accepts]: Start accepts. Operand has 149 places, 271 transitions, 10918 flow [2022-12-13 07:05:24,304 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:05:24,304 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:05:24,304 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 271 transitions, 10918 flow [2022-12-13 07:05:24,309 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 271 transitions, 10918 flow [2022-12-13 07:05:24,309 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:05:27,470 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:05:27,475 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3175 [2022-12-13 07:05:27,475 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 270 transitions, 10878 flow [2022-12-13 07:05:27,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:27,475 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:05:27,475 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:05:27,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 07:05:27,682 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 07:05:27,682 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 07:05:27,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:05:27,683 INFO L85 PathProgramCache]: Analyzing trace with hash -188195651, now seen corresponding path program 1 times [2022-12-13 07:05:27,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:05:27,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897346053] [2022-12-13 07:05:27,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:05:27,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:05:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:05:28,266 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 07:05:28,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:05:28,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897346053] [2022-12-13 07:05:28,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897346053] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:05:28,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619654582] [2022-12-13 07:05:28,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:05:28,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:05:28,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:05:28,272 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 07:05:28,275 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 07:05:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:05:28,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-13 07:05:28,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:05:28,497 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:05:28,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 24 [2022-12-13 07:05:28,534 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 07:05:28,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:05:28,901 INFO L321 Elim1Store]: treesize reduction 15, result has 82.4 percent of original size [2022-12-13 07:05:28,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 165 treesize of output 107 [2022-12-13 07:05:28,980 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 07:05:28,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619654582] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:05:28,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:05:28,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2022-12-13 07:05:28,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711381015] [2022-12-13 07:05:28,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:05:28,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 07:05:28,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:05:28,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 07:05:28,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2022-12-13 07:05:28,981 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-13 07:05:28,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 270 transitions, 10878 flow. Second operand has 21 states, 20 states have (on average 2.05) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:28,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:05:28,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-13 07:05:28,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:05:29,454 INFO L130 PetriNetUnfolder]: 405/717 cut-off events. [2022-12-13 07:05:29,455 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-12-13 07:05:29,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15128 conditions, 717 events. 405/717 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3299 event pairs, 0 based on Foata normal form. 1/593 useless extension candidates. Maximal degree in co-relation 13040. Up to 718 conditions per place. [2022-12-13 07:05:29,462 INFO L137 encePairwiseOnDemand]: 10/21 looper letters, 250 selfloop transitions, 40 changer transitions 1/291 dead transitions. [2022-12-13 07:05:29,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 291 transitions, 12306 flow [2022-12-13 07:05:29,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:05:29,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:05:29,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-12-13 07:05:29,463 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2510822510822511 [2022-12-13 07:05:29,464 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 134 predicate places. [2022-12-13 07:05:29,464 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 291 transitions, 12306 flow [2022-12-13 07:05:29,473 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 290 transitions, 12261 flow [2022-12-13 07:05:29,480 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:05:29,480 INFO L89 Accepts]: Start accepts. Operand has 157 places, 290 transitions, 12261 flow [2022-12-13 07:05:29,484 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:05:29,485 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:05:29,485 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 290 transitions, 12261 flow [2022-12-13 07:05:29,491 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 290 transitions, 12261 flow [2022-12-13 07:05:29,491 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:05:29,491 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:05:29,492 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 07:05:29,492 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 290 transitions, 12261 flow [2022-12-13 07:05:29,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:29,492 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:05:29,492 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:05:29,501 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 07:05:29,701 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 07:05:29,701 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 07:05:29,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:05:29,702 INFO L85 PathProgramCache]: Analyzing trace with hash 507420893, now seen corresponding path program 2 times [2022-12-13 07:05:29,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:05:29,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708108383] [2022-12-13 07:05:29,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:05:29,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:05:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:05:30,283 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 07:05:30,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:05:30,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708108383] [2022-12-13 07:05:30,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708108383] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:05:30,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883795964] [2022-12-13 07:05:30,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:05:30,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:05:30,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:05:30,288 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 07:05:30,292 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 07:05:30,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:05:30,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:05:30,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-13 07:05:30,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:05:30,614 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:05:30,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-13 07:05:30,652 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 07:05:30,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:05:31,038 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-13 07:05:31,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 77 [2022-12-13 07:05:31,083 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 07:05:31,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883795964] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:05:31,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:05:31,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2022-12-13 07:05:31,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374536690] [2022-12-13 07:05:31,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:05:31,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 07:05:31,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:05:31,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 07:05:31,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2022-12-13 07:05:31,084 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 07:05:31,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 290 transitions, 12261 flow. Second operand has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:31,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:05:31,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 07:05:31,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:05:32,231 INFO L130 PetriNetUnfolder]: 489/865 cut-off events. [2022-12-13 07:05:32,231 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2022-12-13 07:05:32,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19110 conditions, 865 events. 489/865 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4125 event pairs, 0 based on Foata normal form. 1/699 useless extension candidates. Maximal degree in co-relation 16300. Up to 866 conditions per place. [2022-12-13 07:05:32,237 INFO L137 encePairwiseOnDemand]: 9/18 looper letters, 286 selfloop transitions, 86 changer transitions 18/390 dead transitions. [2022-12-13 07:05:32,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 390 transitions, 17277 flow [2022-12-13 07:05:32,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 07:05:32,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 07:05:32,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 77 transitions. [2022-12-13 07:05:32,238 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3055555555555556 [2022-12-13 07:05:32,239 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 147 predicate places. [2022-12-13 07:05:32,239 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 390 transitions, 17277 flow [2022-12-13 07:05:32,246 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 372 transitions, 16470 flow [2022-12-13 07:05:32,251 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:05:32,251 INFO L89 Accepts]: Start accepts. Operand has 170 places, 372 transitions, 16470 flow [2022-12-13 07:05:32,258 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:05:32,258 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:05:32,258 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 372 transitions, 16470 flow [2022-12-13 07:05:32,265 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 372 transitions, 16470 flow [2022-12-13 07:05:32,265 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:05:32,266 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:05:32,266 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 07:05:32,266 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 372 transitions, 16470 flow [2022-12-13 07:05:32,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:32,267 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:05:32,267 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:05:32,276 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 07:05:32,473 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 07:05:32,473 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 07:05:32,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:05:32,474 INFO L85 PathProgramCache]: Analyzing trace with hash -922539811, now seen corresponding path program 3 times [2022-12-13 07:05:32,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:05:32,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235819394] [2022-12-13 07:05:32,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:05:32,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:05:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:05:33,069 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 07:05:33,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:05:33,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235819394] [2022-12-13 07:05:33,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235819394] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:05:33,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904084303] [2022-12-13 07:05:33,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:05:33,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:05:33,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:05:33,071 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 07:05:33,073 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 07:05:33,233 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 07:05:33,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:05:33,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-13 07:05:33,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:05:33,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:05:33,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 07:05:33,443 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:05:33,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-13 07:05:33,476 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 07:05:33,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:05:34,054 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (and (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_1220 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1220))) (= (select (select .cse0 c_~o_0~0.base) c_~o_0~0.offset) (select (select .cse0 ~o_2~0.base) c_~o_2~0.offset))))) (forall ((v_ArrVal_1220 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1220))) (let ((.cse3 (select .cse5 ~o_2~0.base))) (let ((.cse2 (select .cse3 c_~o_2~0.offset)) (.cse1 (select (select .cse5 c_~o_0~0.base) c_~o_0~0.offset))) (or (< .cse1 .cse2) (< .cse2 .cse1) (= (select .cse3 .cse4) |c_thread1Thread1of1ForFork0_#t~mem1#1|)))))) (forall ((v_ArrVal_1220 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1220))) (let ((.cse6 (select .cse9 ~o_2~0.base))) (let ((.cse8 (select .cse6 c_~o_2~0.offset)) (.cse7 (select (select .cse9 c_~o_0~0.base) c_~o_0~0.offset))) (or (< |c_thread1Thread1of1ForFork0_#t~mem1#1| (select .cse6 .cse4)) (= .cse7 .cse8) (< .cse8 .cse7)))))) (forall ((v_ArrVal_1220 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1220))) (let ((.cse10 (select .cse13 ~o_2~0.base))) (let ((.cse11 (select (select .cse13 c_~o_0~0.base) c_~o_0~0.offset)) (.cse12 (select .cse10 c_~o_2~0.offset))) (or (< (select .cse10 .cse4) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (< .cse11 .cse12) (= .cse11 .cse12)))))))) is different from false [2022-12-13 07:05:34,105 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-13 07:05:34,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 177 [2022-12-13 07:05:34,125 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:05:34,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 120 [2022-12-13 07:05:34,515 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 07:05:34,518 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:05:34,524 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 07:05:34,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 1 [2022-12-13 07:05:34,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:05:34,533 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 07:05:34,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 1 [2022-12-13 07:05:34,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:05:34,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904084303] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:05:34,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:05:34,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 27 [2022-12-13 07:05:34,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425940388] [2022-12-13 07:05:34,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:05:34,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-13 07:05:34,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:05:34,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 07:05:34,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=650, Unknown=1, NotChecked=52, Total=812 [2022-12-13 07:05:34,575 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 07:05:34,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 372 transitions, 16470 flow. Second operand has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:34,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:05:34,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 07:05:34,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:05:35,736 INFO L130 PetriNetUnfolder]: 523/916 cut-off events. [2022-12-13 07:05:35,736 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-13 07:05:35,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21147 conditions, 916 events. 523/916 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4435 event pairs, 2 based on Foata normal form. 3/747 useless extension candidates. Maximal degree in co-relation 18259. Up to 917 conditions per place. [2022-12-13 07:05:35,742 INFO L137 encePairwiseOnDemand]: 6/18 looper letters, 322 selfloop transitions, 91 changer transitions 12/425 dead transitions. [2022-12-13 07:05:35,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 425 transitions, 19664 flow [2022-12-13 07:05:35,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 07:05:35,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 07:05:35,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 70 transitions. [2022-12-13 07:05:35,745 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29914529914529914 [2022-12-13 07:05:35,745 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 159 predicate places. [2022-12-13 07:05:35,745 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 425 transitions, 19664 flow [2022-12-13 07:05:35,755 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 413 transitions, 19106 flow [2022-12-13 07:05:35,760 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:05:35,760 INFO L89 Accepts]: Start accepts. Operand has 180 places, 413 transitions, 19106 flow [2022-12-13 07:05:35,766 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:05:35,766 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:05:35,766 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 413 transitions, 19106 flow [2022-12-13 07:05:35,774 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 180 places, 413 transitions, 19106 flow [2022-12-13 07:05:35,775 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:05:35,775 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:05:35,776 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 07:05:35,776 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 413 transitions, 19106 flow [2022-12-13 07:05:35,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:35,776 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:05:35,776 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:05:35,782 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 07:05:35,976 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 07:05:35,977 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 07:05:35,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:05:35,977 INFO L85 PathProgramCache]: Analyzing trace with hash -754159191, now seen corresponding path program 4 times [2022-12-13 07:05:35,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:05:35,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611539033] [2022-12-13 07:05:35,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:05:35,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:05:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:05:36,659 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 07:05:36,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:05:36,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611539033] [2022-12-13 07:05:36,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611539033] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:05:36,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335301225] [2022-12-13 07:05:36,660 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:05:36,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:05:36,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:05:36,664 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 07:05:36,667 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 07:05:36,797 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:05:36,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:05:36,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-13 07:05:36,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:05:36,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2022-12-13 07:05:36,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:05:36,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2022-12-13 07:05:37,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-12-13 07:05:37,055 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 07:05:37,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:05:37,373 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_1296 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1296))) (= (select (select .cse14 c_~o_2~0.base) c_~o_2~0.offset) (select (select .cse14 c_~o_0~0.base) c_~o_0~0.offset))))) (.cse1 (= c_~result_5~0 0)) (.cse6 (< c_~result_5~0 0))) (and (or .cse0 (< |c_thread1Thread1of1ForFork0_~i~0#1| 5)) (or .cse1 (and (forall ((v_ArrVal_1296 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1296))) (let ((.cse3 (select (select .cse4 c_~o_0~0.base) c_~o_0~0.offset)) (.cse2 (select (select .cse4 c_~o_2~0.base) c_~o_2~0.offset))) (or (< .cse2 .cse3) (< .cse3 .cse2))))) (or (forall ((v_ArrVal_1296 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1296))) (< (select (select .cse5 c_~o_2~0.base) c_~o_2~0.offset) (select (select .cse5 c_~o_0~0.base) c_~o_0~0.offset)))) .cse6))) (or (and (forall ((v_ArrVal_1296 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1296))) (let ((.cse8 (select (select .cse9 c_~o_0~0.base) c_~o_0~0.offset)) (.cse7 (select (select .cse9 c_~o_2~0.base) c_~o_2~0.offset))) (or (= .cse7 .cse8) (< .cse8 .cse7))))) (or .cse0 .cse6) (or (forall ((v_ArrVal_1296 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1296))) (< (select (select .cse10 c_~o_0~0.base) c_~o_0~0.offset) (select (select .cse10 c_~o_2~0.base) c_~o_2~0.offset)))) .cse1)) (< 0 c_~result_5~0)) (or (forall ((v_ArrVal_1296 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1296))) (let ((.cse11 (select (select .cse13 c_~o_2~0.base) c_~o_2~0.offset)) (.cse12 (select (select .cse13 c_~o_0~0.base) c_~o_0~0.offset))) (or (< .cse11 .cse12) (= .cse11 .cse12))))) .cse6))) is different from false [2022-12-13 07:05:37,494 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~o_2~0.base)) (.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (and (forall ((~o_2~0.offset Int) (v_ArrVal_1296 (Array Int Int))) (let ((.cse0 (select .cse2 (+ .cse3 ~o_2~0.offset)))) (or (= .cse0 |c_thread1Thread1of1ForFork0_#t~mem1#1|) (< |c_thread1Thread1of1ForFork0_#t~mem1#1| .cse0) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1296))) (< (select (select .cse1 c_~o_2~0.base) ~o_2~0.offset) (select (select .cse1 c_~o_0~0.base) c_~o_0~0.offset)))))) (forall ((~o_2~0.offset Int) (v_ArrVal_1296 (Array Int Int))) (let ((.cse4 (select .cse2 (+ .cse3 ~o_2~0.offset)))) (or (= .cse4 |c_thread1Thread1of1ForFork0_#t~mem1#1|) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1296))) (< (select (select .cse5 c_~o_0~0.base) c_~o_0~0.offset) (select (select .cse5 c_~o_2~0.base) ~o_2~0.offset))) (< .cse4 |c_thread1Thread1of1ForFork0_#t~mem1#1|)))) (forall ((~o_2~0.offset Int) (v_ArrVal_1296 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1296))) (let ((.cse7 (select (select .cse8 c_~o_2~0.base) ~o_2~0.offset)) (.cse6 (select (select .cse8 c_~o_0~0.base) c_~o_0~0.offset))) (or (= (select .cse2 (+ .cse3 ~o_2~0.offset)) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (< .cse6 .cse7) (< .cse7 .cse6))))) (forall ((~o_2~0.offset Int) (v_ArrVal_1296 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1296))) (let ((.cse9 (select (select .cse11 c_~o_2~0.base) ~o_2~0.offset)) (.cse10 (select (select .cse11 c_~o_0~0.base) c_~o_0~0.offset))) (or (< |c_thread1Thread1of1ForFork0_#t~mem1#1| (select .cse2 (+ .cse3 ~o_2~0.offset))) (= .cse9 .cse10) (< .cse9 .cse10))))) (forall ((~o_2~0.offset Int) (v_ArrVal_1296 (Array Int Int))) (let ((.cse12 (select .cse2 (+ .cse3 ~o_2~0.offset)))) (or (< |c_thread1Thread1of1ForFork0_#t~mem1#1| .cse12) (< .cse12 |c_thread1Thread1of1ForFork0_#t~mem1#1|) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1296))) (= (select (select .cse13 c_~o_2~0.base) ~o_2~0.offset) (select (select .cse13 c_~o_0~0.base) c_~o_0~0.offset)))))) (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((~o_2~0.offset Int) (v_ArrVal_1296 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1296))) (= (select (select .cse14 c_~o_2~0.base) ~o_2~0.offset) (select (select .cse14 c_~o_0~0.base) c_~o_0~0.offset))))) (forall ((~o_2~0.offset Int) (v_ArrVal_1296 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1296))) (let ((.cse16 (select (select .cse17 c_~o_2~0.base) ~o_2~0.offset)) (.cse15 (select (select .cse17 c_~o_0~0.base) c_~o_0~0.offset))) (or (< .cse15 .cse16) (< (select .cse2 (+ .cse3 ~o_2~0.offset)) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (= .cse16 .cse15))))))) is different from false [2022-12-13 07:05:37,561 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-13 07:05:37,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 150 treesize of output 159 [2022-12-13 07:05:37,572 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:05:37,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 91 [2022-12-13 07:05:37,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:05:37,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:05:37,754 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 07:05:37,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 1 [2022-12-13 07:05:37,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:05:37,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:05:37,761 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 07:05:37,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-12-13 07:05:37,763 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:05:37,765 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:05:37,771 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 07:05:37,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 1 [2022-12-13 07:05:37,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:05:37,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:05:37,778 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 07:05:37,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 1 [2022-12-13 07:05:37,781 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 07:05:37,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:05:37,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:05:37,793 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 07:05:37,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 1 [2022-12-13 07:05:37,858 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 07:05:37,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335301225] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:05:37,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:05:37,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-13 07:05:37,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934387586] [2022-12-13 07:05:37,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:05:37,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 07:05:37,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:05:37,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 07:05:37,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=758, Unknown=2, NotChecked=114, Total=992 [2022-12-13 07:05:37,859 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 07:05:37,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 413 transitions, 19106 flow. Second operand has 32 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 31 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:37,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:05:37,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 07:05:37,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:05:44,983 INFO L130 PetriNetUnfolder]: 620/1080 cut-off events. [2022-12-13 07:05:44,984 INFO L131 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2022-12-13 07:05:44,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26016 conditions, 1080 events. 620/1080 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5324 event pairs, 2 based on Foata normal form. 1/870 useless extension candidates. Maximal degree in co-relation 22082. Up to 1081 conditions per place. [2022-12-13 07:05:44,991 INFO L137 encePairwiseOnDemand]: 9/18 looper letters, 374 selfloop transitions, 98 changer transitions 4/476 dead transitions. [2022-12-13 07:05:44,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 476 transitions, 22992 flow [2022-12-13 07:05:44,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:05:44,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:05:44,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2022-12-13 07:05:44,992 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37373737373737376 [2022-12-13 07:05:44,993 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 167 predicate places. [2022-12-13 07:05:44,993 INFO L82 GeneralOperation]: Start removeDead. Operand has 190 places, 476 transitions, 22992 flow [2022-12-13 07:05:45,004 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 190 places, 472 transitions, 22794 flow [2022-12-13 07:05:45,012 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:05:45,012 INFO L89 Accepts]: Start accepts. Operand has 190 places, 472 transitions, 22794 flow [2022-12-13 07:05:45,017 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:05:45,017 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:05:45,017 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 190 places, 472 transitions, 22794 flow [2022-12-13 07:05:45,026 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 472 transitions, 22794 flow [2022-12-13 07:05:45,026 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:05:45,028 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:05:45,028 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 07:05:45,028 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 472 transitions, 22794 flow [2022-12-13 07:05:45,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 31 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:45,028 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:05:45,028 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:05:45,038 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 07:05:45,237 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 07:05:45,238 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 07:05:45,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:05:45,238 INFO L85 PathProgramCache]: Analyzing trace with hash -819520611, now seen corresponding path program 5 times [2022-12-13 07:05:45,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:05:45,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586514457] [2022-12-13 07:05:45,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:05:45,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:05:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:05:45,911 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 07:05:45,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:05:45,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586514457] [2022-12-13 07:05:45,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586514457] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:05:45,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801203222] [2022-12-13 07:05:45,911 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:05:45,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:05:45,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:05:45,913 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 07:05:45,938 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 07:05:46,073 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 07:05:46,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:05:46,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-13 07:05:46,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:05:46,159 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:05:46,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-13 07:05:46,247 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 07:05:46,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:05:46,615 INFO L321 Elim1Store]: treesize reduction 15, result has 82.4 percent of original size [2022-12-13 07:05:46,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 144 treesize of output 102 [2022-12-13 07:05:46,787 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 07:05:46,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801203222] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:05:46,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:05:46,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 22 [2022-12-13 07:05:46,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374782071] [2022-12-13 07:05:46,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:05:46,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 07:05:46,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:05:46,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 07:05:46,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2022-12-13 07:05:46,789 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 07:05:46,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 472 transitions, 22794 flow. Second operand has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:46,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:05:46,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 07:05:46,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:05:47,846 INFO L130 PetriNetUnfolder]: 613/1081 cut-off events. [2022-12-13 07:05:47,846 INFO L131 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2022-12-13 07:05:47,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27122 conditions, 1081 events. 613/1081 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5418 event pairs, 2 based on Foata normal form. 1/877 useless extension candidates. Maximal degree in co-relation 23076. Up to 1082 conditions per place. [2022-12-13 07:05:47,857 INFO L137 encePairwiseOnDemand]: 7/18 looper letters, 413 selfloop transitions, 55 changer transitions 10/478 dead transitions. [2022-12-13 07:05:47,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 478 transitions, 24044 flow [2022-12-13 07:05:47,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 07:05:47,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 07:05:47,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 61 transitions. [2022-12-13 07:05:47,858 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2824074074074074 [2022-12-13 07:05:47,858 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 178 predicate places. [2022-12-13 07:05:47,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 201 places, 478 transitions, 24044 flow [2022-12-13 07:05:47,875 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 200 places, 468 transitions, 23535 flow [2022-12-13 07:05:47,886 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:05:47,887 INFO L89 Accepts]: Start accepts. Operand has 200 places, 468 transitions, 23535 flow [2022-12-13 07:05:47,894 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:05:47,894 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:05:47,894 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 468 transitions, 23535 flow [2022-12-13 07:05:47,906 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 468 transitions, 23535 flow [2022-12-13 07:05:47,906 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:05:47,907 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:05:47,908 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 07:05:47,908 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 468 transitions, 23535 flow [2022-12-13 07:05:47,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:47,908 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:05:47,908 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:05:47,915 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 07:05:48,114 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 07:05:48,114 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 07:05:48,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:05:48,114 INFO L85 PathProgramCache]: Analyzing trace with hash 876731305, now seen corresponding path program 6 times [2022-12-13 07:05:48,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:05:48,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165710204] [2022-12-13 07:05:48,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:05:48,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:05:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:05:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:05:48,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:05:48,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165710204] [2022-12-13 07:05:48,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165710204] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:05:48,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628450948] [2022-12-13 07:05:48,692 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:05:48,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:05:48,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:05:48,693 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 07:05:48,695 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 07:05:48,912 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 07:05:48,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:05:48,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-13 07:05:48,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:05:48,982 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:05:48,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-13 07:05:49,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:05:49,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:05:49,543 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-13 07:05:49,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 62 [2022-12-13 07:05:49,584 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-13 07:05:49,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-13 07:05:49,594 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-13 07:05:49,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-13 07:05:49,600 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 07:05:49,608 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-13 07:05:49,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-13 07:05:49,653 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 07:05:49,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628450948] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:05:49,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:05:49,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 21 [2022-12-13 07:05:49,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26966488] [2022-12-13 07:05:49,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:05:49,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 07:05:49,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:05:49,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 07:05:49,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2022-12-13 07:05:49,655 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 07:05:49,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 468 transitions, 23535 flow. Second operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:49,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:05:49,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 07:05:49,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:05:50,568 INFO L130 PetriNetUnfolder]: 632/1117 cut-off events. [2022-12-13 07:05:50,568 INFO L131 PetriNetUnfolder]: For 91/91 co-relation queries the response was YES. [2022-12-13 07:05:50,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29142 conditions, 1117 events. 632/1117 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5693 event pairs, 0 based on Foata normal form. 2/902 useless extension candidates. Maximal degree in co-relation 24804. Up to 1118 conditions per place. [2022-12-13 07:05:50,577 INFO L137 encePairwiseOnDemand]: 8/18 looper letters, 436 selfloop transitions, 48 changer transitions 11/495 dead transitions. [2022-12-13 07:05:50,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 495 transitions, 25890 flow [2022-12-13 07:05:50,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 07:05:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 07:05:50,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2022-12-13 07:05:50,579 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2022-12-13 07:05:50,579 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 188 predicate places. [2022-12-13 07:05:50,579 INFO L82 GeneralOperation]: Start removeDead. Operand has 211 places, 495 transitions, 25890 flow [2022-12-13 07:05:50,592 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 211 places, 484 transitions, 25306 flow [2022-12-13 07:05:50,603 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:05:50,603 INFO L89 Accepts]: Start accepts. Operand has 211 places, 484 transitions, 25306 flow [2022-12-13 07:05:50,607 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:05:50,607 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:05:50,608 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 484 transitions, 25306 flow [2022-12-13 07:05:50,616 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 211 places, 484 transitions, 25306 flow [2022-12-13 07:05:50,616 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:05:50,617 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:05:50,618 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 07:05:50,618 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 484 transitions, 25306 flow [2022-12-13 07:05:50,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:50,618 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:05:50,618 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:05:50,623 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 07:05:50,819 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 07:05:50,819 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 07:05:50,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:05:50,820 INFO L85 PathProgramCache]: Analyzing trace with hash -60780899, now seen corresponding path program 7 times [2022-12-13 07:05:50,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:05:50,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17103267] [2022-12-13 07:05:50,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:05:50,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:05:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:05:51,316 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 07:05:51,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:05:51,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17103267] [2022-12-13 07:05:51,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17103267] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:05:51,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655480477] [2022-12-13 07:05:51,317 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:05:51,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:05:51,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:05:51,318 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 07:05:51,319 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 07:05:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:05:51,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-13 07:05:51,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:05:51,589 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:05:51,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 24 [2022-12-13 07:05:51,631 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 07:05:51,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:05:52,161 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-13 07:05:52,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 62 [2022-12-13 07:05:52,196 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-13 07:05:52,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-13 07:05:52,204 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-13 07:05:52,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-13 07:05:52,208 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 07:05:52,215 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-13 07:05:52,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-13 07:05:52,243 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 07:05:52,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655480477] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:05:52,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:05:52,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2022-12-13 07:05:52,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891871341] [2022-12-13 07:05:52,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:05:52,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 07:05:52,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:05:52,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 07:05:52,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-12-13 07:05:52,244 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 07:05:52,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 484 transitions, 25306 flow. Second operand has 20 states, 19 states have (on average 2.0) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:52,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:05:52,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 07:05:52,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:05:52,971 INFO L130 PetriNetUnfolder]: 632/1116 cut-off events. [2022-12-13 07:05:52,971 INFO L131 PetriNetUnfolder]: For 90/90 co-relation queries the response was YES. [2022-12-13 07:05:52,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30232 conditions, 1116 events. 632/1116 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5692 event pairs, 2 based on Foata normal form. 1/904 useless extension candidates. Maximal degree in co-relation 25703. Up to 1117 conditions per place. [2022-12-13 07:05:52,980 INFO L137 encePairwiseOnDemand]: 8/18 looper letters, 442 selfloop transitions, 46 changer transitions 5/493 dead transitions. [2022-12-13 07:05:52,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 493 transitions, 26769 flow [2022-12-13 07:05:52,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:05:52,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:05:52,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 61 transitions. [2022-12-13 07:05:52,981 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30808080808080807 [2022-12-13 07:05:52,981 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 198 predicate places. [2022-12-13 07:05:52,981 INFO L82 GeneralOperation]: Start removeDead. Operand has 221 places, 493 transitions, 26769 flow [2022-12-13 07:05:52,995 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 221 places, 488 transitions, 26493 flow [2022-12-13 07:05:53,002 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:05:53,003 INFO L89 Accepts]: Start accepts. Operand has 221 places, 488 transitions, 26493 flow [2022-12-13 07:05:53,010 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:05:53,010 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:05:53,010 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 488 transitions, 26493 flow [2022-12-13 07:05:53,023 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 221 places, 488 transitions, 26493 flow [2022-12-13 07:05:53,023 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:05:53,024 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:05:53,025 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-13 07:05:53,025 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 488 transitions, 26493 flow [2022-12-13 07:05:53,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:53,025 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:05:53,025 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:05:53,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-13 07:05:53,231 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 07:05:53,231 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 07:05:53,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:05:53,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1664608323, now seen corresponding path program 8 times [2022-12-13 07:05:53,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:05:53,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635245168] [2022-12-13 07:05:53,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:05:53,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:05:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:05:53,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:05:53,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:05:53,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635245168] [2022-12-13 07:05:53,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635245168] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:05:53,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066925178] [2022-12-13 07:05:53,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:05:53,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:05:53,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:05:53,915 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 07:05:53,917 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 07:05:54,060 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:05:54,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:05:54,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-13 07:05:54,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:05:54,126 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:05:54,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-13 07:05:54,175 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 07:05:54,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:05:54,687 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-13 07:05:54,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 62 [2022-12-13 07:05:54,732 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-13 07:05:54,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-13 07:05:54,742 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-13 07:05:54,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-13 07:05:54,747 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 07:05:54,755 INFO L321 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2022-12-13 07:05:54,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 1 [2022-12-13 07:05:54,784 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 07:05:54,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066925178] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:05:54,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:05:54,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 21 [2022-12-13 07:05:54,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851294896] [2022-12-13 07:05:54,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:05:54,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 07:05:54,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:05:54,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 07:05:54,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2022-12-13 07:05:54,785 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 07:05:54,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 488 transitions, 26493 flow. Second operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:54,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:05:54,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 07:05:54,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:05:55,554 INFO L130 PetriNetUnfolder]: 623/1101 cut-off events. [2022-12-13 07:05:55,555 INFO L131 PetriNetUnfolder]: For 86/86 co-relation queries the response was YES. [2022-12-13 07:05:55,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30927 conditions, 1101 events. 623/1101 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5605 event pairs, 2 based on Foata normal form. 1/899 useless extension candidates. Maximal degree in co-relation 26458. Up to 1102 conditions per place. [2022-12-13 07:05:55,564 INFO L137 encePairwiseOnDemand]: 8/18 looper letters, 431 selfloop transitions, 44 changer transitions 10/485 dead transitions. [2022-12-13 07:05:55,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 485 transitions, 27301 flow [2022-12-13 07:05:55,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:05:55,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:05:55,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2022-12-13 07:05:55,565 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31313131313131315 [2022-12-13 07:05:55,565 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 208 predicate places. [2022-12-13 07:05:55,565 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 485 transitions, 27301 flow [2022-12-13 07:05:55,580 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 231 places, 475 transitions, 26732 flow [2022-12-13 07:05:55,589 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:05:55,589 INFO L89 Accepts]: Start accepts. Operand has 231 places, 475 transitions, 26732 flow [2022-12-13 07:05:55,594 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:05:55,595 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:05:55,595 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 475 transitions, 26732 flow [2022-12-13 07:05:55,605 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 231 places, 475 transitions, 26732 flow [2022-12-13 07:05:55,605 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:05:55,606 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:05:55,607 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 07:05:55,607 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 475 transitions, 26732 flow [2022-12-13 07:05:55,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:55,607 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:05:55,607 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:05:55,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-13 07:05:55,809 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 07:05:55,809 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 07:05:55,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:05:55,810 INFO L85 PathProgramCache]: Analyzing trace with hash 671773277, now seen corresponding path program 9 times [2022-12-13 07:05:55,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:05:55,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221793130] [2022-12-13 07:05:55,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:05:55,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:05:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:05:56,541 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 07:05:56,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:05:56,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221793130] [2022-12-13 07:05:56,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221793130] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:05:56,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625631234] [2022-12-13 07:05:56,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:05:56,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:05:56,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:05:56,544 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 07:05:56,546 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 07:05:56,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:05:56,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:05:56,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-13 07:05:56,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:05:56,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:05:56,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 07:05:56,917 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:05:56,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-13 07:05:56,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:05:56,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:05:57,565 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (and (forall ((v_ArrVal_1657 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1657))) (let ((.cse2 (select .cse4 ~o_2~0.base))) (let ((.cse1 (select (select .cse4 c_~o_0~0.base) c_~o_0~0.offset)) (.cse0 (select .cse2 c_~o_2~0.offset))) (or (< .cse0 .cse1) (< .cse1 .cse0) (= |c_thread1Thread1of1ForFork0_#t~mem1#1| (select .cse2 .cse3))))))) (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_1657 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1657))) (= (select (select .cse5 ~o_2~0.base) c_~o_2~0.offset) (select (select .cse5 c_~o_0~0.base) c_~o_0~0.offset))))) (forall ((v_ArrVal_1657 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1657))) (let ((.cse8 (select .cse9 ~o_2~0.base))) (let ((.cse6 (select .cse8 c_~o_2~0.offset)) (.cse7 (select (select .cse9 c_~o_0~0.base) c_~o_0~0.offset))) (or (< .cse6 .cse7) (< |c_thread1Thread1of1ForFork0_#t~mem1#1| (select .cse8 .cse3)) (= .cse6 .cse7)))))) (forall ((v_ArrVal_1657 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1657))) (let ((.cse10 (select .cse13 ~o_2~0.base))) (let ((.cse12 (select .cse10 c_~o_2~0.offset)) (.cse11 (select (select .cse13 c_~o_0~0.base) c_~o_0~0.offset))) (or (< (select .cse10 .cse3) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (< .cse11 .cse12) (= .cse12 .cse11)))))))) is different from false [2022-12-13 07:05:57,623 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-13 07:05:57,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 177 [2022-12-13 07:05:57,649 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:05:57,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 120 [2022-12-13 07:05:57,945 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:05:57,947 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 07:05:57,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:05:57,957 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 07:05:57,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 1 [2022-12-13 07:05:57,960 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:05:57,968 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 07:05:57,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 1 [2022-12-13 07:05:58,066 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 07:05:58,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625631234] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:05:58,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:05:58,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 27 [2022-12-13 07:05:58,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046630875] [2022-12-13 07:05:58,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:05:58,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-13 07:05:58,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:05:58,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 07:05:58,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=647, Unknown=1, NotChecked=52, Total=812 [2022-12-13 07:05:58,068 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 07:05:58,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 475 transitions, 26732 flow. Second operand has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:58,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:05:58,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 07:05:58,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:05:59,364 INFO L130 PetriNetUnfolder]: 630/1116 cut-off events. [2022-12-13 07:05:59,364 INFO L131 PetriNetUnfolder]: For 86/86 co-relation queries the response was YES. [2022-12-13 07:05:59,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32465 conditions, 1116 events. 630/1116 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5755 event pairs, 0 based on Foata normal form. 1/910 useless extension candidates. Maximal degree in co-relation 27663. Up to 1117 conditions per place. [2022-12-13 07:05:59,374 INFO L137 encePairwiseOnDemand]: 6/18 looper letters, 391 selfloop transitions, 101 changer transitions 5/497 dead transitions. [2022-12-13 07:05:59,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 497 transitions, 28970 flow [2022-12-13 07:05:59,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 07:05:59,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 07:05:59,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 69 transitions. [2022-12-13 07:05:59,375 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2948717948717949 [2022-12-13 07:05:59,376 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 220 predicate places. [2022-12-13 07:05:59,376 INFO L82 GeneralOperation]: Start removeDead. Operand has 243 places, 497 transitions, 28970 flow [2022-12-13 07:05:59,392 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 243 places, 492 transitions, 28674 flow [2022-12-13 07:05:59,401 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:05:59,401 INFO L89 Accepts]: Start accepts. Operand has 243 places, 492 transitions, 28674 flow [2022-12-13 07:05:59,410 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:05:59,410 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:05:59,410 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 243 places, 492 transitions, 28674 flow [2022-12-13 07:05:59,419 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 243 places, 492 transitions, 28674 flow [2022-12-13 07:05:59,419 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:05:59,421 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:05:59,421 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-13 07:05:59,422 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 492 transitions, 28674 flow [2022-12-13 07:05:59,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:05:59,422 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:05:59,422 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:05:59,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-13 07:05:59,628 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 07:05:59,628 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 07:05:59,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:05:59,628 INFO L85 PathProgramCache]: Analyzing trace with hash -932054147, now seen corresponding path program 10 times [2022-12-13 07:05:59,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:05:59,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30899806] [2022-12-13 07:05:59,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:05:59,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:05:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:06:00,330 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 07:06:00,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:06:00,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30899806] [2022-12-13 07:06:00,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30899806] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:06:00,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429095571] [2022-12-13 07:06:00,331 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:06:00,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:06:00,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:06:00,332 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 07:06:00,333 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 07:06:00,471 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:06:00,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:06:00,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 07:06:00,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:06:00,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:06:00,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 07:06:00,618 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:06:00,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2022-12-13 07:06:00,676 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 07:06:00,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:06:51,198 WARN L233 SmtUtils]: Spent 38.11s on a formula simplification. DAG size of input: 44 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 07:07:13,410 WARN L233 SmtUtils]: Spent 12.11s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 07:07:14,301 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (and (forall ((~o_2~0.offset Int) (v_ArrVal_1730 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1730))) (let ((.cse0 (select .cse1 ~o_2~0.base))) (let ((.cse2 (select .cse0 (+ .cse3 ~o_2~0.offset)))) (or (= (select .cse0 ~o_2~0.offset) (select (select .cse1 c_~o_0~0.base) c_~o_0~0.offset)) (< |c_thread1Thread1of1ForFork0_#t~mem1#1| .cse2) (< .cse2 |c_thread1Thread1of1ForFork0_#t~mem1#1|)))))) (forall ((~o_2~0.offset Int) (v_ArrVal_1730 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1730))) (let ((.cse6 (select .cse7 ~o_2~0.base))) (let ((.cse4 (select .cse6 ~o_2~0.offset)) (.cse5 (select (select .cse7 c_~o_0~0.base) c_~o_0~0.offset))) (or (< .cse4 .cse5) (= .cse4 .cse5) (< |c_thread1Thread1of1ForFork0_#t~mem1#1| (select .cse6 (+ .cse3 ~o_2~0.offset)))))))) (forall ((~o_2~0.offset Int) (v_ArrVal_1730 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1730))) (let ((.cse10 (select .cse11 ~o_2~0.base))) (let ((.cse9 (select (select .cse11 c_~o_0~0.base) c_~o_0~0.offset)) (.cse8 (select .cse10 ~o_2~0.offset))) (or (< .cse8 .cse9) (= (select .cse10 (+ .cse3 ~o_2~0.offset)) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (< .cse9 .cse8)))))) (forall ((~o_2~0.offset Int) (v_ArrVal_1730 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1730))) (let ((.cse14 (select .cse13 ~o_2~0.base))) (let ((.cse12 (select .cse14 (+ .cse3 ~o_2~0.offset)))) (or (< .cse12 |c_thread1Thread1of1ForFork0_#t~mem1#1|) (= .cse12 |c_thread1Thread1of1ForFork0_#t~mem1#1|) (< (select (select .cse13 c_~o_0~0.base) c_~o_0~0.offset) (select .cse14 ~o_2~0.offset))))))) (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((~o_2~0.offset Int) (v_ArrVal_1730 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1730))) (= (select (select .cse15 ~o_2~0.base) ~o_2~0.offset) (select (select .cse15 c_~o_0~0.base) c_~o_0~0.offset))))))) is different from false [2022-12-13 07:07:14,319 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-13 07:07:14,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 57 [2022-12-13 07:07:14,329 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:07:14,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2022-12-13 07:07:14,376 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:07:14,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 192 [2022-12-13 07:07:14,396 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:07:14,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 120 [2022-12-13 07:07:15,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:07:15,264 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 07:07:15,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 1 [2022-12-13 07:07:15,266 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:07:15,271 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 07:07:15,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 1 [2022-12-13 07:07:15,273 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:07:15,278 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 07:07:15,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 1 [2022-12-13 07:07:15,318 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 07:07:15,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429095571] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:07:15,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:07:15,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 28 [2022-12-13 07:07:15,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767504539] [2022-12-13 07:07:15,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:07:15,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-13 07:07:15,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:15,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-13 07:07:15,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=687, Unknown=10, NotChecked=54, Total=870 [2022-12-13 07:07:15,320 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 07:07:15,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 492 transitions, 28674 flow. Second operand has 30 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 29 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 07:07:15,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:15,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 07:07:15,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:18,646 INFO L130 PetriNetUnfolder]: 660/1178 cut-off events. [2022-12-13 07:07:18,646 INFO L131 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2022-12-13 07:07:18,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35448 conditions, 1178 events. 660/1178 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 6203 event pairs, 0 based on Foata normal form. 1/964 useless extension candidates. Maximal degree in co-relation 29756. Up to 1179 conditions per place. [2022-12-13 07:07:18,660 INFO L137 encePairwiseOnDemand]: 6/18 looper letters, 432 selfloop transitions, 104 changer transitions 6/542 dead transitions. [2022-12-13 07:07:18,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 542 transitions, 32682 flow [2022-12-13 07:07:18,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 07:07:18,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 07:07:18,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-12-13 07:07:18,661 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3194444444444444 [2022-12-13 07:07:18,663 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 231 predicate places. [2022-12-13 07:07:18,663 INFO L82 GeneralOperation]: Start removeDead. Operand has 254 places, 542 transitions, 32682 flow [2022-12-13 07:07:18,681 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 254 places, 536 transitions, 32316 flow [2022-12-13 07:07:18,689 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:18,690 INFO L89 Accepts]: Start accepts. Operand has 254 places, 536 transitions, 32316 flow [2022-12-13 07:07:18,697 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:18,697 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:18,697 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 254 places, 536 transitions, 32316 flow [2022-12-13 07:07:18,709 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 254 places, 536 transitions, 32316 flow [2022-12-13 07:07:18,709 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:18,710 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:18,711 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 07:07:18,711 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 536 transitions, 32316 flow [2022-12-13 07:07:18,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 29 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 07:07:18,711 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:18,711 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:18,718 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 07:07:18,917 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 07:07:18,918 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 07:07:18,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:18,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1609285481, now seen corresponding path program 11 times [2022-12-13 07:07:18,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:18,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912473780] [2022-12-13 07:07:18,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:18,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:19,528 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 07:07:19,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:19,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912473780] [2022-12-13 07:07:19,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912473780] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:07:19,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146037948] [2022-12-13 07:07:19,529 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:07:19,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:07:19,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:07:19,530 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 07:07:19,532 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 07:07:19,687 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:07:19,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:07:19,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-13 07:07:19,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:07:19,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:07:19,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 07:07:19,882 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:07:19,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-13 07:07:19,951 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 07:07:19,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:07:20,563 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (and (forall ((v_ArrVal_1803 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1803))) (let ((.cse2 (select .cse4 ~o_2~0.base))) (let ((.cse0 (select (select .cse4 c_~o_0~0.base) c_~o_0~0.offset)) (.cse1 (select .cse2 c_~o_2~0.offset))) (or (< .cse0 .cse1) (= .cse0 .cse1) (< (select .cse2 .cse3) |c_thread1Thread1of1ForFork0_#t~mem1#1|)))))) (forall ((v_ArrVal_1803 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1803))) (let ((.cse7 (select .cse8 ~o_2~0.base))) (let ((.cse6 (select .cse7 c_~o_2~0.offset)) (.cse5 (select (select .cse8 c_~o_0~0.base) c_~o_0~0.offset))) (or (= .cse5 .cse6) (< .cse6 .cse5) (< |c_thread1Thread1of1ForFork0_#t~mem1#1| (select .cse7 .cse3))))))) (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_1803 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1803))) (= (select (select .cse9 c_~o_0~0.base) c_~o_0~0.offset) (select (select .cse9 ~o_2~0.base) c_~o_2~0.offset))))) (forall ((v_ArrVal_1803 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1803))) (let ((.cse12 (select .cse13 ~o_2~0.base))) (let ((.cse11 (select .cse12 c_~o_2~0.offset)) (.cse10 (select (select .cse13 c_~o_0~0.base) c_~o_0~0.offset))) (or (< .cse10 .cse11) (< .cse11 .cse10) (= (select .cse12 .cse3) |c_thread1Thread1of1ForFork0_#t~mem1#1|)))))))) is different from false [2022-12-13 07:07:20,622 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-13 07:07:20,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 177 [2022-12-13 07:07:20,644 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:07:20,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 120 [2022-12-13 07:07:21,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:07:21,256 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 07:07:21,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 1 [2022-12-13 07:07:21,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:07:21,263 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 07:07:21,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 1 [2022-12-13 07:07:21,265 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:07:21,266 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 07:07:21,304 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 07:07:21,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146037948] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:07:21,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:07:21,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 27 [2022-12-13 07:07:21,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992412323] [2022-12-13 07:07:21,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:07:21,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-13 07:07:21,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:21,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 07:07:21,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=643, Unknown=1, NotChecked=52, Total=812 [2022-12-13 07:07:21,306 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 07:07:21,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 536 transitions, 32316 flow. Second operand has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:21,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:21,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 07:07:21,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:23,027 INFO L130 PetriNetUnfolder]: 674/1207 cut-off events. [2022-12-13 07:07:23,028 INFO L131 PetriNetUnfolder]: For 103/103 co-relation queries the response was YES. [2022-12-13 07:07:23,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37528 conditions, 1207 events. 674/1207 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 6484 event pairs, 0 based on Foata normal form. 1/989 useless extension candidates. Maximal degree in co-relation 31398. Up to 1208 conditions per place. [2022-12-13 07:07:23,043 INFO L137 encePairwiseOnDemand]: 6/18 looper letters, 457 selfloop transitions, 102 changer transitions 4/563 dead transitions. [2022-12-13 07:07:23,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 563 transitions, 35074 flow [2022-12-13 07:07:23,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 07:07:23,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 07:07:23,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-12-13 07:07:23,044 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28205128205128205 [2022-12-13 07:07:23,045 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 243 predicate places. [2022-12-13 07:07:23,045 INFO L82 GeneralOperation]: Start removeDead. Operand has 266 places, 563 transitions, 35074 flow [2022-12-13 07:07:23,067 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 266 places, 559 transitions, 34820 flow [2022-12-13 07:07:23,077 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:23,077 INFO L89 Accepts]: Start accepts. Operand has 266 places, 559 transitions, 34820 flow [2022-12-13 07:07:23,085 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:23,085 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:23,085 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 266 places, 559 transitions, 34820 flow [2022-12-13 07:07:23,097 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 266 places, 559 transitions, 34820 flow [2022-12-13 07:07:23,097 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:23,099 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:23,100 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-13 07:07:23,100 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 559 transitions, 34820 flow [2022-12-13 07:07:23,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:23,100 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:23,100 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:23,111 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 07:07:23,307 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 07:07:23,307 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 07:07:23,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:23,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1051108873, now seen corresponding path program 12 times [2022-12-13 07:07:23,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:23,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948734126] [2022-12-13 07:07:23,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:23,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:24,134 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 07:07:24,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:24,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948734126] [2022-12-13 07:07:24,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948734126] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:07:24,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197428297] [2022-12-13 07:07:24,135 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:07:24,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:07:24,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:07:24,140 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 07:07:24,143 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 07:07:24,324 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 07:07:24,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:07:24,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-13 07:07:24,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:07:24,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:07:24,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 07:07:24,495 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:07:24,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-13 07:07:24,568 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 07:07:24,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:07:25,210 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (and (forall ((v_ArrVal_1876 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1876))) (let ((.cse2 (select .cse4 ~o_2~0.base))) (let ((.cse1 (select .cse2 c_~o_2~0.offset)) (.cse0 (select (select .cse4 c_~o_0~0.base) c_~o_0~0.offset))) (or (< .cse0 .cse1) (= (select .cse2 .cse3) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (< .cse1 .cse0)))))) (forall ((v_ArrVal_1876 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1876))) (let ((.cse7 (select .cse8 ~o_2~0.base))) (let ((.cse5 (select (select .cse8 c_~o_0~0.base) c_~o_0~0.offset)) (.cse6 (select .cse7 c_~o_2~0.offset))) (or (< .cse5 .cse6) (= .cse5 .cse6) (< (select .cse7 .cse3) |c_thread1Thread1of1ForFork0_#t~mem1#1|)))))) (forall ((v_ArrVal_1876 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1876))) (let ((.cse11 (select .cse12 ~o_2~0.base))) (let ((.cse10 (select .cse11 c_~o_2~0.offset)) (.cse9 (select (select .cse12 c_~o_0~0.base) c_~o_0~0.offset))) (or (= .cse9 .cse10) (< .cse10 .cse9) (< |c_thread1Thread1of1ForFork0_#t~mem1#1| (select .cse11 .cse3))))))) (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_1876 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1876))) (= (select (select .cse13 c_~o_0~0.base) c_~o_0~0.offset) (select (select .cse13 ~o_2~0.base) c_~o_2~0.offset))))))) is different from false [2022-12-13 07:07:25,274 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-13 07:07:25,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 177 [2022-12-13 07:07:25,301 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:07:25,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 120 [2022-12-13 07:07:25,680 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:07:25,686 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 07:07:25,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 1 [2022-12-13 07:07:25,688 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:07:25,695 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 07:07:25,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 1 [2022-12-13 07:07:25,697 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:07:25,698 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 07:07:25,740 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 07:07:25,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197428297] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:07:25,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:07:25,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 27 [2022-12-13 07:07:25,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596094900] [2022-12-13 07:07:25,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:07:25,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-13 07:07:25,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:25,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 07:07:25,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=650, Unknown=1, NotChecked=52, Total=812 [2022-12-13 07:07:25,741 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 07:07:25,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 559 transitions, 34820 flow. Second operand has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:25,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:25,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 07:07:25,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:29,987 INFO L130 PetriNetUnfolder]: 715/1291 cut-off events. [2022-12-13 07:07:29,987 INFO L131 PetriNetUnfolder]: For 103/103 co-relation queries the response was YES. [2022-12-13 07:07:29,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41428 conditions, 1291 events. 715/1291 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 7106 event pairs, 5 based on Foata normal form. 1/1051 useless extension candidates. Maximal degree in co-relation 34458. Up to 1292 conditions per place. [2022-12-13 07:07:30,000 INFO L137 encePairwiseOnDemand]: 6/18 looper letters, 493 selfloop transitions, 138 changer transitions 4/635 dead transitions. [2022-12-13 07:07:30,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 635 transitions, 40820 flow [2022-12-13 07:07:30,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 07:07:30,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 07:07:30,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 67 transitions. [2022-12-13 07:07:30,002 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2863247863247863 [2022-12-13 07:07:30,002 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 255 predicate places. [2022-12-13 07:07:30,002 INFO L82 GeneralOperation]: Start removeDead. Operand has 278 places, 635 transitions, 40820 flow [2022-12-13 07:07:30,023 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 278 places, 631 transitions, 40558 flow [2022-12-13 07:07:30,033 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:30,033 INFO L89 Accepts]: Start accepts. Operand has 278 places, 631 transitions, 40558 flow [2022-12-13 07:07:30,042 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:30,042 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:30,042 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 278 places, 631 transitions, 40558 flow [2022-12-13 07:07:30,055 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 278 places, 631 transitions, 40558 flow [2022-12-13 07:07:30,055 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:30,056 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:30,057 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 07:07:30,057 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 631 transitions, 40558 flow [2022-12-13 07:07:30,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:30,057 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:30,057 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:30,063 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 07:07:30,258 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 07:07:30,259 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 07:07:30,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:30,259 INFO L85 PathProgramCache]: Analyzing trace with hash 702518795, now seen corresponding path program 13 times [2022-12-13 07:07:30,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:30,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226351636] [2022-12-13 07:07:30,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:30,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:30,932 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 07:07:30,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:30,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226351636] [2022-12-13 07:07:30,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226351636] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:07:30,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037426009] [2022-12-13 07:07:30,933 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:07:30,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:07:30,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:07:30,936 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 07:07:30,944 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 07:07:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:31,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-13 07:07:31,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:07:31,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:07:31,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 07:07:31,327 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:07:31,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 24 [2022-12-13 07:07:31,422 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 07:07:31,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:07:32,069 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (and (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_1949 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1949))) (= (select (select .cse0 c_~o_0~0.base) c_~o_0~0.offset) (select (select .cse0 ~o_2~0.base) c_~o_2~0.offset))))) (forall ((v_ArrVal_1949 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1949))) (let ((.cse3 (select .cse5 ~o_2~0.base))) (let ((.cse2 (select (select .cse5 c_~o_0~0.base) c_~o_0~0.offset)) (.cse1 (select .cse3 c_~o_2~0.offset))) (or (< .cse1 .cse2) (< .cse2 .cse1) (= |c_thread1Thread1of1ForFork0_#t~mem1#1| (select .cse3 .cse4))))))) (forall ((v_ArrVal_1949 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1949))) (let ((.cse8 (select .cse9 ~o_2~0.base))) (let ((.cse6 (select (select .cse9 c_~o_0~0.base) c_~o_0~0.offset)) (.cse7 (select .cse8 c_~o_2~0.offset))) (or (= .cse6 .cse7) (< (select .cse8 .cse4) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (< .cse6 .cse7)))))) (forall ((v_ArrVal_1949 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1949))) (let ((.cse12 (select .cse13 ~o_2~0.base))) (let ((.cse11 (select .cse12 c_~o_2~0.offset)) (.cse10 (select (select .cse13 c_~o_0~0.base) c_~o_0~0.offset))) (or (= .cse10 .cse11) (< |c_thread1Thread1of1ForFork0_#t~mem1#1| (select .cse12 .cse4)) (< .cse11 .cse10)))))))) is different from false [2022-12-13 07:07:32,121 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:07:32,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 192 [2022-12-13 07:07:32,149 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:07:32,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 120 [2022-12-13 07:07:32,648 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:07:32,653 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 07:07:32,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 1 [2022-12-13 07:07:32,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:07:32,663 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 07:07:32,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 1 [2022-12-13 07:07:32,665 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:07:32,665 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 07:07:32,700 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 07:07:32,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037426009] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:07:32,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:07:32,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 26 [2022-12-13 07:07:32,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408656366] [2022-12-13 07:07:32,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:07:32,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 07:07:32,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:32,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 07:07:32,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=592, Unknown=1, NotChecked=50, Total=756 [2022-12-13 07:07:32,701 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 07:07:32,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 631 transitions, 40558 flow. Second operand has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:32,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:32,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 07:07:32,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:33,675 INFO L130 PetriNetUnfolder]: 711/1290 cut-off events. [2022-12-13 07:07:33,675 INFO L131 PetriNetUnfolder]: For 107/107 co-relation queries the response was YES. [2022-12-13 07:07:33,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42687 conditions, 1290 events. 711/1290 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 7103 event pairs, 5 based on Foata normal form. 1/1051 useless extension candidates. Maximal degree in co-relation 35501. Up to 1291 conditions per place. [2022-12-13 07:07:33,688 INFO L137 encePairwiseOnDemand]: 9/18 looper letters, 513 selfloop transitions, 116 changer transitions 5/634 dead transitions. [2022-12-13 07:07:33,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 634 transitions, 42024 flow [2022-12-13 07:07:33,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:07:33,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:07:33,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2022-12-13 07:07:33,690 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3181818181818182 [2022-12-13 07:07:33,690 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 265 predicate places. [2022-12-13 07:07:33,690 INFO L82 GeneralOperation]: Start removeDead. Operand has 288 places, 634 transitions, 42024 flow [2022-12-13 07:07:33,712 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 288 places, 629 transitions, 41688 flow [2022-12-13 07:07:33,724 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:33,724 INFO L89 Accepts]: Start accepts. Operand has 288 places, 629 transitions, 41688 flow [2022-12-13 07:07:33,734 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:33,734 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:33,734 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 288 places, 629 transitions, 41688 flow [2022-12-13 07:07:33,749 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 288 places, 629 transitions, 41688 flow [2022-12-13 07:07:33,749 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:33,750 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:33,751 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 07:07:33,751 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 629 transitions, 41688 flow [2022-12-13 07:07:33,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:33,752 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:33,752 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:33,759 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 07:07:33,952 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 07:07:33,952 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 07:07:33,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:33,953 INFO L85 PathProgramCache]: Analyzing trace with hash 456408625, now seen corresponding path program 14 times [2022-12-13 07:07:33,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:33,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389479513] [2022-12-13 07:07:33,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:33,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:34,640 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 07:07:34,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:34,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389479513] [2022-12-13 07:07:34,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389479513] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:07:34,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204163916] [2022-12-13 07:07:34,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:07:34,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:07:34,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:07:34,642 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 07:07:34,669 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 07:07:34,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:07:34,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:07:34,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-13 07:07:34,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:07:34,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:07:34,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 07:07:35,048 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:07:35,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-13 07:07:35,113 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 07:07:35,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:07:35,710 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (and (forall ((v_ArrVal_2022 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2022))) (let ((.cse0 (select .cse4 ~o_2~0.base))) (let ((.cse3 (select (select .cse4 c_~o_0~0.base) c_~o_0~0.offset)) (.cse2 (select .cse0 c_~o_2~0.offset))) (or (= (select .cse0 .cse1) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (< .cse2 .cse3) (< .cse3 .cse2)))))) (forall ((v_ArrVal_2022 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2022))) (let ((.cse7 (select .cse8 ~o_2~0.base))) (let ((.cse5 (select .cse7 c_~o_2~0.offset)) (.cse6 (select (select .cse8 c_~o_0~0.base) c_~o_0~0.offset))) (or (= .cse5 .cse6) (< .cse5 .cse6) (< |c_thread1Thread1of1ForFork0_#t~mem1#1| (select .cse7 .cse1))))))) (forall ((v_ArrVal_2022 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2022))) (let ((.cse9 (select .cse12 ~o_2~0.base))) (let ((.cse11 (select (select .cse12 c_~o_0~0.base) c_~o_0~0.offset)) (.cse10 (select .cse9 c_~o_2~0.offset))) (or (< (select .cse9 .cse1) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (= .cse10 .cse11) (< .cse11 .cse10)))))) (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_2022 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2022))) (= (select (select .cse13 ~o_2~0.base) c_~o_2~0.offset) (select (select .cse13 c_~o_0~0.base) c_~o_0~0.offset))))))) is different from false [2022-12-13 07:07:35,772 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-13 07:07:35,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 177 [2022-12-13 07:07:35,795 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:07:35,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 120 [2022-12-13 07:07:36,077 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:07:36,079 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 07:07:36,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:07:36,089 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 07:07:36,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 1 [2022-12-13 07:07:36,092 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:07:36,098 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-12-13 07:07:36,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 1 [2022-12-13 07:07:36,136 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 07:07:36,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204163916] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:07:36,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:07:36,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 27 [2022-12-13 07:07:36,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891019722] [2022-12-13 07:07:36,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:07:36,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-13 07:07:36,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:36,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 07:07:36,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=643, Unknown=1, NotChecked=52, Total=812 [2022-12-13 07:07:36,137 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 07:07:36,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 629 transitions, 41688 flow. Second operand has 29 states, 28 states have (on average 1.75) internal successors, (49), 28 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:36,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:36,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 07:07:36,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:39,627 INFO L130 PetriNetUnfolder]: 690/1265 cut-off events. [2022-12-13 07:07:39,627 INFO L131 PetriNetUnfolder]: For 103/103 co-relation queries the response was YES. [2022-12-13 07:07:39,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43126 conditions, 1265 events. 690/1265 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 7058 event pairs, 3 based on Foata normal form. 13/1049 useless extension candidates. Maximal degree in co-relation 36202. Up to 1266 conditions per place. [2022-12-13 07:07:39,640 INFO L137 encePairwiseOnDemand]: 5/18 looper letters, 473 selfloop transitions, 138 changer transitions 20/631 dead transitions. [2022-12-13 07:07:39,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 631 transitions, 43082 flow [2022-12-13 07:07:39,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 07:07:39,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 07:07:39,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 72 transitions. [2022-12-13 07:07:39,641 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2022-12-13 07:07:39,641 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 278 predicate places. [2022-12-13 07:07:39,641 INFO L82 GeneralOperation]: Start removeDead. Operand has 301 places, 631 transitions, 43082 flow [2022-12-13 07:07:39,665 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 301 places, 611 transitions, 41704 flow [2022-12-13 07:07:39,677 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:39,677 INFO L89 Accepts]: Start accepts. Operand has 301 places, 611 transitions, 41704 flow [2022-12-13 07:07:39,688 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:39,688 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:39,688 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 301 places, 611 transitions, 41704 flow [2022-12-13 07:07:39,701 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 301 places, 611 transitions, 41704 flow [2022-12-13 07:07:39,702 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:39,703 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:39,704 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 07:07:39,704 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 611 transitions, 41704 flow [2022-12-13 07:07:39,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.75) internal successors, (49), 28 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:39,704 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:39,704 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:39,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-13 07:07:39,911 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 07:07:39,911 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 07:07:39,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:39,912 INFO L85 PathProgramCache]: Analyzing trace with hash -461560794, now seen corresponding path program 15 times [2022-12-13 07:07:39,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:39,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639835504] [2022-12-13 07:07:39,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:39,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:40,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:07:40,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:40,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639835504] [2022-12-13 07:07:40,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639835504] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:07:40,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311797878] [2022-12-13 07:07:40,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:07:40,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:07:40,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:07:40,513 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 07:07:40,515 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 07:07:40,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:07:40,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:07:40,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 07:07:40,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:07:40,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:07:40,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:07:41,069 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 07:07:41,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-13 07:07:41,107 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-13 07:07:41,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-13 07:07:41,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:07:41,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311797878] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:07:41,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:07:41,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2022-12-13 07:07:41,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865426174] [2022-12-13 07:07:41,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:07:41,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 07:07:41,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:41,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 07:07:41,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-12-13 07:07:41,134 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 07:07:41,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 611 transitions, 41704 flow. Second operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:41,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:41,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 07:07:41,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:42,070 INFO L130 PetriNetUnfolder]: 724/1311 cut-off events. [2022-12-13 07:07:42,070 INFO L131 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2022-12-13 07:07:42,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46002 conditions, 1311 events. 724/1311 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 7244 event pairs, 2 based on Foata normal form. 4/1084 useless extension candidates. Maximal degree in co-relation 39195. Up to 1312 conditions per place. [2022-12-13 07:07:42,082 INFO L137 encePairwiseOnDemand]: 10/18 looper letters, 482 selfloop transitions, 177 changer transitions 15/674 dead transitions. [2022-12-13 07:07:42,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 674 transitions, 47348 flow [2022-12-13 07:07:42,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 07:07:42,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 07:07:42,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-12-13 07:07:42,083 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37222222222222223 [2022-12-13 07:07:42,083 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 287 predicate places. [2022-12-13 07:07:42,083 INFO L82 GeneralOperation]: Start removeDead. Operand has 310 places, 674 transitions, 47348 flow [2022-12-13 07:07:42,144 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 308 places, 659 transitions, 46286 flow [2022-12-13 07:07:42,155 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:42,155 INFO L89 Accepts]: Start accepts. Operand has 308 places, 659 transitions, 46286 flow [2022-12-13 07:07:42,166 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:42,166 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:42,166 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 308 places, 659 transitions, 46286 flow [2022-12-13 07:07:42,179 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 308 places, 659 transitions, 46286 flow [2022-12-13 07:07:42,180 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:42,180 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:42,181 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-13 07:07:42,181 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 659 transitions, 46286 flow [2022-12-13 07:07:42,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:42,181 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:42,181 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:42,187 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 07:07:42,382 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 07:07:42,382 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 07:07:42,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:42,383 INFO L85 PathProgramCache]: Analyzing trace with hash 520816870, now seen corresponding path program 16 times [2022-12-13 07:07:42,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:42,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219876494] [2022-12-13 07:07:42,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:42,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:43,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:07:43,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:43,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219876494] [2022-12-13 07:07:43,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219876494] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:07:43,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476659551] [2022-12-13 07:07:43,023 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:07:43,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:07:43,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:07:43,025 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 07:07:43,028 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 07:07:43,206 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:07:43,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:07:43,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 07:07:43,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:07:43,373 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 07:07:43,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 32 [2022-12-13 07:07:43,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:07:43,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:07:43,569 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 07:07:43,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-13 07:07:43,623 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-13 07:07:43,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-13 07:07:43,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:07:43,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476659551] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:07:43,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:07:43,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 20 [2022-12-13 07:07:43,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720144991] [2022-12-13 07:07:43,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:07:43,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 07:07:43,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:43,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 07:07:43,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-12-13 07:07:43,667 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 07:07:43,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 659 transitions, 46286 flow. Second operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:43,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:43,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 07:07:43,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:44,926 INFO L130 PetriNetUnfolder]: 794/1429 cut-off events. [2022-12-13 07:07:44,927 INFO L131 PetriNetUnfolder]: For 86/86 co-relation queries the response was YES. [2022-12-13 07:07:44,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51558 conditions, 1429 events. 794/1429 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 8011 event pairs, 0 based on Foata normal form. 4/1181 useless extension candidates. Maximal degree in co-relation 44848. Up to 1430 conditions per place. [2022-12-13 07:07:44,941 INFO L137 encePairwiseOnDemand]: 9/18 looper letters, 489 selfloop transitions, 284 changer transitions 13/786 dead transitions. [2022-12-13 07:07:44,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 786 transitions, 56754 flow [2022-12-13 07:07:44,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 07:07:44,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 07:07:44,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 83 transitions. [2022-12-13 07:07:44,942 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3547008547008547 [2022-12-13 07:07:44,943 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 297 predicate places. [2022-12-13 07:07:44,943 INFO L82 GeneralOperation]: Start removeDead. Operand has 320 places, 786 transitions, 56754 flow [2022-12-13 07:07:44,969 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 317 places, 773 transitions, 55812 flow [2022-12-13 07:07:44,982 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:44,982 INFO L89 Accepts]: Start accepts. Operand has 317 places, 773 transitions, 55812 flow [2022-12-13 07:07:44,995 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:44,995 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:44,995 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 317 places, 773 transitions, 55812 flow [2022-12-13 07:07:45,012 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 317 places, 773 transitions, 55812 flow [2022-12-13 07:07:45,012 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:45,013 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:45,014 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-13 07:07:45,014 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 773 transitions, 55812 flow [2022-12-13 07:07:45,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:45,014 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:45,014 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:45,020 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 07:07:45,215 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 07:07:45,215 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 07:07:45,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:45,216 INFO L85 PathProgramCache]: Analyzing trace with hash -595498306, now seen corresponding path program 17 times [2022-12-13 07:07:45,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:45,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649557728] [2022-12-13 07:07:45,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:45,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:45,881 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 07:07:45,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:45,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649557728] [2022-12-13 07:07:45,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649557728] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:07:45,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893134437] [2022-12-13 07:07:45,882 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:07:45,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:07:45,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:07:45,883 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 07:07:45,884 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 07:07:46,063 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 07:07:46,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:07:46,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-13 07:07:46,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:07:46,203 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:07:46,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-13 07:07:46,317 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 07:07:46,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:07:46,628 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 07:07:46,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-13 07:07:46,670 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-13 07:07:46,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-13 07:07:46,703 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 07:07:46,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893134437] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:07:46,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:07:46,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 23 [2022-12-13 07:07:46,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865953698] [2022-12-13 07:07:46,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:07:46,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 07:07:46,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:46,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 07:07:46,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2022-12-13 07:07:46,704 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 07:07:46,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 773 transitions, 55812 flow. Second operand has 23 states, 23 states have (on average 1.826086956521739) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:46,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:46,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 07:07:46,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:49,530 INFO L130 PetriNetUnfolder]: 840/1523 cut-off events. [2022-12-13 07:07:49,531 INFO L131 PetriNetUnfolder]: For 95/95 co-relation queries the response was YES. [2022-12-13 07:07:49,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56473 conditions, 1523 events. 840/1523 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 8611 event pairs, 1 based on Foata normal form. 7/1263 useless extension candidates. Maximal degree in co-relation 49090. Up to 1524 conditions per place. [2022-12-13 07:07:49,548 INFO L137 encePairwiseOnDemand]: 7/18 looper letters, 572 selfloop transitions, 290 changer transitions 13/875 dead transitions. [2022-12-13 07:07:49,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 875 transitions, 64939 flow [2022-12-13 07:07:49,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-13 07:07:49,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-13 07:07:49,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 168 transitions. [2022-12-13 07:07:49,552 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27450980392156865 [2022-12-13 07:07:49,552 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 327 predicate places. [2022-12-13 07:07:49,552 INFO L82 GeneralOperation]: Start removeDead. Operand has 350 places, 875 transitions, 64939 flow [2022-12-13 07:07:49,585 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 347 places, 862 transitions, 63968 flow [2022-12-13 07:07:49,600 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:49,600 INFO L89 Accepts]: Start accepts. Operand has 347 places, 862 transitions, 63968 flow [2022-12-13 07:07:49,614 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:49,614 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:49,614 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 347 places, 862 transitions, 63968 flow [2022-12-13 07:07:49,635 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 347 places, 862 transitions, 63968 flow [2022-12-13 07:07:49,635 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:49,636 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [713] L85-4-->L86-3: Formula: (and (= (+ |v_#pthreadsForks_18| 1) |v_#pthreadsForks_17|) (= |v_ULTIMATE.start_main_#t~pre15#1_21| |v_#pthreadsForks_18|) (= (store |v_#memory_int_54| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_54| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_21|)) |v_#memory_int_53|)) InVars {#pthreadsForks=|v_#pthreadsForks_18|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_54|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_11|, #pthreadsForks=|v_#pthreadsForks_17|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_53|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_21|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] and [887] L54-1-->L53-2: Formula: (and (<= v_~result_5~0_90 2147483647) (= v_~result_5~0_90 |v_thread1Thread1of1ForFork0_minus_#res#1_39|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_47|)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (= |v_thread1Thread1of1ForFork0_minus_#in~b#1_33| (select (select |v_#memory_int_145| v_~o_2~0.base_71) (+ (* |v_thread1Thread1of1ForFork0_~i~0#1_82| 4) v_~o_2~0.offset_71))) (= |v_thread1Thread1of1ForFork0_~i~0#1_81| (+ |v_thread1Thread1of1ForFork0_~i~0#1_82| 1)) (<= 0 (+ v_~result_5~0_90 2147483648)) (= (ite (= (ite (not (= v_~result_5~0_90 0)) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~stop~0#1_55|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_33| |v_thread1Thread1of1ForFork0_#t~mem1#1_42|) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| (+ |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#res#1_39|)) (= |v_thread1Thread1of1ForFork0_minus_~a#1_47| |v_thread1Thread1of1ForFork0_minus_#in~a#1_33|) (= |v_thread1Thread1of1ForFork0_minus_~b#1_47| |v_thread1Thread1of1ForFork0_minus_#in~b#1_33|)) InVars {~o_2~0.offset=v_~o_2~0.offset_71, ~o_2~0.base=v_~o_2~0.base_71, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_82|, #memory_int=|v_#memory_int_145|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_42|} OutVars{~o_2~0.offset=v_~o_2~0.offset_71, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_39|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_33|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_27|, thread1Thread1of1ForFork0_~stop~0#1=|v_thread1Thread1of1ForFork0_~stop~0#1_55|, thread1Thread1of1ForFork0_#t~ret3#1=|v_thread1Thread1of1ForFork0_#t~ret3#1_37|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_41|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_33|, ~o_2~0.base=v_~o_2~0.base_71, ~result_5~0=v_~result_5~0_90, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_47|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_47|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, #memory_int=|v_#memory_int_145|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_~stop~0#1, thread1Thread1of1ForFork0_#t~ret3#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_minus_#in~b#1, ~result_5~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 07:07:49,763 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:07:49,764 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-13 07:07:49,764 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 862 transitions, 63970 flow [2022-12-13 07:07:49,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.826086956521739) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:49,764 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:49,764 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:49,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-12-13 07:07:49,967 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 07:07:49,967 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 07:07:49,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:49,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1134352838, now seen corresponding path program 18 times [2022-12-13 07:07:49,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:49,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314013425] [2022-12-13 07:07:49,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:49,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:50,578 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 07:07:50,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:50,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314013425] [2022-12-13 07:07:50,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314013425] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:07:50,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785637461] [2022-12-13 07:07:50,578 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:07:50,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:07:50,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:07:50,580 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 07:07:50,607 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 07:07:50,915 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 07:07:50,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:07:50,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 07:07:50,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:07:51,043 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:07:51,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 51 [2022-12-13 07:07:51,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:07:51,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:07:51,379 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 07:07:51,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-13 07:07:51,429 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-13 07:07:51,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 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-13 07:07:51,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:07:51,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785637461] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:07:51,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:07:51,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2022-12-13 07:07:51,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560511776] [2022-12-13 07:07:51,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:07:51,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 07:07:51,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:51,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 07:07:51,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-12-13 07:07:51,462 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:07:51,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 862 transitions, 63970 flow. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 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 07:07:51,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:51,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:07:51,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:53,249 INFO L130 PetriNetUnfolder]: 890/1605 cut-off events. [2022-12-13 07:07:53,250 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2022-12-13 07:07:53,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61117 conditions, 1605 events. 890/1605 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 9132 event pairs, 2 based on Foata normal form. 0/1321 useless extension candidates. Maximal degree in co-relation 52963. Up to 1606 conditions per place. [2022-12-13 07:07:53,268 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 642 selfloop transitions, 279 changer transitions 0/921 dead transitions. [2022-12-13 07:07:53,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 921 transitions, 70190 flow [2022-12-13 07:07:53,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 07:07:53,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 07:07:53,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 96 transitions. [2022-12-13 07:07:53,270 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2807017543859649 [2022-12-13 07:07:53,270 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 341 predicate places. [2022-12-13 07:07:53,270 INFO L82 GeneralOperation]: Start removeDead. Operand has 364 places, 921 transitions, 70190 flow [2022-12-13 07:07:53,304 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 364 places, 921 transitions, 70190 flow [2022-12-13 07:07:53,322 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:53,322 INFO L89 Accepts]: Start accepts. Operand has 364 places, 921 transitions, 70190 flow [2022-12-13 07:07:53,342 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:53,342 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:53,343 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 364 places, 921 transitions, 70190 flow [2022-12-13 07:07:53,363 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 364 places, 921 transitions, 70190 flow [2022-12-13 07:07:53,364 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:53,365 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:53,365 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 07:07:53,366 INFO L495 AbstractCegarLoop]: Abstraction has has 364 places, 921 transitions, 70190 flow [2022-12-13 07:07:53,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 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 07:07:53,366 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:53,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 07:07:53,375 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 07:07:53,572 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 07:07:53,573 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 07:07:53,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:53,573 INFO L85 PathProgramCache]: Analyzing trace with hash 802967422, now seen corresponding path program 1 times [2022-12-13 07:07:53,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:53,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211996201] [2022-12-13 07:07:53,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:53,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:54,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:07:54,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:54,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211996201] [2022-12-13 07:07:54,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211996201] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:07:54,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356131888] [2022-12-13 07:07:54,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:54,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:07:54,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:07:54,248 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 07:07:54,250 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 07:07:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:54,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 07:07:54,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:07:54,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:07:54,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-13 07:07:54,635 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 07:07:54,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 32 [2022-12-13 07:07:54,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:07:54,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:07:54,763 WARN L837 $PredicateComparison]: unable to prove that (and (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_2383 (Array Int Int)) (~o_2~0.base Int)) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2383))) (= (select (select .cse0 ~o_2~0.base) c_~o_2~0.offset) (select (select .cse0 c_~o_0~0.base) c_~o_0~0.offset)))))) (forall ((v_ArrVal_2383 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2383))) (let ((.cse1 (select .cse2 ~o_2~0.base))) (or (= (select .cse1 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (not (= (select .cse1 c_~o_2~0.offset) (select (select .cse2 c_~o_0~0.base) c_~o_0~0.offset)))))))) is different from false [2022-12-13 07:07:54,771 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:07:54,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 66 [2022-12-13 07:07:54,778 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:07:54,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2022-12-13 07:07:54,817 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:07:54,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 148 [2022-12-13 07:07:54,836 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:07:54,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 84 [2022-12-13 07:07:55,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:07:55,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356131888] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:07:55,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:07:55,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 22 [2022-12-13 07:07:55,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860421539] [2022-12-13 07:07:55,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:07:55,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 07:07:55,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:55,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 07:07:55,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=385, Unknown=1, NotChecked=40, Total=506 [2022-12-13 07:07:55,192 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:07:55,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 921 transitions, 70190 flow. Second operand has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:55,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:55,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:07:55,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:57,084 INFO L130 PetriNetUnfolder]: 1140/2051 cut-off events. [2022-12-13 07:07:57,084 INFO L131 PetriNetUnfolder]: For 146/146 co-relation queries the response was YES. [2022-12-13 07:07:57,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80145 conditions, 2051 events. 1140/2051 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 12291 event pairs, 1 based on Foata normal form. 0/1684 useless extension candidates. Maximal degree in co-relation 69422. Up to 2052 conditions per place. [2022-12-13 07:07:57,109 INFO L137 encePairwiseOnDemand]: 7/19 looper letters, 828 selfloop transitions, 311 changer transitions 17/1156 dead transitions. [2022-12-13 07:07:57,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 1156 transitions, 90419 flow [2022-12-13 07:07:57,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 07:07:57,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 07:07:57,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 90 transitions. [2022-12-13 07:07:57,110 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39473684210526316 [2022-12-13 07:07:57,111 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 352 predicate places. [2022-12-13 07:07:57,111 INFO L82 GeneralOperation]: Start removeDead. Operand has 375 places, 1156 transitions, 90419 flow [2022-12-13 07:07:57,154 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 373 places, 1139 transitions, 89081 flow [2022-12-13 07:07:57,174 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:57,174 INFO L89 Accepts]: Start accepts. Operand has 373 places, 1139 transitions, 89081 flow [2022-12-13 07:07:57,196 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:57,196 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:57,196 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 373 places, 1139 transitions, 89081 flow [2022-12-13 07:07:57,224 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 373 places, 1139 transitions, 89081 flow [2022-12-13 07:07:57,224 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:57,226 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:57,227 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-13 07:07:57,227 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 1139 transitions, 89081 flow [2022-12-13 07:07:57,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:57,227 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:57,227 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:57,233 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 07:07:57,428 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 07:07:57,429 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 07:07:57,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:57,429 INFO L85 PathProgramCache]: Analyzing trace with hash -121396792, now seen corresponding path program 2 times [2022-12-13 07:07:57,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:57,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392667397] [2022-12-13 07:07:57,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:57,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:07:58,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:58,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392667397] [2022-12-13 07:07:58,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392667397] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:07:58,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095033811] [2022-12-13 07:07:58,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:07:58,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:07:58,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:07:58,189 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 07:07:58,191 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 07:07:58,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:07:58,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:07:58,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 07:07:58,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:07:58,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:07:58,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-13 07:07:58,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:07:58,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:07:58,809 WARN L837 $PredicateComparison]: unable to prove that (and (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_2456 (Array Int Int)) (~o_2~0.base Int)) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2456))) (= (select (select .cse0 ~o_2~0.base) c_~o_2~0.offset) (select (select .cse0 c_~o_0~0.base) c_~o_0~0.offset)))))) (forall ((v_ArrVal_2456 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2456))) (let ((.cse1 (select .cse2 ~o_2~0.base))) (or (= (select .cse1 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (not (= (select .cse1 c_~o_2~0.offset) (select (select .cse2 c_~o_0~0.base) c_~o_0~0.offset)))))))) is different from false [2022-12-13 07:07:58,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:07:58,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 148 [2022-12-13 07:07:58,877 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:07:58,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 84 [2022-12-13 07:07:59,272 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:07:59,274 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 07:07:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:07:59,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095033811] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:07:59,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:07:59,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 25 [2022-12-13 07:07:59,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229281263] [2022-12-13 07:07:59,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:07:59,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 07:07:59,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:59,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 07:07:59,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=506, Unknown=1, NotChecked=46, Total=650 [2022-12-13 07:07:59,311 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:07:59,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 1139 transitions, 89081 flow. Second operand has 26 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:59,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:59,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:07:59,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:01,943 INFO L130 PetriNetUnfolder]: 1129/2023 cut-off events. [2022-12-13 07:08:01,943 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2022-12-13 07:08:01,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81073 conditions, 2023 events. 1129/2023 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 12051 event pairs, 1 based on Foata normal form. 4/1667 useless extension candidates. Maximal degree in co-relation 70559. Up to 2024 conditions per place. [2022-12-13 07:08:01,972 INFO L137 encePairwiseOnDemand]: 7/19 looper letters, 723 selfloop transitions, 411 changer transitions 8/1142 dead transitions. [2022-12-13 07:08:01,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 1142 transitions, 91602 flow [2022-12-13 07:08:01,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 07:08:01,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 07:08:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 93 transitions. [2022-12-13 07:08:01,973 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34962406015037595 [2022-12-13 07:08:01,973 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 363 predicate places. [2022-12-13 07:08:01,973 INFO L82 GeneralOperation]: Start removeDead. Operand has 386 places, 1142 transitions, 91602 flow [2022-12-13 07:08:02,031 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 384 places, 1134 transitions, 90956 flow [2022-12-13 07:08:02,052 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:08:02,052 INFO L89 Accepts]: Start accepts. Operand has 384 places, 1134 transitions, 90956 flow [2022-12-13 07:08:02,078 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:08:02,079 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:02,079 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 384 places, 1134 transitions, 90956 flow [2022-12-13 07:08:02,110 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 384 places, 1134 transitions, 90956 flow [2022-12-13 07:08:02,110 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:02,113 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:02,113 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-13 07:08:02,113 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 1134 transitions, 90956 flow [2022-12-13 07:08:02,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:02,113 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:08:02,113 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:08:02,120 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 07:08:02,319 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 07:08:02,320 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 07:08:02,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:02,320 INFO L85 PathProgramCache]: Analyzing trace with hash 366115456, now seen corresponding path program 3 times [2022-12-13 07:08:02,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:02,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653167201] [2022-12-13 07:08:02,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:02,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:03,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:08:03,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:03,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653167201] [2022-12-13 07:08:03,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653167201] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:08:03,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848024209] [2022-12-13 07:08:03,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:08:03,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:08:03,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:08:03,096 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 07:08:03,098 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 07:08:03,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:08:03,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:08:03,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 07:08:03,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:08:03,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:08:03,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-13 07:08:03,525 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:08:03,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-13 07:08:03,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:08:03,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:08:03,743 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2529 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2529))) (let ((.cse0 (select .cse1 ~o_2~0.base))) (or (= |c_thread1Thread1of1ForFork0_#t~mem1#1| (select .cse0 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (not (= (select (select .cse1 c_~o_0~0.base) c_~o_0~0.offset) (select .cse0 c_~o_2~0.offset))))))) (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_2529 (Array Int Int)) (~o_2~0.base Int)) (not (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2529))) (= (select (select .cse2 c_~o_0~0.base) c_~o_0~0.offset) (select (select .cse2 ~o_2~0.base) c_~o_2~0.offset))))))) is different from false [2022-12-13 07:08:03,752 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:08:03,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 66 [2022-12-13 07:08:03,759 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:08:03,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2022-12-13 07:08:03,798 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:08:03,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 148 [2022-12-13 07:08:03,820 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:08:03,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 84 [2022-12-13 07:08:04,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:08:04,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848024209] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:08:04,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:08:04,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 24 [2022-12-13 07:08:04,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503574396] [2022-12-13 07:08:04,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:08:04,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 07:08:04,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:08:04,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 07:08:04,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=464, Unknown=1, NotChecked=44, Total=600 [2022-12-13 07:08:04,157 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:08:04,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 1134 transitions, 90956 flow. Second operand has 25 states, 25 states have (on average 1.8) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:04,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:08:04,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:08:04,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:07,824 INFO L130 PetriNetUnfolder]: 1537/2784 cut-off events. [2022-12-13 07:08:07,824 INFO L131 PetriNetUnfolder]: For 199/199 co-relation queries the response was YES. [2022-12-13 07:08:07,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114339 conditions, 2784 events. 1537/2784 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 17964 event pairs, 1 based on Foata normal form. 4/2281 useless extension candidates. Maximal degree in co-relation 97701. Up to 2785 conditions per place. [2022-12-13 07:08:07,861 INFO L137 encePairwiseOnDemand]: 7/19 looper letters, 1056 selfloop transitions, 507 changer transitions 5/1568 dead transitions. [2022-12-13 07:08:07,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 1568 transitions, 128923 flow [2022-12-13 07:08:07,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-13 07:08:07,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-13 07:08:07,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 159 transitions. [2022-12-13 07:08:07,862 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2789473684210526 [2022-12-13 07:08:07,862 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 390 predicate places. [2022-12-13 07:08:07,862 INFO L82 GeneralOperation]: Start removeDead. Operand has 413 places, 1568 transitions, 128923 flow [2022-12-13 07:08:08,002 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 412 places, 1563 transitions, 128510 flow [2022-12-13 07:08:08,029 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:08:08,030 INFO L89 Accepts]: Start accepts. Operand has 412 places, 1563 transitions, 128510 flow [2022-12-13 07:08:08,067 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:08:08,067 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:08,067 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 412 places, 1563 transitions, 128510 flow [2022-12-13 07:08:08,110 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 412 places, 1563 transitions, 128510 flow [2022-12-13 07:08:08,110 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:08,112 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:08,113 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-13 07:08:08,113 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 1563 transitions, 128510 flow [2022-12-13 07:08:08,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:08,113 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:08:08,113 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:08:08,119 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 07:08:08,313 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 07:08:08,314 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 07:08:08,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:08,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1237711968, now seen corresponding path program 4 times [2022-12-13 07:08:08,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:08,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985963900] [2022-12-13 07:08:08,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:08,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:08,969 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 07:08:08,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:08,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985963900] [2022-12-13 07:08:08,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985963900] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:08:08,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117859868] [2022-12-13 07:08:08,970 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:08:08,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:08:08,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:08:08,971 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 07:08:08,973 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 07:08:09,153 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:08:09,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:08:09,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 07:08:09,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:08:09,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:08:09,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-13 07:08:09,341 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:08:09,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 35 [2022-12-13 07:08:09,419 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 07:08:09,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:08:09,603 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2602 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2602))) (let ((.cse0 (select .cse1 ~o_2~0.base))) (or (= (select .cse0 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (not (= (select .cse0 c_~o_2~0.offset) (select (select .cse1 c_~o_0~0.base) c_~o_0~0.offset))))))) (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_2602 (Array Int Int)) (~o_2~0.base Int)) (not (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2602))) (= (select (select .cse2 ~o_2~0.base) c_~o_2~0.offset) (select (select .cse2 c_~o_0~0.base) c_~o_0~0.offset))))))) is different from false [2022-12-13 07:08:09,643 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:08:09,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 148 [2022-12-13 07:08:09,668 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:08:09,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 84 [2022-12-13 07:08:10,246 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 07:08:10,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:08:10,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117859868] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:08:10,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:08:10,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 21 [2022-12-13 07:08:10,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709016741] [2022-12-13 07:08:10,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:08:10,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 07:08:10,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:08:10,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 07:08:10,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=343, Unknown=1, NotChecked=38, Total=462 [2022-12-13 07:08:10,277 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:08:10,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 1563 transitions, 128510 flow. Second operand has 22 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 21 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 07:08:10,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:08:10,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:08:10,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:13,297 INFO L130 PetriNetUnfolder]: 1625/2934 cut-off events. [2022-12-13 07:08:13,297 INFO L131 PetriNetUnfolder]: For 222/222 co-relation queries the response was YES. [2022-12-13 07:08:13,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123429 conditions, 2934 events. 1625/2934 cut-off events. For 222/222 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 19026 event pairs, 0 based on Foata normal form. 0/2397 useless extension candidates. Maximal degree in co-relation 105375. Up to 2935 conditions per place. [2022-12-13 07:08:13,332 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 1155 selfloop transitions, 474 changer transitions 0/1629 dead transitions. [2022-12-13 07:08:13,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 1629 transitions, 137195 flow [2022-12-13 07:08:13,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 07:08:13,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 07:08:13,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 90 transitions. [2022-12-13 07:08:13,333 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3643724696356275 [2022-12-13 07:08:13,333 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 399 predicate places. [2022-12-13 07:08:13,334 INFO L82 GeneralOperation]: Start removeDead. Operand has 422 places, 1629 transitions, 137195 flow [2022-12-13 07:08:13,398 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 422 places, 1629 transitions, 137195 flow [2022-12-13 07:08:13,428 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:08:13,428 INFO L89 Accepts]: Start accepts. Operand has 422 places, 1629 transitions, 137195 flow [2022-12-13 07:08:13,455 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:08:13,455 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:13,455 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 422 places, 1629 transitions, 137195 flow [2022-12-13 07:08:13,497 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 422 places, 1629 transitions, 137195 flow [2022-12-13 07:08:13,498 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:13,500 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:13,500 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-13 07:08:13,501 INFO L495 AbstractCegarLoop]: Abstraction has has 422 places, 1629 transitions, 137195 flow [2022-12-13 07:08:13,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 21 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 07:08:13,501 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:08:13,501 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:08:13,507 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 07:08:13,701 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 07:08:13,701 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 07:08:13,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:13,702 INFO L85 PathProgramCache]: Analyzing trace with hash -554894286, now seen corresponding path program 19 times [2022-12-13 07:08:13,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:13,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366669007] [2022-12-13 07:08:13,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:13,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:08:14,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:14,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366669007] [2022-12-13 07:08:14,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366669007] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:08:14,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515991104] [2022-12-13 07:08:14,469 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:08:14,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:08:14,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:08:14,470 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 07:08:14,472 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 07:08:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:14,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 07:08:14,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:08:14,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:08:14,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:08:14,928 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 07:08:14,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-13 07:08:14,966 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-13 07:08:14,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-13 07:08:14,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:08:14,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515991104] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:08:14,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:08:14,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2022-12-13 07:08:14,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11126782] [2022-12-13 07:08:14,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:08:14,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 07:08:14,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:08:14,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 07:08:14,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-12-13 07:08:14,993 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:08:14,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 1629 transitions, 137195 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 07:08:14,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:08:14,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:08:14,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:17,699 INFO L130 PetriNetUnfolder]: 1611/2920 cut-off events. [2022-12-13 07:08:17,699 INFO L131 PetriNetUnfolder]: For 216/216 co-relation queries the response was YES. [2022-12-13 07:08:17,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125762 conditions, 2920 events. 1611/2920 cut-off events. For 216/216 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 19023 event pairs, 2 based on Foata normal form. 14/2397 useless extension candidates. Maximal degree in co-relation 107625. Up to 2921 conditions per place. [2022-12-13 07:08:17,734 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 1149 selfloop transitions, 448 changer transitions 28/1625 dead transitions. [2022-12-13 07:08:17,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 1625 transitions, 140109 flow [2022-12-13 07:08:17,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:08:17,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:08:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2022-12-13 07:08:17,735 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2966507177033493 [2022-12-13 07:08:17,735 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 409 predicate places. [2022-12-13 07:08:17,735 INFO L82 GeneralOperation]: Start removeDead. Operand has 432 places, 1625 transitions, 140109 flow [2022-12-13 07:08:17,798 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 430 places, 1597 transitions, 137677 flow [2022-12-13 07:08:17,829 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:08:17,829 INFO L89 Accepts]: Start accepts. Operand has 430 places, 1597 transitions, 137677 flow [2022-12-13 07:08:17,863 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:08:17,863 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:17,863 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 430 places, 1597 transitions, 137677 flow [2022-12-13 07:08:17,904 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 430 places, 1597 transitions, 137677 flow [2022-12-13 07:08:17,904 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:17,907 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:17,907 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-13 07:08:17,907 INFO L495 AbstractCegarLoop]: Abstraction has has 430 places, 1597 transitions, 137677 flow [2022-12-13 07:08:17,907 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 07:08:17,907 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:08:17,907 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:08:17,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-12-13 07:08:18,110 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 07:08:18,110 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 07:08:18,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:18,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1671209462, now seen corresponding path program 20 times [2022-12-13 07:08:18,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:18,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166257948] [2022-12-13 07:08:18,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:18,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:18,756 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 07:08:18,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:18,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166257948] [2022-12-13 07:08:18,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166257948] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:08:18,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677251671] [2022-12-13 07:08:18,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:08:18,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:08:18,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:08:18,758 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 07:08:18,759 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 07:08:19,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:08:19,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:08:19,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 07:08:19,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:08:19,116 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:08:19,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-13 07:08:19,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:08:19,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:08:19,329 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 07:08:19,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-13 07:08:19,367 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-13 07:08:19,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-13 07:08:19,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:08:19,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677251671] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:08:19,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:08:19,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-12-13 07:08:19,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759652572] [2022-12-13 07:08:19,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:08:19,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 07:08:19,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:08:19,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 07:08:19,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-12-13 07:08:19,395 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:08:19,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 1597 transitions, 137677 flow. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:19,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:08:19,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:08:19,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:22,322 INFO L130 PetriNetUnfolder]: 1619/2922 cut-off events. [2022-12-13 07:08:22,322 INFO L131 PetriNetUnfolder]: For 209/209 co-relation queries the response was YES. [2022-12-13 07:08:22,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128766 conditions, 2922 events. 1619/2922 cut-off events. For 209/209 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 18938 event pairs, 0 based on Foata normal form. 0/2385 useless extension candidates. Maximal degree in co-relation 110831. Up to 2923 conditions per place. [2022-12-13 07:08:22,362 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 1140 selfloop transitions, 475 changer transitions 0/1615 dead transitions. [2022-12-13 07:08:22,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 1615 transitions, 142461 flow [2022-12-13 07:08:22,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 07:08:22,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 07:08:22,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 75 transitions. [2022-12-13 07:08:22,363 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30364372469635625 [2022-12-13 07:08:22,363 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 419 predicate places. [2022-12-13 07:08:22,363 INFO L82 GeneralOperation]: Start removeDead. Operand has 442 places, 1615 transitions, 142461 flow [2022-12-13 07:08:22,431 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 442 places, 1615 transitions, 142461 flow [2022-12-13 07:08:22,463 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:08:22,464 INFO L89 Accepts]: Start accepts. Operand has 442 places, 1615 transitions, 142461 flow [2022-12-13 07:08:22,495 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:08:22,496 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:22,496 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 442 places, 1615 transitions, 142461 flow [2022-12-13 07:08:22,538 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 442 places, 1615 transitions, 142461 flow [2022-12-13 07:08:22,538 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:22,541 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:22,542 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-13 07:08:22,542 INFO L495 AbstractCegarLoop]: Abstraction has has 442 places, 1615 transitions, 142461 flow [2022-12-13 07:08:22,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:22,542 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:08:22,542 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:08:22,547 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 07:08:22,742 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 07:08:22,742 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 07:08:22,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:22,743 INFO L85 PathProgramCache]: Analyzing trace with hash -67382038, now seen corresponding path program 21 times [2022-12-13 07:08:22,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:22,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381761777] [2022-12-13 07:08:22,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:22,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:08:23,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:23,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381761777] [2022-12-13 07:08:23,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381761777] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:08:23,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444750061] [2022-12-13 07:08:23,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:08:23,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:08:23,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:08:23,405 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 07:08:23,406 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 07:08:23,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:08:23,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:08:23,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 07:08:23,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:08:23,764 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:08:23,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 41 [2022-12-13 07:08:23,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:08:23,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:08:23,967 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 07:08:23,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-13 07:08:24,006 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-13 07:08:24,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-13 07:08:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:08:24,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444750061] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:08:24,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:08:24,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2022-12-13 07:08:24,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787408464] [2022-12-13 07:08:24,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:08:24,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 07:08:24,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:08:24,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 07:08:24,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-12-13 07:08:24,048 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:08:24,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 1615 transitions, 142461 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 07:08:24,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:08:24,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:08:24,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:27,321 INFO L130 PetriNetUnfolder]: 1653/2976 cut-off events. [2022-12-13 07:08:27,322 INFO L131 PetriNetUnfolder]: For 185/185 co-relation queries the response was YES. [2022-12-13 07:08:27,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134113 conditions, 2976 events. 1653/2976 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 19354 event pairs, 1 based on Foata normal form. 14/2441 useless extension candidates. Maximal degree in co-relation 117039. Up to 2977 conditions per place. [2022-12-13 07:08:27,360 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 1190 selfloop transitions, 437 changer transitions 14/1641 dead transitions. [2022-12-13 07:08:27,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 1641 transitions, 148019 flow [2022-12-13 07:08:27,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 07:08:27,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 07:08:27,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 76 transitions. [2022-12-13 07:08:27,361 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-13 07:08:27,362 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 434 predicate places. [2022-12-13 07:08:27,362 INFO L82 GeneralOperation]: Start removeDead. Operand has 457 places, 1641 transitions, 148019 flow [2022-12-13 07:08:27,431 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 456 places, 1627 transitions, 146747 flow [2022-12-13 07:08:27,463 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:08:27,463 INFO L89 Accepts]: Start accepts. Operand has 456 places, 1627 transitions, 146747 flow [2022-12-13 07:08:27,494 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:08:27,494 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:27,494 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 456 places, 1627 transitions, 146747 flow [2022-12-13 07:08:27,539 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 456 places, 1627 transitions, 146747 flow [2022-12-13 07:08:27,539 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:27,542 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:27,542 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-13 07:08:27,542 INFO L495 AbstractCegarLoop]: Abstraction has has 456 places, 1627 transitions, 146747 flow [2022-12-13 07:08:27,542 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 07:08:27,542 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:08:27,542 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:08:27,548 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 07:08:27,743 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 07:08:27,743 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 07:08:27,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:27,743 INFO L85 PathProgramCache]: Analyzing trace with hash -576260470, now seen corresponding path program 22 times [2022-12-13 07:08:27,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:27,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365276622] [2022-12-13 07:08:27,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:27,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:28,210 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 07:08:28,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:28,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365276622] [2022-12-13 07:08:28,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365276622] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:08:28,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172125110] [2022-12-13 07:08:28,210 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:08:28,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:08:28,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:08:28,212 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 07:08:28,214 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 07:08:28,510 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:08:28,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:08:28,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 07:08:28,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:08:28,630 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 07:08:28,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:08:28,780 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 07:08:28,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-13 07:08:28,818 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-13 07:08:28,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-13 07:08:28,849 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 07:08:28,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172125110] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:08:28,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:08:28,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 17 [2022-12-13 07:08:28,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743159849] [2022-12-13 07:08:28,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:08:28,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 07:08:28,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:08:28,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 07:08:28,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-12-13 07:08:28,850 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:08:28,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 1627 transitions, 146747 flow. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:28,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:08:28,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:08:28,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:31,701 INFO L130 PetriNetUnfolder]: 1641/2930 cut-off events. [2022-12-13 07:08:31,701 INFO L131 PetriNetUnfolder]: For 173/173 co-relation queries the response was YES. [2022-12-13 07:08:31,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134961 conditions, 2930 events. 1641/2930 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 18796 event pairs, 3 based on Foata normal form. 0/2402 useless extension candidates. Maximal degree in co-relation 119271. Up to 2931 conditions per place. [2022-12-13 07:08:31,740 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 1143 selfloop transitions, 472 changer transitions 0/1615 dead transitions. [2022-12-13 07:08:31,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 1615 transitions, 148879 flow [2022-12-13 07:08:31,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:08:31,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:08:31,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 61 transitions. [2022-12-13 07:08:31,741 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.291866028708134 [2022-12-13 07:08:31,741 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 442 predicate places. [2022-12-13 07:08:31,741 INFO L82 GeneralOperation]: Start removeDead. Operand has 465 places, 1615 transitions, 148879 flow [2022-12-13 07:08:31,942 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 465 places, 1615 transitions, 148879 flow [2022-12-13 07:08:31,987 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:08:31,988 INFO L89 Accepts]: Start accepts. Operand has 465 places, 1615 transitions, 148879 flow [2022-12-13 07:08:32,022 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:08:32,022 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:32,022 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 465 places, 1615 transitions, 148879 flow [2022-12-13 07:08:32,072 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 465 places, 1615 transitions, 148879 flow [2022-12-13 07:08:32,072 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:32,074 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:32,075 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-13 07:08:32,075 INFO L495 AbstractCegarLoop]: Abstraction has has 465 places, 1615 transitions, 148879 flow [2022-12-13 07:08:32,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:32,075 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:08:32,075 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:08:32,081 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 07:08:32,276 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 07:08:32,276 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 07:08:32,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:32,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1693272622, now seen corresponding path program 23 times [2022-12-13 07:08:32,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:32,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713106874] [2022-12-13 07:08:32,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:32,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:32,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:08:32,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:32,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713106874] [2022-12-13 07:08:32,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713106874] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:08:32,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777074122] [2022-12-13 07:08:32,779 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:08:32,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:08:32,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:08:32,780 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 07:08:32,782 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 07:08:32,984 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:08:32,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:08:32,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 07:08:32,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:08:33,091 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 07:08:33,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-12-13 07:08:33,098 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 07:08:33,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2022-12-13 07:08:33,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:08:33,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:08:33,396 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 07:08:33,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 4 [2022-12-13 07:08:33,444 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-13 07:08:33,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-13 07:08:33,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:08:33,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777074122] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:08:33,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:08:33,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2022-12-13 07:08:33,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094525539] [2022-12-13 07:08:33,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:08:33,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 07:08:33,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:08:33,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 07:08:33,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-12-13 07:08:33,482 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:08:33,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 465 places, 1615 transitions, 148879 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 07:08:33,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:08:33,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:08:33,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:36,656 INFO L130 PetriNetUnfolder]: 1624/2897 cut-off events. [2022-12-13 07:08:36,656 INFO L131 PetriNetUnfolder]: For 162/162 co-relation queries the response was YES. [2022-12-13 07:08:36,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136335 conditions, 2897 events. 1624/2897 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 18542 event pairs, 1 based on Foata normal form. 9/2384 useless extension candidates. Maximal degree in co-relation 121534. Up to 2898 conditions per place. [2022-12-13 07:08:36,740 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 1165 selfloop transitions, 426 changer transitions 9/1600 dead transitions. [2022-12-13 07:08:36,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 1600 transitions, 150687 flow [2022-12-13 07:08:36,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 07:08:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 07:08:36,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2022-12-13 07:08:36,742 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2593984962406015 [2022-12-13 07:08:36,742 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 454 predicate places. [2022-12-13 07:08:36,742 INFO L82 GeneralOperation]: Start removeDead. Operand has 477 places, 1600 transitions, 150687 flow [2022-12-13 07:08:36,814 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 473 places, 1591 transitions, 149832 flow [2022-12-13 07:08:36,845 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:08:36,846 INFO L89 Accepts]: Start accepts. Operand has 473 places, 1591 transitions, 149832 flow [2022-12-13 07:08:36,880 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:08:36,880 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:36,880 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 473 places, 1591 transitions, 149832 flow [2022-12-13 07:08:36,930 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 473 places, 1591 transitions, 149832 flow [2022-12-13 07:08:36,930 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:36,932 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:36,933 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-13 07:08:36,933 INFO L495 AbstractCegarLoop]: Abstraction has has 473 places, 1591 transitions, 149832 flow [2022-12-13 07:08:36,933 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 07:08:36,933 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:08:36,933 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:08:36,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-12-13 07:08:37,133 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 07:08:37,134 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:08:37,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:37,134 INFO L85 PathProgramCache]: Analyzing trace with hash -108550978, now seen corresponding path program 24 times [2022-12-13 07:08:37,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:37,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444334134] [2022-12-13 07:08:37,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:37,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:37,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:08:37,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:37,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444334134] [2022-12-13 07:08:37,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444334134] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:08:37,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290129067] [2022-12-13 07:08:37,681 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:08:37,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:08:37,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:08:37,683 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:08:37,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-12-13 07:08:37,901 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 07:08:37,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:08:37,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 07:08:37,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:08:38,025 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 07:08:38,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-12-13 07:08:38,033 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 07:08:38,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2022-12-13 07:08:38,083 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 07:08:38,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:08:38,254 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-13 07:08:38,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 107 [2022-12-13 07:08:38,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:08:38,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290129067] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:08:38,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:08:38,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2022-12-13 07:08:38,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911952405] [2022-12-13 07:08:38,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:08:38,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 07:08:38,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:08:38,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 07:08:38,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-12-13 07:08:38,373 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:08:38,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 1591 transitions, 149832 flow. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:38,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:08:38,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:08:38,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:42,011 INFO L130 PetriNetUnfolder]: 1712/3053 cut-off events. [2022-12-13 07:08:42,011 INFO L131 PetriNetUnfolder]: For 176/176 co-relation queries the response was YES. [2022-12-13 07:08:42,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146730 conditions, 3053 events. 1712/3053 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 19683 event pairs, 10 based on Foata normal form. 0/2491 useless extension candidates. Maximal degree in co-relation 129975. Up to 3054 conditions per place. [2022-12-13 07:08:42,052 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 1146 selfloop transitions, 515 changer transitions 0/1661 dead transitions. [2022-12-13 07:08:42,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 1661 transitions, 159758 flow [2022-12-13 07:08:42,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 07:08:42,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 07:08:42,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 107 transitions. [2022-12-13 07:08:42,053 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2681704260651629 [2022-12-13 07:08:42,053 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 470 predicate places. [2022-12-13 07:08:42,053 INFO L82 GeneralOperation]: Start removeDead. Operand has 493 places, 1661 transitions, 159758 flow [2022-12-13 07:08:42,129 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 493 places, 1661 transitions, 159758 flow [2022-12-13 07:08:42,164 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:08:42,165 INFO L89 Accepts]: Start accepts. Operand has 493 places, 1661 transitions, 159758 flow [2022-12-13 07:08:42,203 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:08:42,203 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:42,204 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 493 places, 1661 transitions, 159758 flow [2022-12-13 07:08:42,251 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 493 places, 1661 transitions, 159758 flow [2022-12-13 07:08:42,251 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:42,254 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:42,254 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-13 07:08:42,254 INFO L495 AbstractCegarLoop]: Abstraction has has 493 places, 1661 transitions, 159758 flow [2022-12-13 07:08:42,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:42,254 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:08:42,254 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:08:42,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-12-13 07:08:42,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:08:42,459 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:08:42,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:42,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1869911434, now seen corresponding path program 25 times [2022-12-13 07:08:42,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:42,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680640354] [2022-12-13 07:08:42,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:42,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:43,124 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 07:08:43,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:43,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680640354] [2022-12-13 07:08:43,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680640354] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:08:43,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906945854] [2022-12-13 07:08:43,125 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:08:43,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:08:43,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:08:43,128 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:08:43,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-12-13 07:08:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:43,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 07:08:43,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:08:43,450 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:08:43,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-13 07:08:43,517 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 07:08:43,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:08:43,684 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-13 07:08:43,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-13 07:08:43,704 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 07:08:43,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 07:08:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:08:43,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906945854] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:08:43,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:08:43,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-12-13 07:08:43,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93001816] [2022-12-13 07:08:43,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:08:43,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 07:08:43,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:08:43,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 07:08:43,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-12-13 07:08:43,745 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:08:43,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 1661 transitions, 159758 flow. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:43,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:08:43,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:08:43,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:47,309 INFO L130 PetriNetUnfolder]: 1746/3123 cut-off events. [2022-12-13 07:08:47,309 INFO L131 PetriNetUnfolder]: For 195/195 co-relation queries the response was YES. [2022-12-13 07:08:47,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153220 conditions, 3123 events. 1746/3123 cut-off events. For 195/195 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 20354 event pairs, 3 based on Foata normal form. 0/2545 useless extension candidates. Maximal degree in co-relation 135132. Up to 3124 conditions per place. [2022-12-13 07:08:47,355 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 1189 selfloop transitions, 506 changer transitions 0/1695 dead transitions. [2022-12-13 07:08:47,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 506 places, 1695 transitions, 166424 flow [2022-12-13 07:08:47,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 07:08:47,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 07:08:47,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-12-13 07:08:47,356 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2932330827067669 [2022-12-13 07:08:47,357 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 483 predicate places. [2022-12-13 07:08:47,357 INFO L82 GeneralOperation]: Start removeDead. Operand has 506 places, 1695 transitions, 166424 flow [2022-12-13 07:08:47,439 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 506 places, 1695 transitions, 166424 flow [2022-12-13 07:08:47,552 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:08:47,552 INFO L89 Accepts]: Start accepts. Operand has 506 places, 1695 transitions, 166424 flow [2022-12-13 07:08:47,578 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:08:47,578 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:47,578 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 506 places, 1695 transitions, 166424 flow [2022-12-13 07:08:47,640 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 506 places, 1695 transitions, 166424 flow [2022-12-13 07:08:47,640 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:47,643 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:47,643 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 07:08:47,643 INFO L495 AbstractCegarLoop]: Abstraction has has 506 places, 1695 transitions, 166424 flow [2022-12-13 07:08:47,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:47,643 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:08:47,643 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:08:47,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-12-13 07:08:47,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-13 07:08:47,850 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:08:47,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:47,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1367861694, now seen corresponding path program 26 times [2022-12-13 07:08:47,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:47,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671962539] [2022-12-13 07:08:47,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:47,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:48,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:08:48,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:48,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671962539] [2022-12-13 07:08:48,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671962539] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:08:48,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248213273] [2022-12-13 07:08:48,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:08:48,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:08:48,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:08:48,274 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:08:48,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-12-13 07:08:48,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:08:48,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:08:48,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 07:08:48,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:08:48,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-12-13 07:08:48,633 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 07:08:48,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:08:48,791 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-13 07:08:48,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 107 [2022-12-13 07:08:48,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:08:48,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248213273] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:08:48,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:08:48,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-12-13 07:08:48,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036298750] [2022-12-13 07:08:48,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:08:48,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 07:08:48,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:08:48,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 07:08:48,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-12-13 07:08:48,884 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:08:48,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 506 places, 1695 transitions, 166424 flow. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:48,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:08:48,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:08:48,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:52,740 INFO L130 PetriNetUnfolder]: 1786/3186 cut-off events. [2022-12-13 07:08:52,741 INFO L131 PetriNetUnfolder]: For 183/183 co-relation queries the response was YES. [2022-12-13 07:08:52,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159491 conditions, 3186 events. 1786/3186 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 20755 event pairs, 3 based on Foata normal form. 0/2599 useless extension candidates. Maximal degree in co-relation 141539. Up to 3187 conditions per place. [2022-12-13 07:08:52,897 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 1209 selfloop transitions, 514 changer transitions 0/1723 dead transitions. [2022-12-13 07:08:52,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 1723 transitions, 172608 flow [2022-12-13 07:08:52,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 07:08:52,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 07:08:52,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2022-12-13 07:08:52,898 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2669172932330827 [2022-12-13 07:08:52,898 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 496 predicate places. [2022-12-13 07:08:52,898 INFO L82 GeneralOperation]: Start removeDead. Operand has 519 places, 1723 transitions, 172608 flow [2022-12-13 07:08:52,993 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 519 places, 1723 transitions, 172608 flow [2022-12-13 07:08:53,032 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:08:53,032 INFO L89 Accepts]: Start accepts. Operand has 519 places, 1723 transitions, 172608 flow [2022-12-13 07:08:53,074 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:08:53,074 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:53,074 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 519 places, 1723 transitions, 172608 flow [2022-12-13 07:08:53,142 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 519 places, 1723 transitions, 172608 flow [2022-12-13 07:08:53,143 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:53,146 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:53,146 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-13 07:08:53,146 INFO L495 AbstractCegarLoop]: Abstraction has has 519 places, 1723 transitions, 172608 flow [2022-12-13 07:08:53,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:53,147 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:08:53,147 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:08:53,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-12-13 07:08:53,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-13 07:08:53,354 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:08:53,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:53,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1495276446, now seen corresponding path program 27 times [2022-12-13 07:08:53,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:53,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978332385] [2022-12-13 07:08:53,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:53,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:53,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:08:53,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:53,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978332385] [2022-12-13 07:08:53,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978332385] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:08:53,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413410273] [2022-12-13 07:08:53,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:08:53,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:08:53,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:08:53,846 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:08:53,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-12-13 07:08:54,083 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 07:08:54,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:08:54,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 07:08:54,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:08:54,203 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 07:08:54,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-12-13 07:08:54,210 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 07:08:54,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2022-12-13 07:08:54,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:08:54,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:08:54,448 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-13 07:08:54,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 107 [2022-12-13 07:08:54,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:08:54,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413410273] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:08:54,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:08:54,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2022-12-13 07:08:54,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804071932] [2022-12-13 07:08:54,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:08:54,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 07:08:54,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:08:54,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 07:08:54,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-12-13 07:08:54,533 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:08:54,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 1723 transitions, 172608 flow. Second operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:54,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:08:54,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:08:54,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:08:58,488 INFO L130 PetriNetUnfolder]: 1763/3143 cut-off events. [2022-12-13 07:08:58,488 INFO L131 PetriNetUnfolder]: For 173/173 co-relation queries the response was YES. [2022-12-13 07:08:58,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160479 conditions, 3143 events. 1763/3143 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 20417 event pairs, 2 based on Foata normal form. 7/2575 useless extension candidates. Maximal degree in co-relation 143502. Up to 3144 conditions per place. [2022-12-13 07:08:58,546 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 1237 selfloop transitions, 462 changer transitions 7/1706 dead transitions. [2022-12-13 07:08:58,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 1706 transitions, 174308 flow [2022-12-13 07:08:58,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 07:08:58,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 07:08:58,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 97 transitions. [2022-12-13 07:08:58,548 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28362573099415206 [2022-12-13 07:08:58,548 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 512 predicate places. [2022-12-13 07:08:58,548 INFO L82 GeneralOperation]: Start removeDead. Operand has 535 places, 1706 transitions, 174308 flow [2022-12-13 07:08:58,646 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 532 places, 1699 transitions, 173588 flow [2022-12-13 07:08:58,693 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:08:58,693 INFO L89 Accepts]: Start accepts. Operand has 532 places, 1699 transitions, 173588 flow [2022-12-13 07:08:58,726 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:08:58,726 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:08:58,727 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 532 places, 1699 transitions, 173588 flow [2022-12-13 07:08:58,780 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 532 places, 1699 transitions, 173588 flow [2022-12-13 07:08:58,780 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:08:58,782 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:08:58,782 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-13 07:08:58,782 INFO L495 AbstractCegarLoop]: Abstraction has has 532 places, 1699 transitions, 173588 flow [2022-12-13 07:08:58,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:08:58,783 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:08:58,783 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:08:58,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-12-13 07:08:58,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-12-13 07:08:58,983 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:08:58,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:58,983 INFO L85 PathProgramCache]: Analyzing trace with hash -753596258, now seen corresponding path program 28 times [2022-12-13 07:08:58,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:58,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3519122] [2022-12-13 07:08:58,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:58,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:59,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:08:59,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:59,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3519122] [2022-12-13 07:08:59,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3519122] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:08:59,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914415026] [2022-12-13 07:08:59,378 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:08:59,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:08:59,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:08:59,380 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:08:59,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-12-13 07:08:59,603 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:08:59,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:08:59,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 07:08:59,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:08:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:08:59,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:08:59,883 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-13 07:08:59,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-13 07:08:59,898 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 07:08:59,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 07:08:59,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:08:59,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914415026] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:08:59,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:08:59,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-12-13 07:08:59,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091367397] [2022-12-13 07:08:59,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:08:59,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 07:08:59,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:08:59,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 07:08:59,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-12-13 07:08:59,929 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:08:59,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 532 places, 1699 transitions, 173588 flow. Second operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 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 07:08:59,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:08:59,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:08:59,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:09:03,480 INFO L130 PetriNetUnfolder]: 1755/3128 cut-off events. [2022-12-13 07:09:03,481 INFO L131 PetriNetUnfolder]: For 174/174 co-relation queries the response was YES. [2022-12-13 07:09:03,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162841 conditions, 3128 events. 1755/3128 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 20310 event pairs, 1 based on Foata normal form. 7/2563 useless extension candidates. Maximal degree in co-relation 145951. Up to 3129 conditions per place. [2022-12-13 07:09:03,527 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 1197 selfloop transitions, 486 changer transitions 14/1697 dead transitions. [2022-12-13 07:09:03,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 1697 transitions, 176778 flow [2022-12-13 07:09:03,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:09:03,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:09:03,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 61 transitions. [2022-12-13 07:09:03,528 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.291866028708134 [2022-12-13 07:09:03,529 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 519 predicate places. [2022-12-13 07:09:03,529 INFO L82 GeneralOperation]: Start removeDead. Operand has 542 places, 1697 transitions, 176778 flow [2022-12-13 07:09:03,615 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 540 places, 1683 transitions, 175310 flow [2022-12-13 07:09:03,657 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:09:03,657 INFO L89 Accepts]: Start accepts. Operand has 540 places, 1683 transitions, 175310 flow [2022-12-13 07:09:03,699 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:09:03,699 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:09:03,699 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 540 places, 1683 transitions, 175310 flow [2022-12-13 07:09:03,754 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 540 places, 1683 transitions, 175310 flow [2022-12-13 07:09:03,754 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:09:03,756 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:09:03,757 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 07:09:03,757 INFO L495 AbstractCegarLoop]: Abstraction has has 540 places, 1683 transitions, 175310 flow [2022-12-13 07:09:03,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 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 07:09:03,757 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:09:03,757 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:09:03,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-12-13 07:09:03,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:09:03,958 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:09:03,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:09:03,958 INFO L85 PathProgramCache]: Analyzing trace with hash -266084010, now seen corresponding path program 29 times [2022-12-13 07:09:03,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:09:03,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342851290] [2022-12-13 07:09:03,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:09:03,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:09:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:09:04,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:09:04,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:09:04,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342851290] [2022-12-13 07:09:04,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342851290] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:09:04,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638515005] [2022-12-13 07:09:04,607 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:09:04,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:09:04,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:09:04,609 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:09:04,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-12-13 07:09:04,833 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:09:04,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:09:04,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 07:09:04,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:09:04,941 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:09:04,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-13 07:09:05,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:09:05,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:09:05,202 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-13 07:09:05,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-13 07:09:05,217 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 07:09:05,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 07:09:05,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:09:05,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638515005] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:09:05,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:09:05,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 21 [2022-12-13 07:09:05,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550486051] [2022-12-13 07:09:05,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:09:05,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 07:09:05,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:09:05,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 07:09:05,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2022-12-13 07:09:05,255 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:09:05,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 1683 transitions, 175310 flow. Second operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:09:05,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:09:05,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:09:05,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:09:09,137 INFO L130 PetriNetUnfolder]: 1732/3073 cut-off events. [2022-12-13 07:09:09,138 INFO L131 PetriNetUnfolder]: For 151/151 co-relation queries the response was YES. [2022-12-13 07:09:09,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163045 conditions, 3073 events. 1732/3073 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 19772 event pairs, 2 based on Foata normal form. 7/2518 useless extension candidates. Maximal degree in co-relation 147750. Up to 3074 conditions per place. [2022-12-13 07:09:09,184 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 1197 selfloop transitions, 464 changer transitions 7/1668 dead transitions. [2022-12-13 07:09:09,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 1668 transitions, 177074 flow [2022-12-13 07:09:09,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 07:09:09,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 07:09:09,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 75 transitions. [2022-12-13 07:09:09,185 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24671052631578946 [2022-12-13 07:09:09,186 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 532 predicate places. [2022-12-13 07:09:09,186 INFO L82 GeneralOperation]: Start removeDead. Operand has 555 places, 1668 transitions, 177074 flow [2022-12-13 07:09:09,280 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 553 places, 1661 transitions, 176326 flow [2022-12-13 07:09:09,317 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:09:09,317 INFO L89 Accepts]: Start accepts. Operand has 553 places, 1661 transitions, 176326 flow [2022-12-13 07:09:09,349 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:09:09,349 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:09:09,350 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 553 places, 1661 transitions, 176326 flow [2022-12-13 07:09:09,404 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 553 places, 1661 transitions, 176326 flow [2022-12-13 07:09:09,404 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:09:09,406 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:09:09,406 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-13 07:09:09,406 INFO L495 AbstractCegarLoop]: Abstraction has has 553 places, 1661 transitions, 176326 flow [2022-12-13 07:09:09,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:09:09,406 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:09:09,406 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:09:09,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-12-13 07:09:09,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:09:09,607 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:09:09,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:09:09,607 INFO L85 PathProgramCache]: Analyzing trace with hash 945165202, now seen corresponding path program 30 times [2022-12-13 07:09:09,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:09:09,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285124395] [2022-12-13 07:09:09,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:09:09,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:09:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:09:10,409 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 07:09:10,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:09:10,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285124395] [2022-12-13 07:09:10,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285124395] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:09:10,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155907733] [2022-12-13 07:09:10,409 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:09:10,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:09:10,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:09:10,410 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:09:10,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-12-13 07:09:10,656 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 07:09:10,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:09:10,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 07:09:10,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:09:10,797 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 07:09:10,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:09:10,975 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-13 07:09:10,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-13 07:09:10,990 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 07:09:10,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 07:09:11,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:09:11,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155907733] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:09:11,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:09:11,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 19 [2022-12-13 07:09:11,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691028825] [2022-12-13 07:09:11,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:09:11,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 07:09:11,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:09:11,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 07:09:11,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2022-12-13 07:09:11,024 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:09:11,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 1661 transitions, 176326 flow. Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:09:11,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:09:11,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:09:11,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:09:14,370 INFO L130 PetriNetUnfolder]: 1749/3095 cut-off events. [2022-12-13 07:09:14,370 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2022-12-13 07:09:14,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167305 conditions, 3095 events. 1749/3095 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 19874 event pairs, 1 based on Foata normal form. 0/2530 useless extension candidates. Maximal degree in co-relation 151941. Up to 3096 conditions per place. [2022-12-13 07:09:14,416 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 1168 selfloop transitions, 505 changer transitions 0/1673 dead transitions. [2022-12-13 07:09:14,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 1673 transitions, 180944 flow [2022-12-13 07:09:14,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 07:09:14,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 07:09:14,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-12-13 07:09:14,417 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2719298245614035 [2022-12-13 07:09:14,417 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 541 predicate places. [2022-12-13 07:09:14,418 INFO L82 GeneralOperation]: Start removeDead. Operand has 564 places, 1673 transitions, 180944 flow [2022-12-13 07:09:14,506 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 564 places, 1673 transitions, 180944 flow [2022-12-13 07:09:14,676 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:09:14,676 INFO L89 Accepts]: Start accepts. Operand has 564 places, 1673 transitions, 180944 flow [2022-12-13 07:09:14,701 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:09:14,701 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:09:14,701 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 564 places, 1673 transitions, 180944 flow [2022-12-13 07:09:14,755 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 564 places, 1673 transitions, 180944 flow [2022-12-13 07:09:14,756 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:09:14,757 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:09:14,758 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-13 07:09:14,758 INFO L495 AbstractCegarLoop]: Abstraction has has 564 places, 1673 transitions, 180944 flow [2022-12-13 07:09:14,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:09:14,758 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:09:14,758 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:09:14,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2022-12-13 07:09:14,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:09:14,959 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:09:14,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:09:14,959 INFO L85 PathProgramCache]: Analyzing trace with hash -99036642, now seen corresponding path program 31 times [2022-12-13 07:09:14,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:09:14,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582273698] [2022-12-13 07:09:14,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:09:14,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:09:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:09:15,370 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 07:09:15,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:09:15,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582273698] [2022-12-13 07:09:15,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582273698] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:09:15,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367258355] [2022-12-13 07:09:15,371 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:09:15,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:09:15,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:09:15,372 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:09:15,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-12-13 07:09:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:09:15,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 07:09:15,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:09:15,754 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 07:09:15,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:09:15,896 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-13 07:09:15,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 107 [2022-12-13 07:09:15,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:09:15,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367258355] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:09:15,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:09:15,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-12-13 07:09:15,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003526442] [2022-12-13 07:09:15,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:09:15,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 07:09:15,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:09:15,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 07:09:15,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-12-13 07:09:15,978 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:09:15,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 1673 transitions, 180944 flow. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:09:15,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:09:15,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:09:15,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:09:19,839 INFO L130 PetriNetUnfolder]: 1759/3111 cut-off events. [2022-12-13 07:09:19,839 INFO L131 PetriNetUnfolder]: For 140/140 co-relation queries the response was YES. [2022-12-13 07:09:19,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171278 conditions, 3111 events. 1759/3111 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 19977 event pairs, 6 based on Foata normal form. 0/2543 useless extension candidates. Maximal degree in co-relation 156074. Up to 3112 conditions per place. [2022-12-13 07:09:20,000 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 1163 selfloop transitions, 526 changer transitions 0/1689 dead transitions. [2022-12-13 07:09:20,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 1689 transitions, 186044 flow [2022-12-13 07:09:20,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 07:09:20,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 07:09:20,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 79 transitions. [2022-12-13 07:09:20,002 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2598684210526316 [2022-12-13 07:09:20,002 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 554 predicate places. [2022-12-13 07:09:20,002 INFO L82 GeneralOperation]: Start removeDead. Operand has 577 places, 1689 transitions, 186044 flow [2022-12-13 07:09:20,092 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 577 places, 1689 transitions, 186044 flow [2022-12-13 07:09:20,131 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:09:20,131 INFO L89 Accepts]: Start accepts. Operand has 577 places, 1689 transitions, 186044 flow [2022-12-13 07:09:20,174 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:09:20,174 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:09:20,174 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 577 places, 1689 transitions, 186044 flow [2022-12-13 07:09:20,343 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 577 places, 1689 transitions, 186044 flow [2022-12-13 07:09:20,343 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:09:20,345 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:09:20,346 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-13 07:09:20,346 INFO L495 AbstractCegarLoop]: Abstraction has has 577 places, 1689 transitions, 186044 flow [2022-12-13 07:09:20,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:09:20,346 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:09:20,346 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:09:20,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-12-13 07:09:20,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-12-13 07:09:20,547 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:09:20,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:09:20,547 INFO L85 PathProgramCache]: Analyzing trace with hash 935650866, now seen corresponding path program 32 times [2022-12-13 07:09:20,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:09:20,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575970151] [2022-12-13 07:09:20,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:09:20,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:09:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:09:20,987 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 07:09:20,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:09:20,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575970151] [2022-12-13 07:09:20,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575970151] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:09:20,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329534583] [2022-12-13 07:09:20,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:09:20,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:09:20,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:09:20,989 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:09:20,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-12-13 07:09:21,255 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:09:21,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:09:21,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 07:09:21,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:09:21,356 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:09:21,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 51 [2022-12-13 07:09:21,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:09:21,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:09:21,597 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-13 07:09:21,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-13 07:09:21,614 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 07:09:21,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 07:09:21,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:09:21,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329534583] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:09:21,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:09:21,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2022-12-13 07:09:21,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985711130] [2022-12-13 07:09:21,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:09:21,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 07:09:21,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:09:21,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 07:09:21,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-12-13 07:09:21,649 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:09:21,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 1689 transitions, 186044 flow. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 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 07:09:21,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:09:21,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:09:21,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:09:25,546 INFO L130 PetriNetUnfolder]: 1789/3167 cut-off events. [2022-12-13 07:09:25,546 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2022-12-13 07:09:25,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177529 conditions, 3167 events. 1789/3167 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 20461 event pairs, 8 based on Foata normal form. 0/2587 useless extension candidates. Maximal degree in co-relation 161487. Up to 3168 conditions per place. [2022-12-13 07:09:25,596 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 1192 selfloop transitions, 520 changer transitions 0/1712 dead transitions. [2022-12-13 07:09:25,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 1712 transitions, 192004 flow [2022-12-13 07:09:25,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 07:09:25,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 07:09:25,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2022-12-13 07:09:25,597 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26625386996904027 [2022-12-13 07:09:25,597 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 570 predicate places. [2022-12-13 07:09:25,597 INFO L82 GeneralOperation]: Start removeDead. Operand has 593 places, 1712 transitions, 192004 flow [2022-12-13 07:09:25,688 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 593 places, 1712 transitions, 192004 flow [2022-12-13 07:09:25,728 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:09:25,728 INFO L89 Accepts]: Start accepts. Operand has 593 places, 1712 transitions, 192004 flow [2022-12-13 07:09:25,765 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:09:25,765 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:09:25,765 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 593 places, 1712 transitions, 192004 flow [2022-12-13 07:09:25,825 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 593 places, 1712 transitions, 192004 flow [2022-12-13 07:09:25,825 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:09:25,827 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:09:25,827 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 07:09:25,828 INFO L495 AbstractCegarLoop]: Abstraction has has 593 places, 1712 transitions, 192004 flow [2022-12-13 07:09:25,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 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 07:09:25,828 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:09:25,828 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:09:25,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-12-13 07:09:26,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-12-13 07:09:26,029 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:09:26,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:09:26,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1755489006, now seen corresponding path program 33 times [2022-12-13 07:09:26,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:09:26,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517994425] [2022-12-13 07:09:26,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:09:26,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:09:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:09:26,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:09:26,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:09:26,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517994425] [2022-12-13 07:09:26,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517994425] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:09:26,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144298967] [2022-12-13 07:09:26,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:09:26,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:09:26,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:09:26,774 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:09:26,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-12-13 07:09:27,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:09:27,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:09:27,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 07:09:27,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:09:27,209 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 07:09:27,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-12-13 07:09:27,219 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 07:09:27,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2022-12-13 07:09:27,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:09:27,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:09:27,501 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-13 07:09:27,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-13 07:09:27,515 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 07:09:27,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 07:09:27,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:09:27,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144298967] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:09:27,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:09:27,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 21 [2022-12-13 07:09:27,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42869428] [2022-12-13 07:09:27,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:09:27,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 07:09:27,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:09:27,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 07:09:27,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2022-12-13 07:09:27,552 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:09:27,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 593 places, 1712 transitions, 192004 flow. Second operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:09:27,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:09:27,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:09:27,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:09:31,280 INFO L130 PetriNetUnfolder]: 1779/3147 cut-off events. [2022-12-13 07:09:31,280 INFO L131 PetriNetUnfolder]: For 141/141 co-relation queries the response was YES. [2022-12-13 07:09:31,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179554 conditions, 3147 events. 1779/3147 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 20303 event pairs, 1 based on Foata normal form. 4/2575 useless extension candidates. Maximal degree in co-relation 163914. Up to 3148 conditions per place. [2022-12-13 07:09:31,333 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 1235 selfloop transitions, 465 changer transitions 4/1704 dead transitions. [2022-12-13 07:09:31,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 1704 transitions, 194510 flow [2022-12-13 07:09:31,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 07:09:31,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 07:09:31,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 71 transitions. [2022-12-13 07:09:31,335 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2874493927125506 [2022-12-13 07:09:31,335 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 581 predicate places. [2022-12-13 07:09:31,335 INFO L82 GeneralOperation]: Start removeDead. Operand has 604 places, 1704 transitions, 194510 flow [2022-12-13 07:09:31,534 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 601 places, 1700 transitions, 194051 flow [2022-12-13 07:09:31,574 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:09:31,574 INFO L89 Accepts]: Start accepts. Operand has 601 places, 1700 transitions, 194051 flow [2022-12-13 07:09:31,629 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:09:31,629 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:09:31,629 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 601 places, 1700 transitions, 194051 flow [2022-12-13 07:09:31,696 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 601 places, 1700 transitions, 194051 flow [2022-12-13 07:09:31,696 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:09:31,698 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:09:31,699 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 07:09:31,699 INFO L495 AbstractCegarLoop]: Abstraction has has 601 places, 1700 transitions, 194051 flow [2022-12-13 07:09:31,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:09:31,699 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:09:31,699 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:09:31,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-12-13 07:09:31,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-12-13 07:09:31,911 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:09:31,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:09:31,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1537456764, now seen corresponding path program 34 times [2022-12-13 07:09:31,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:09:31,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263120399] [2022-12-13 07:09:31,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:09:31,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:09:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:09:32,482 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 07:09:32,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:09:32,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263120399] [2022-12-13 07:09:32,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263120399] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:09:32,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717389692] [2022-12-13 07:09:32,483 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:09:32,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:09:32,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:09:32,484 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:09:32,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-12-13 07:09:32,720 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:09:32,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:09:32,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 07:09:32,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:09:32,863 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 07:09:32,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-12-13 07:09:32,871 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 07:09:32,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2022-12-13 07:09:32,926 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 07:09:32,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:09:33,106 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-13 07:09:33,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 72 [2022-12-13 07:09:33,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:09:33,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717389692] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:09:33,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:09:33,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 20 [2022-12-13 07:09:33,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453360134] [2022-12-13 07:09:33,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:09:33,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 07:09:33,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:09:33,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 07:09:33,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-12-13 07:09:33,146 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:09:33,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 1700 transitions, 194051 flow. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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 07:09:33,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:09:33,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:09:33,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:09:37,991 INFO L130 PetriNetUnfolder]: 1881/3333 cut-off events. [2022-12-13 07:09:37,991 INFO L131 PetriNetUnfolder]: For 161/161 co-relation queries the response was YES. [2022-12-13 07:09:37,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193501 conditions, 3333 events. 1881/3333 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 21705 event pairs, 2 based on Foata normal form. 0/2711 useless extension candidates. Maximal degree in co-relation 175373. Up to 3334 conditions per place. [2022-12-13 07:09:38,046 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 1022 selfloop transitions, 760 changer transitions 0/1782 dead transitions. [2022-12-13 07:09:38,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 1782 transitions, 206987 flow [2022-12-13 07:09:38,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 07:09:38,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 07:09:38,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 111 transitions. [2022-12-13 07:09:38,048 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2781954887218045 [2022-12-13 07:09:38,048 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 598 predicate places. [2022-12-13 07:09:38,048 INFO L82 GeneralOperation]: Start removeDead. Operand has 621 places, 1782 transitions, 206987 flow [2022-12-13 07:09:38,156 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 621 places, 1782 transitions, 206987 flow [2022-12-13 07:09:38,340 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:09:38,340 INFO L89 Accepts]: Start accepts. Operand has 621 places, 1782 transitions, 206987 flow [2022-12-13 07:09:38,382 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:09:38,383 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:09:38,383 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 621 places, 1782 transitions, 206987 flow [2022-12-13 07:09:38,447 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 621 places, 1782 transitions, 206987 flow [2022-12-13 07:09:38,447 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:09:38,450 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:09:38,451 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-13 07:09:38,451 INFO L495 AbstractCegarLoop]: Abstraction has has 621 places, 1782 transitions, 206987 flow [2022-12-13 07:09:38,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 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 07:09:38,451 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:09:38,451 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:09:38,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-12-13 07:09:38,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-12-13 07:09:38,658 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:09:38,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:09:38,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1137975365, now seen corresponding path program 1 times [2022-12-13 07:09:38,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:09:38,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955654147] [2022-12-13 07:09:38,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:09:38,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:09:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:09:39,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:09:39,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:09:39,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955654147] [2022-12-13 07:09:39,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955654147] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:09:39,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720845927] [2022-12-13 07:09:39,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:09:39,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:09:39,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:09:39,208 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:09:39,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-12-13 07:09:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:09:39,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-13 07:09:39,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:09:39,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:09:39,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2022-12-13 07:09:39,757 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 07:09:39,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2022-12-13 07:09:39,787 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 07:09:39,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:09:40,010 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3827 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3827))) (let ((.cse0 (select .cse1 ~o_2~0.base))) (or (= (select .cse0 c_~o_2~0.offset) (select (select .cse1 c_~o_0~0.base) c_~o_0~0.offset)) (not (= (select .cse0 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) |c_thread1Thread1of1ForFork0_#t~mem1#1|)))))) is different from false [2022-12-13 07:09:40,062 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-13 07:09:40,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 131 [2022-12-13 07:09:40,080 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:09:40,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 90 [2022-12-13 07:09:40,298 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 07:09:40,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720845927] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:09:40,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:09:40,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 28 [2022-12-13 07:09:40,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658102124] [2022-12-13 07:09:40,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:09:40,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-13 07:09:40,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:09:40,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 07:09:40,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=637, Unknown=1, NotChecked=52, Total=812 [2022-12-13 07:09:40,300 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:09:40,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 1782 transitions, 206987 flow. Second operand has 29 states, 29 states have (on average 1.793103448275862) internal successors, (52), 28 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:09:40,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:09:40,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:09:40,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:09:46,712 INFO L130 PetriNetUnfolder]: 2104/3725 cut-off events. [2022-12-13 07:09:46,712 INFO L131 PetriNetUnfolder]: For 203/203 co-relation queries the response was YES. [2022-12-13 07:09:46,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219990 conditions, 3725 events. 2104/3725 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 24609 event pairs, 3 based on Foata normal form. 0/3036 useless extension candidates. Maximal degree in co-relation 197046. Up to 3726 conditions per place. [2022-12-13 07:09:46,775 INFO L137 encePairwiseOnDemand]: 7/19 looper letters, 1523 selfloop transitions, 451 changer transitions 0/1974 dead transitions. [2022-12-13 07:09:46,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 1974 transitions, 233273 flow [2022-12-13 07:09:46,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 07:09:46,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-13 07:09:46,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 179 transitions. [2022-12-13 07:09:46,776 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3489278752436647 [2022-12-13 07:09:46,776 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 624 predicate places. [2022-12-13 07:09:46,776 INFO L82 GeneralOperation]: Start removeDead. Operand has 647 places, 1974 transitions, 233273 flow [2022-12-13 07:09:46,894 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 647 places, 1974 transitions, 233273 flow [2022-12-13 07:09:46,944 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:09:46,944 INFO L89 Accepts]: Start accepts. Operand has 647 places, 1974 transitions, 233273 flow [2022-12-13 07:09:47,002 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:09:47,002 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:09:47,002 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 647 places, 1974 transitions, 233273 flow [2022-12-13 07:09:47,156 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 647 places, 1974 transitions, 233273 flow [2022-12-13 07:09:47,156 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:09:47,158 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:09:47,159 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-13 07:09:47,159 INFO L495 AbstractCegarLoop]: Abstraction has has 647 places, 1974 transitions, 233273 flow [2022-12-13 07:09:47,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.793103448275862) internal successors, (52), 28 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:09:47,159 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:09:47,159 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:09:47,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-12-13 07:09:47,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-12-13 07:09:47,360 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:09:47,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:09:47,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1900645443, now seen corresponding path program 2 times [2022-12-13 07:09:47,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:09:47,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576518753] [2022-12-13 07:09:47,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:09:47,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:09:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:09:47,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:09:47,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:09:47,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576518753] [2022-12-13 07:09:47,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576518753] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:09:47,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274275554] [2022-12-13 07:09:47,958 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:09:47,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:09:47,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:09:47,960 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:09:47,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-12-13 07:09:48,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:09:48,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:09:48,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 07:09:48,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:09:48,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:09:48,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2022-12-13 07:09:48,462 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 07:09:48,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2022-12-13 07:09:48,472 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 07:09:48,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:09:48,596 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3900 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3900))) (let ((.cse0 (select .cse1 ~o_2~0.base))) (or (not (= (select .cse0 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) |c_thread1Thread1of1ForFork0_#t~mem1#1|)) (= (select (select .cse1 c_~o_0~0.base) c_~o_0~0.offset) (select .cse0 c_~o_2~0.offset)))))) is different from false [2022-12-13 07:09:48,660 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-13 07:09:48,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 131 [2022-12-13 07:09:48,683 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:09:48,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 90 [2022-12-13 07:09:48,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:09:48,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274275554] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:09:48,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:09:48,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2022-12-13 07:09:48,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577974040] [2022-12-13 07:09:48,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:09:48,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 07:09:48,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:09:48,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 07:09:48,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=413, Unknown=1, NotChecked=42, Total=552 [2022-12-13 07:09:48,951 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:09:48,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 647 places, 1974 transitions, 233273 flow. Second operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:09:48,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:09:48,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:09:48,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:09:54,917 INFO L130 PetriNetUnfolder]: 2173/3848 cut-off events. [2022-12-13 07:09:54,917 INFO L131 PetriNetUnfolder]: For 207/207 co-relation queries the response was YES. [2022-12-13 07:09:54,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231104 conditions, 3848 events. 2173/3848 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 25576 event pairs, 9 based on Foata normal form. 0/3133 useless extension candidates. Maximal degree in co-relation 206085. Up to 3849 conditions per place. [2022-12-13 07:09:54,982 INFO L137 encePairwiseOnDemand]: 8/19 looper letters, 1859 selfloop transitions, 163 changer transitions 0/2022 dead transitions. [2022-12-13 07:09:54,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 2022 transitions, 242999 flow [2022-12-13 07:09:54,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 07:09:54,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 07:09:54,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 88 transitions. [2022-12-13 07:09:54,983 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3562753036437247 [2022-12-13 07:09:54,983 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 636 predicate places. [2022-12-13 07:09:54,983 INFO L82 GeneralOperation]: Start removeDead. Operand has 659 places, 2022 transitions, 242999 flow [2022-12-13 07:09:55,110 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 659 places, 2022 transitions, 242999 flow [2022-12-13 07:09:55,163 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:09:55,163 INFO L89 Accepts]: Start accepts. Operand has 659 places, 2022 transitions, 242999 flow [2022-12-13 07:09:55,220 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:09:55,220 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:09:55,220 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 659 places, 2022 transitions, 242999 flow [2022-12-13 07:09:55,300 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 659 places, 2022 transitions, 242999 flow [2022-12-13 07:09:55,300 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:09:55,304 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:09:55,304 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 07:09:55,304 INFO L495 AbstractCegarLoop]: Abstraction has has 659 places, 2022 transitions, 242999 flow [2022-12-13 07:09:55,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:09:55,304 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:09:55,304 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:09:55,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-12-13 07:09:55,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-12-13 07:09:55,511 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:09:55,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:09:55,511 INFO L85 PathProgramCache]: Analyzing trace with hash 183534480, now seen corresponding path program 35 times [2022-12-13 07:09:55,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:09:55,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043210110] [2022-12-13 07:09:55,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:09:55,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:09:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:09:56,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:09:56,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:09:56,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043210110] [2022-12-13 07:09:56,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043210110] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:09:56,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998604602] [2022-12-13 07:09:56,136 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:09:56,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:09:56,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:09:56,137 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:09:56,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-12-13 07:09:56,404 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 07:09:56,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:09:56,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 07:09:56,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:09:56,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:09:56,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 07:09:56,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:09:56,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:09:56,822 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3973 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3973))) (let ((.cse0 (select .cse1 ~o_2~0.base))) (or (= (select .cse0 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (not (= (select .cse0 c_~o_2~0.offset) (select (select .cse1 c_~o_0~0.base) c_~o_0~0.offset))))))) (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_3973 (Array Int Int)) (~o_2~0.base Int)) (not (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3973))) (= (select (select .cse2 ~o_2~0.base) c_~o_2~0.offset) (select (select .cse2 c_~o_0~0.base) c_~o_0~0.offset))))))) is different from false [2022-12-13 07:09:56,861 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:09:56,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 148 [2022-12-13 07:09:56,879 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:09:56,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 84 [2022-12-13 07:09:57,263 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:09:57,265 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 07:09:57,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:09:57,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998604602] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:09:57,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:09:57,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 23 [2022-12-13 07:09:57,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037572907] [2022-12-13 07:09:57,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:09:57,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 07:09:57,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:09:57,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 07:09:57,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=424, Unknown=1, NotChecked=42, Total=552 [2022-12-13 07:09:57,314 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:09:57,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 2022 transitions, 242999 flow. Second operand has 24 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 23 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 07:09:57,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:09:57,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:09:57,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:10:01,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:10:07,401 INFO L130 PetriNetUnfolder]: 2191/3878 cut-off events. [2022-12-13 07:10:07,402 INFO L131 PetriNetUnfolder]: For 213/213 co-relation queries the response was YES. [2022-12-13 07:10:07,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236783 conditions, 3878 events. 2191/3878 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 25744 event pairs, 3 based on Foata normal form. 0/3157 useless extension candidates. Maximal degree in co-relation 211349. Up to 3879 conditions per place. [2022-12-13 07:10:07,479 INFO L137 encePairwiseOnDemand]: 7/19 looper letters, 1427 selfloop transitions, 607 changer transitions 0/2034 dead transitions. [2022-12-13 07:10:07,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 669 places, 2034 transitions, 248507 flow [2022-12-13 07:10:07,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:10:07,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:10:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 67 transitions. [2022-12-13 07:10:07,480 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32057416267942584 [2022-12-13 07:10:07,480 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 646 predicate places. [2022-12-13 07:10:07,480 INFO L82 GeneralOperation]: Start removeDead. Operand has 669 places, 2034 transitions, 248507 flow [2022-12-13 07:10:07,623 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 669 places, 2034 transitions, 248507 flow [2022-12-13 07:10:07,687 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:10:07,687 INFO L89 Accepts]: Start accepts. Operand has 669 places, 2034 transitions, 248507 flow [2022-12-13 07:10:07,740 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:10:07,740 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:10:07,740 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 669 places, 2034 transitions, 248507 flow [2022-12-13 07:10:07,838 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 669 places, 2034 transitions, 248507 flow [2022-12-13 07:10:07,838 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:10:07,842 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:10:07,842 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 155 [2022-12-13 07:10:07,842 INFO L495 AbstractCegarLoop]: Abstraction has has 669 places, 2034 transitions, 248507 flow [2022-12-13 07:10:07,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 23 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 07:10:07,842 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:10:07,842 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:10:07,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-12-13 07:10:08,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:10:08,048 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:10:08,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:10:08,049 INFO L85 PathProgramCache]: Analyzing trace with hash 237940938, now seen corresponding path program 36 times [2022-12-13 07:10:08,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:10:08,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684034186] [2022-12-13 07:10:08,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:10:08,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:10:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:10:08,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:10:08,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:10:08,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684034186] [2022-12-13 07:10:08,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684034186] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:10:08,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760329999] [2022-12-13 07:10:08,421 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:10:08,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:10:08,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:10:08,422 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:10:08,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-12-13 07:10:08,706 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 07:10:08,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:10:08,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 07:10:08,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:10:08,831 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 07:10:08,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:10:08,965 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-13 07:10:08,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 107 [2022-12-13 07:10:09,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:10:09,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760329999] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:10:09,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:10:09,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 17 [2022-12-13 07:10:09,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201952515] [2022-12-13 07:10:09,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:10:09,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 07:10:09,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:10:09,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 07:10:09,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-12-13 07:10:09,039 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:10:09,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 669 places, 2034 transitions, 248507 flow. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:10:09,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:10:09,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:10:09,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:10:15,168 INFO L130 PetriNetUnfolder]: 2235/3951 cut-off events. [2022-12-13 07:10:15,168 INFO L131 PetriNetUnfolder]: For 219/219 co-relation queries the response was YES. [2022-12-13 07:10:15,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245188 conditions, 3951 events. 2235/3951 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 26355 event pairs, 7 based on Foata normal form. 0/3215 useless extension candidates. Maximal degree in co-relation 219339. Up to 3952 conditions per place. [2022-12-13 07:10:15,320 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 1382 selfloop transitions, 684 changer transitions 0/2066 dead transitions. [2022-12-13 07:10:15,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 2066 transitions, 256543 flow [2022-12-13 07:10:15,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 07:10:15,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 07:10:15,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 67 transitions. [2022-12-13 07:10:15,324 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2518796992481203 [2022-12-13 07:10:15,324 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 659 predicate places. [2022-12-13 07:10:15,324 INFO L82 GeneralOperation]: Start removeDead. Operand has 682 places, 2066 transitions, 256543 flow [2022-12-13 07:10:15,462 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 682 places, 2066 transitions, 256543 flow [2022-12-13 07:10:15,525 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:10:15,525 INFO L89 Accepts]: Start accepts. Operand has 682 places, 2066 transitions, 256543 flow [2022-12-13 07:10:15,641 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:10:15,642 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:10:15,642 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 682 places, 2066 transitions, 256543 flow [2022-12-13 07:10:15,752 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 682 places, 2066 transitions, 256543 flow [2022-12-13 07:10:15,752 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:10:15,756 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:10:15,756 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 231 [2022-12-13 07:10:15,756 INFO L495 AbstractCegarLoop]: Abstraction has has 682 places, 2066 transitions, 256543 flow [2022-12-13 07:10:15,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:10:15,757 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:10:15,757 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:10:15,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-12-13 07:10:15,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:10:15,965 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:10:15,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:10:15,965 INFO L85 PathProgramCache]: Analyzing trace with hash -194269890, now seen corresponding path program 37 times [2022-12-13 07:10:15,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:10:15,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924317455] [2022-12-13 07:10:15,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:10:15,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:10:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:10:16,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:10:16,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:10:16,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924317455] [2022-12-13 07:10:16,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924317455] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:10:16,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410130358] [2022-12-13 07:10:16,510 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:10:16,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:10:16,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:10:16,511 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:10:16,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-12-13 07:10:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:10:16,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-13 07:10:16,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:10:16,859 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 07:10:16,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-12-13 07:10:16,867 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 07:10:16,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2022-12-13 07:10:16,995 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 07:10:16,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:10:17,351 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-13 07:10:17,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-13 07:10:17,366 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 07:10:17,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 07:10:17,402 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 07:10:17,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410130358] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:10:17,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:10:17,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 22 [2022-12-13 07:10:17,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703870998] [2022-12-13 07:10:17,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:10:17,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 07:10:17,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:10:17,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 07:10:17,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-12-13 07:10:17,403 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:10:17,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 682 places, 2066 transitions, 256543 flow. Second operand has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:10:17,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:10:17,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:10:17,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:10:25,359 INFO L130 PetriNetUnfolder]: 2324/4138 cut-off events. [2022-12-13 07:10:25,360 INFO L131 PetriNetUnfolder]: For 245/245 co-relation queries the response was YES. [2022-12-13 07:10:25,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260939 conditions, 4138 events. 2324/4138 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 28014 event pairs, 3 based on Foata normal form. 1/3358 useless extension candidates. Maximal degree in co-relation 231444. Up to 4139 conditions per place. [2022-12-13 07:10:25,431 INFO L137 encePairwiseOnDemand]: 8/19 looper letters, 1522 selfloop transitions, 637 changer transitions 5/2164 dead transitions. [2022-12-13 07:10:25,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 706 places, 2164 transitions, 273071 flow [2022-12-13 07:10:25,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 07:10:25,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-13 07:10:25,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 143 transitions. [2022-12-13 07:10:25,432 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30105263157894735 [2022-12-13 07:10:25,433 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 683 predicate places. [2022-12-13 07:10:25,433 INFO L82 GeneralOperation]: Start removeDead. Operand has 706 places, 2164 transitions, 273071 flow [2022-12-13 07:10:25,582 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 706 places, 2159 transitions, 272435 flow [2022-12-13 07:10:25,655 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:10:25,655 INFO L89 Accepts]: Start accepts. Operand has 706 places, 2159 transitions, 272435 flow [2022-12-13 07:10:25,771 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:10:25,771 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:10:25,771 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 706 places, 2159 transitions, 272435 flow [2022-12-13 07:10:25,886 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 706 places, 2159 transitions, 272435 flow [2022-12-13 07:10:25,886 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:10:25,890 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:10:25,891 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 236 [2022-12-13 07:10:25,891 INFO L495 AbstractCegarLoop]: Abstraction has has 706 places, 2159 transitions, 272435 flow [2022-12-13 07:10:25,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:10:25,891 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:10:25,891 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:10:25,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-12-13 07:10:26,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:10:26,098 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:10:26,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:10:26,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1456809649, now seen corresponding path program 3 times [2022-12-13 07:10:26,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:10:26,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531647798] [2022-12-13 07:10:26,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:10:26,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:10:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:10:26,687 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 07:10:26,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:10:26,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531647798] [2022-12-13 07:10:26,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531647798] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:10:26,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929775212] [2022-12-13 07:10:26,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:10:26,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:10:26,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:10:26,689 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:10:26,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-12-13 07:10:26,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:10:26,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:10:26,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 07:10:26,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:10:27,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:10:27,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2022-12-13 07:10:27,220 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 07:10:27,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 12 [2022-12-13 07:10:27,250 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 07:10:27,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:10:27,376 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4190 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4190))) (let ((.cse1 (select .cse0 ~o_2~0.base))) (or (= (select (select .cse0 c_~o_0~0.base) c_~o_0~0.offset) (select .cse1 c_~o_2~0.offset)) (not (= (select .cse1 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) |c_thread1Thread1of1ForFork0_#t~mem1#1|)))))) is different from false [2022-12-13 07:10:27,424 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-13 07:10:27,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 131 [2022-12-13 07:10:27,441 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:10:27,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 90 [2022-12-13 07:10:27,742 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 07:10:27,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929775212] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:10:27,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:10:27,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 23 [2022-12-13 07:10:27,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187602352] [2022-12-13 07:10:27,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:10:27,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 07:10:27,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:10:27,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 07:10:27,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=418, Unknown=1, NotChecked=42, Total=552 [2022-12-13 07:10:27,743 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:10:27,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 706 places, 2159 transitions, 272435 flow. Second operand has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:10:27,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:10:27,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:10:27,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:10:34,386 INFO L130 PetriNetUnfolder]: 2345/4170 cut-off events. [2022-12-13 07:10:34,387 INFO L131 PetriNetUnfolder]: For 249/249 co-relation queries the response was YES. [2022-12-13 07:10:34,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267126 conditions, 4170 events. 2345/4170 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 28251 event pairs, 4 based on Foata normal form. 0/3387 useless extension candidates. Maximal degree in co-relation 236845. Up to 4171 conditions per place. [2022-12-13 07:10:34,463 INFO L137 encePairwiseOnDemand]: 8/19 looper letters, 1998 selfloop transitions, 181 changer transitions 0/2179 dead transitions. [2022-12-13 07:10:34,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 719 places, 2179 transitions, 279319 flow [2022-12-13 07:10:34,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 07:10:34,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 07:10:34,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 101 transitions. [2022-12-13 07:10:34,464 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37969924812030076 [2022-12-13 07:10:34,464 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 696 predicate places. [2022-12-13 07:10:34,464 INFO L82 GeneralOperation]: Start removeDead. Operand has 719 places, 2179 transitions, 279319 flow [2022-12-13 07:10:34,611 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 719 places, 2179 transitions, 279319 flow [2022-12-13 07:10:34,821 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:10:34,821 INFO L89 Accepts]: Start accepts. Operand has 719 places, 2179 transitions, 279319 flow [2022-12-13 07:10:34,886 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:10:34,887 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:10:34,887 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 719 places, 2179 transitions, 279319 flow [2022-12-13 07:10:34,973 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 719 places, 2179 transitions, 279319 flow [2022-12-13 07:10:34,973 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:10:34,976 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:10:34,977 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 156 [2022-12-13 07:10:34,977 INFO L495 AbstractCegarLoop]: Abstraction has has 719 places, 2179 transitions, 279319 flow [2022-12-13 07:10:34,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:10:34,977 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:10:34,977 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:10:34,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-12-13 07:10:35,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2022-12-13 07:10:35,178 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:10:35,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:10:35,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1141905731, now seen corresponding path program 4 times [2022-12-13 07:10:35,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:10:35,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818235600] [2022-12-13 07:10:35,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:10:35,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:10:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:10:35,706 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 07:10:35,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:10:35,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818235600] [2022-12-13 07:10:35,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818235600] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:10:35,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514756341] [2022-12-13 07:10:35,707 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:10:35,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:10:35,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:10:35,709 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:10:35,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-12-13 07:10:35,989 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:10:35,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:10:35,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 07:10:35,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:10:36,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:10:36,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2022-12-13 07:10:36,181 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:10:36,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-13 07:10:36,261 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 07:10:36,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:10:36,397 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4263 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4263))) (let ((.cse0 (select .cse1 ~o_2~0.base))) (or (not (= (select .cse0 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) |c_thread1Thread1of1ForFork0_#t~mem1#1|)) (= (select (select .cse1 c_~o_0~0.base) c_~o_0~0.offset) (select .cse0 c_~o_2~0.offset)))))) is different from false [2022-12-13 07:10:36,444 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-13 07:10:36,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 131 [2022-12-13 07:10:36,462 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:10:36,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 90 [2022-12-13 07:10:36,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:10:36,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514756341] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:10:36,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:10:36,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2022-12-13 07:10:36,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752476274] [2022-12-13 07:10:36,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:10:36,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 07:10:36,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:10:36,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 07:10:36,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=420, Unknown=1, NotChecked=42, Total=552 [2022-12-13 07:10:36,726 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:10:36,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 719 places, 2179 transitions, 279319 flow. Second operand has 24 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:10:36,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:10:36,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:10:36,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:10:43,701 INFO L130 PetriNetUnfolder]: 2327/4152 cut-off events. [2022-12-13 07:10:43,701 INFO L131 PetriNetUnfolder]: For 247/247 co-relation queries the response was YES. [2022-12-13 07:10:43,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270127 conditions, 4152 events. 2327/4152 cut-off events. For 247/247 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 28205 event pairs, 4 based on Foata normal form. 0/3387 useless extension candidates. Maximal degree in co-relation 239635. Up to 4153 conditions per place. [2022-12-13 07:10:43,774 INFO L137 encePairwiseOnDemand]: 8/19 looper letters, 2016 selfloop transitions, 157 changer transitions 0/2173 dead transitions. [2022-12-13 07:10:43,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 731 places, 2173 transitions, 282897 flow [2022-12-13 07:10:43,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 07:10:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 07:10:43,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 79 transitions. [2022-12-13 07:10:43,776 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31983805668016196 [2022-12-13 07:10:43,776 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 708 predicate places. [2022-12-13 07:10:43,776 INFO L82 GeneralOperation]: Start removeDead. Operand has 731 places, 2173 transitions, 282897 flow [2022-12-13 07:10:44,075 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 731 places, 2173 transitions, 282897 flow [2022-12-13 07:10:44,136 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:10:44,137 INFO L89 Accepts]: Start accepts. Operand has 731 places, 2173 transitions, 282897 flow [2022-12-13 07:10:44,193 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:10:44,193 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:10:44,193 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 731 places, 2173 transitions, 282897 flow [2022-12-13 07:10:44,292 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 731 places, 2173 transitions, 282897 flow [2022-12-13 07:10:44,292 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:10:44,295 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:10:44,295 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-13 07:10:44,296 INFO L495 AbstractCegarLoop]: Abstraction has has 731 places, 2173 transitions, 282897 flow [2022-12-13 07:10:44,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:10:44,296 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:10:44,296 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:10:44,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-12-13 07:10:44,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2022-12-13 07:10:44,499 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:10:44,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:10:44,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1281097860, now seen corresponding path program 38 times [2022-12-13 07:10:44,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:10:44,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528945575] [2022-12-13 07:10:44,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:10:44,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:10:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:10:44,959 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:10:44,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:10:44,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528945575] [2022-12-13 07:10:44,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528945575] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:10:44,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582656172] [2022-12-13 07:10:44,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:10:44,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:10:44,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:10:44,960 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:10:44,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-12-13 07:10:45,261 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:10:45,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:10:45,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 07:10:45,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:10:45,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-12-13 07:10:45,414 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 07:10:45,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:10:45,557 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-13 07:10:45,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 72 [2022-12-13 07:10:45,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:10:45,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582656172] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:10:45,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:10:45,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2022-12-13 07:10:45,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015881428] [2022-12-13 07:10:45,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:10:45,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 07:10:45,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:10:45,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 07:10:45,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-12-13 07:10:45,594 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:10:45,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 731 places, 2173 transitions, 282897 flow. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 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 07:10:45,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:10:45,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:10:45,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:10:54,243 INFO L130 PetriNetUnfolder]: 2398/4271 cut-off events. [2022-12-13 07:10:54,244 INFO L131 PetriNetUnfolder]: For 234/234 co-relation queries the response was YES. [2022-12-13 07:10:54,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282134 conditions, 4271 events. 2398/4271 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 29174 event pairs, 5 based on Foata normal form. 0/3482 useless extension candidates. Maximal degree in co-relation 251175. Up to 4272 conditions per place. [2022-12-13 07:10:54,321 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 1337 selfloop transitions, 888 changer transitions 0/2225 dead transitions. [2022-12-13 07:10:54,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 748 places, 2225 transitions, 294107 flow [2022-12-13 07:10:54,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 07:10:54,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 07:10:54,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 91 transitions. [2022-12-13 07:10:54,322 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26608187134502925 [2022-12-13 07:10:54,323 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 725 predicate places. [2022-12-13 07:10:54,323 INFO L82 GeneralOperation]: Start removeDead. Operand has 748 places, 2225 transitions, 294107 flow [2022-12-13 07:10:54,475 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 748 places, 2225 transitions, 294107 flow [2022-12-13 07:10:54,536 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:10:54,536 INFO L89 Accepts]: Start accepts. Operand has 748 places, 2225 transitions, 294107 flow [2022-12-13 07:10:54,607 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:10:54,607 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:10:54,607 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 748 places, 2225 transitions, 294107 flow [2022-12-13 07:10:54,701 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 748 places, 2225 transitions, 294107 flow [2022-12-13 07:10:54,702 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:10:54,705 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:10:54,706 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-13 07:10:54,706 INFO L495 AbstractCegarLoop]: Abstraction has has 748 places, 2225 transitions, 294107 flow [2022-12-13 07:10:54,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 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 07:10:54,706 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:10:54,706 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:10:54,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-12-13 07:10:54,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:10:54,913 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:10:54,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:10:54,913 INFO L85 PathProgramCache]: Analyzing trace with hash -339371082, now seen corresponding path program 39 times [2022-12-13 07:10:54,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:10:54,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561538002] [2022-12-13 07:10:54,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:10:54,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:10:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:10:55,588 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 07:10:55,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:10:55,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561538002] [2022-12-13 07:10:55,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561538002] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:10:55,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656577323] [2022-12-13 07:10:55,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:10:55,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:10:55,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:10:55,590 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:10:55,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-12-13 07:10:55,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 07:10:55,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:10:55,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 07:10:55,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:10:55,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:10:55,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 07:10:56,091 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 07:10:56,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-12-13 07:10:56,100 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 07:10:56,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2022-12-13 07:10:56,168 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 07:10:56,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:10:56,376 WARN L837 $PredicateComparison]: unable to prove that (and (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_4408 (Array Int Int)) (~o_2~0.base Int)) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4408))) (= (select (select .cse0 c_~o_0~0.base) c_~o_0~0.offset) (select (select .cse0 ~o_2~0.base) c_~o_2~0.offset)))))) (forall ((v_ArrVal_4408 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4408))) (let ((.cse1 (select .cse2 ~o_2~0.base))) (or (= |c_thread1Thread1of1ForFork0_#t~mem1#1| (select .cse1 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (not (= (select (select .cse2 c_~o_0~0.base) c_~o_0~0.offset) (select .cse1 c_~o_2~0.offset)))))))) is different from false [2022-12-13 07:10:56,385 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:10:56,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 66 [2022-12-13 07:10:56,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:10:56,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2022-12-13 07:10:56,435 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:10:56,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 148 [2022-12-13 07:10:56,454 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:10:56,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 84 [2022-12-13 07:10:56,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:10:56,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656577323] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:10:56,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:10:56,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 24 [2022-12-13 07:10:56,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270054384] [2022-12-13 07:10:56,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:10:56,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 07:10:56,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:10:56,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 07:10:56,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=467, Unknown=1, NotChecked=44, Total=600 [2022-12-13 07:10:56,969 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:10:56,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 748 places, 2225 transitions, 294107 flow. Second operand has 25 states, 25 states have (on average 1.68) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:10:56,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:10:56,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:10:56,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:11:07,118 INFO L130 PetriNetUnfolder]: 2426/4323 cut-off events. [2022-12-13 07:11:07,118 INFO L131 PetriNetUnfolder]: For 249/249 co-relation queries the response was YES. [2022-12-13 07:11:07,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289893 conditions, 4323 events. 2426/4323 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 29631 event pairs, 1 based on Foata normal form. 0/3523 useless extension candidates. Maximal degree in co-relation 257794. Up to 4324 conditions per place. [2022-12-13 07:11:07,198 INFO L137 encePairwiseOnDemand]: 7/19 looper letters, 1566 selfloop transitions, 683 changer transitions 2/2251 dead transitions. [2022-12-13 07:11:07,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 763 places, 2251 transitions, 302047 flow [2022-12-13 07:11:07,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 07:11:07,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 07:11:07,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 84 transitions. [2022-12-13 07:11:07,199 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27631578947368424 [2022-12-13 07:11:07,200 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 740 predicate places. [2022-12-13 07:11:07,200 INFO L82 GeneralOperation]: Start removeDead. Operand has 763 places, 2251 transitions, 302047 flow [2022-12-13 07:11:07,352 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 763 places, 2249 transitions, 301779 flow [2022-12-13 07:11:07,414 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:11:07,414 INFO L89 Accepts]: Start accepts. Operand has 763 places, 2249 transitions, 301779 flow [2022-12-13 07:11:07,484 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:11:07,484 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:11:07,484 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 763 places, 2249 transitions, 301779 flow [2022-12-13 07:11:07,582 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 763 places, 2249 transitions, 301779 flow [2022-12-13 07:11:07,582 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:11:07,586 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:11:07,586 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-13 07:11:07,586 INFO L495 AbstractCegarLoop]: Abstraction has has 763 places, 2249 transitions, 301779 flow [2022-12-13 07:11:07,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:11:07,586 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:11:07,586 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:11:07,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-12-13 07:11:07,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:11:07,787 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:11:07,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:11:07,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1153683108, now seen corresponding path program 40 times [2022-12-13 07:11:07,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:11:07,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23968804] [2022-12-13 07:11:07,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:11:07,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:11:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:11:08,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:11:08,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:11:08,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23968804] [2022-12-13 07:11:08,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23968804] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:11:08,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291747231] [2022-12-13 07:11:08,627 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:11:08,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:11:08,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:11:08,628 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:11:08,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-12-13 07:11:08,906 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:11:08,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:11:08,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 07:11:08,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:11:09,126 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 07:11:09,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2022-12-13 07:11:09,136 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 07:11:09,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2022-12-13 07:11:09,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:11:09,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:11:09,382 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-13 07:11:09,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 72 [2022-12-13 07:11:09,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:11:09,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291747231] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:11:09,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:11:09,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 23 [2022-12-13 07:11:09,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736845881] [2022-12-13 07:11:09,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:11:09,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 07:11:09,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:11:09,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 07:11:09,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2022-12-13 07:11:09,426 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:11:09,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 763 places, 2249 transitions, 301779 flow. Second operand has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:11:09,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:11:09,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:11:09,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:11:17,914 INFO L130 PetriNetUnfolder]: 2399/4270 cut-off events. [2022-12-13 07:11:17,914 INFO L131 PetriNetUnfolder]: For 231/231 co-relation queries the response was YES. [2022-12-13 07:11:17,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290607 conditions, 4270 events. 2399/4270 cut-off events. For 231/231 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 29105 event pairs, 1 based on Foata normal form. 7/3499 useless extension candidates. Maximal degree in co-relation 260213. Up to 4271 conditions per place. [2022-12-13 07:11:17,997 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 1433 selfloop transitions, 791 changer transitions 7/2231 dead transitions. [2022-12-13 07:11:17,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 779 places, 2231 transitions, 303817 flow [2022-12-13 07:11:17,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 07:11:17,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 07:11:17,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 100 transitions. [2022-12-13 07:11:17,998 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29239766081871343 [2022-12-13 07:11:17,998 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 756 predicate places. [2022-12-13 07:11:17,998 INFO L82 GeneralOperation]: Start removeDead. Operand has 779 places, 2231 transitions, 303817 flow [2022-12-13 07:11:18,166 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 777 places, 2224 transitions, 302859 flow [2022-12-13 07:11:18,285 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:11:18,285 INFO L89 Accepts]: Start accepts. Operand has 777 places, 2224 transitions, 302859 flow [2022-12-13 07:11:18,330 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:11:18,330 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:11:18,330 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 777 places, 2224 transitions, 302859 flow [2022-12-13 07:11:18,441 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 777 places, 2224 transitions, 302859 flow [2022-12-13 07:11:18,441 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:11:18,444 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:11:18,444 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-13 07:11:18,444 INFO L495 AbstractCegarLoop]: Abstraction has has 777 places, 2224 transitions, 302859 flow [2022-12-13 07:11:18,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:11:18,445 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:11:18,445 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:11:18,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-12-13 07:11:18,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-12-13 07:11:18,646 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:11:18,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:11:18,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1546971100, now seen corresponding path program 41 times [2022-12-13 07:11:18,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:11:18,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092697013] [2022-12-13 07:11:18,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:11:18,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:11:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:11:19,144 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 07:11:19,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:11:19,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092697013] [2022-12-13 07:11:19,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092697013] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:11:19,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897736752] [2022-12-13 07:11:19,144 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:11:19,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:11:19,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:11:19,146 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:11:19,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-12-13 07:11:19,421 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:11:19,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:11:19,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 07:11:19,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:11:19,599 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 07:11:19,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:11:19,759 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-13 07:11:19,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 72 [2022-12-13 07:11:19,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:11:19,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897736752] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:11:19,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:11:19,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2022-12-13 07:11:19,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637078851] [2022-12-13 07:11:19,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:11:19,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 07:11:19,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:11:19,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 07:11:19,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-12-13 07:11:19,798 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:11:19,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 777 places, 2224 transitions, 302859 flow. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:11:19,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:11:19,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:11:19,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:11:27,715 INFO L130 PetriNetUnfolder]: 2416/4299 cut-off events. [2022-12-13 07:11:27,715 INFO L131 PetriNetUnfolder]: For 232/232 co-relation queries the response was YES. [2022-12-13 07:11:27,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296877 conditions, 4299 events. 2416/4299 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 29323 event pairs, 2 based on Foata normal form. 0/3517 useless extension candidates. Maximal degree in co-relation 266316. Up to 4300 conditions per place. [2022-12-13 07:11:27,795 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 1351 selfloop transitions, 901 changer transitions 0/2252 dead transitions. [2022-12-13 07:11:27,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 792 places, 2252 transitions, 311171 flow [2022-12-13 07:11:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 07:11:27,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 07:11:27,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 83 transitions. [2022-12-13 07:11:27,796 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2730263157894737 [2022-12-13 07:11:27,796 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 769 predicate places. [2022-12-13 07:11:27,796 INFO L82 GeneralOperation]: Start removeDead. Operand has 792 places, 2252 transitions, 311171 flow [2022-12-13 07:11:27,971 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 792 places, 2252 transitions, 311171 flow [2022-12-13 07:11:28,155 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:11:28,155 INFO L89 Accepts]: Start accepts. Operand has 792 places, 2252 transitions, 311171 flow [2022-12-13 07:11:28,203 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:11:28,204 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:11:28,204 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 792 places, 2252 transitions, 311171 flow [2022-12-13 07:11:28,318 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 792 places, 2252 transitions, 311171 flow [2022-12-13 07:11:28,318 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:11:28,321 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:11:28,322 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-13 07:11:28,322 INFO L495 AbstractCegarLoop]: Abstraction has has 792 places, 2252 transitions, 311171 flow [2022-12-13 07:11:28,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:11:28,322 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:11:28,322 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:11:28,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-12-13 07:11:28,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-12-13 07:11:28,522 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:11:28,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:11:28,523 INFO L85 PathProgramCache]: Analyzing trace with hash -585481316, now seen corresponding path program 42 times [2022-12-13 07:11:28,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:11:28,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12764871] [2022-12-13 07:11:28,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:11:28,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:11:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:11:28,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:11:28,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:11:28,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12764871] [2022-12-13 07:11:28,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12764871] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:11:28,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145053510] [2022-12-13 07:11:28,896 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:11:28,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:11:28,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:11:28,900 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:11:28,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-12-13 07:11:29,193 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 07:11:29,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:11:29,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 07:11:29,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:11:29,304 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 07:11:29,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:11:29,432 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-13 07:11:29,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 72 [2022-12-13 07:11:29,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:11:29,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145053510] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:11:29,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:11:29,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-12-13 07:11:29,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707849471] [2022-12-13 07:11:29,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:11:29,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 07:11:29,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:11:29,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 07:11:29,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-12-13 07:11:29,472 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:11:29,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 792 places, 2252 transitions, 311171 flow. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:11:29,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:11:29,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:11:29,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:11:37,667 INFO L130 PetriNetUnfolder]: 2543/4504 cut-off events. [2022-12-13 07:11:37,668 INFO L131 PetriNetUnfolder]: For 227/227 co-relation queries the response was YES. [2022-12-13 07:11:37,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315521 conditions, 4504 events. 2543/4504 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 30954 event pairs, 1 based on Foata normal form. 0/3681 useless extension candidates. Maximal degree in co-relation 285645. Up to 4505 conditions per place. [2022-12-13 07:11:37,839 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 1433 selfloop transitions, 916 changer transitions 0/2349 dead transitions. [2022-12-13 07:11:37,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 802 places, 2349 transitions, 329243 flow [2022-12-13 07:11:37,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 07:11:37,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 07:11:37,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 71 transitions. [2022-12-13 07:11:37,840 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2874493927125506 [2022-12-13 07:11:37,841 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 779 predicate places. [2022-12-13 07:11:37,841 INFO L82 GeneralOperation]: Start removeDead. Operand has 802 places, 2349 transitions, 329243 flow [2022-12-13 07:11:38,013 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 802 places, 2349 transitions, 329243 flow [2022-12-13 07:11:38,079 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:11:38,079 INFO L89 Accepts]: Start accepts. Operand has 802 places, 2349 transitions, 329243 flow [2022-12-13 07:11:38,162 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:11:38,163 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:11:38,163 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 802 places, 2349 transitions, 329243 flow [2022-12-13 07:11:38,285 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 802 places, 2349 transitions, 329243 flow [2022-12-13 07:11:38,285 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:11:38,289 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:11:38,289 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 210 [2022-12-13 07:11:38,289 INFO L495 AbstractCegarLoop]: Abstraction has has 802 places, 2349 transitions, 329243 flow [2022-12-13 07:11:38,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:11:38,289 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:11:38,289 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:11:38,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-12-13 07:11:38,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:11:38,490 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:11:38,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:11:38,490 INFO L85 PathProgramCache]: Analyzing trace with hash -184755554, now seen corresponding path program 43 times [2022-12-13 07:11:38,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:11:38,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841046491] [2022-12-13 07:11:38,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:11:38,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:11:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:11:38,968 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 07:11:38,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:11:38,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841046491] [2022-12-13 07:11:38,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841046491] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:11:38,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565910902] [2022-12-13 07:11:38,969 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:11:38,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:11:38,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:11:38,970 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:11:38,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-12-13 07:11:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:11:39,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-13 07:11:39,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:11:39,421 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 07:11:39,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2022-12-13 07:11:39,447 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 07:11:39,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:11:39,777 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-13 07:11:39,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-13 07:11:39,791 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 07:11:39,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 07:11:39,825 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 07:11:39,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565910902] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:11:39,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:11:39,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 22 [2022-12-13 07:11:39,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871372596] [2022-12-13 07:11:39,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:11:39,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 07:11:39,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:11:39,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 07:11:39,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2022-12-13 07:11:39,826 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:11:39,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 802 places, 2349 transitions, 329243 flow. Second operand has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:11:39,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:11:39,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:11:39,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:11:47,652 INFO L130 PetriNetUnfolder]: 2561/4533 cut-off events. [2022-12-13 07:11:47,652 INFO L131 PetriNetUnfolder]: For 227/227 co-relation queries the response was YES. [2022-12-13 07:11:47,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322082 conditions, 4533 events. 2561/4533 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 31110 event pairs, 3 based on Foata normal form. 0/3709 useless extension candidates. Maximal degree in co-relation 292494. Up to 4534 conditions per place. [2022-12-13 07:11:47,732 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 1683 selfloop transitions, 683 changer transitions 0/2366 dead transitions. [2022-12-13 07:11:47,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 816 places, 2366 transitions, 336349 flow [2022-12-13 07:11:47,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 07:11:47,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 07:11:47,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 73 transitions. [2022-12-13 07:11:47,733 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24013157894736842 [2022-12-13 07:11:47,733 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 793 predicate places. [2022-12-13 07:11:47,734 INFO L82 GeneralOperation]: Start removeDead. Operand has 816 places, 2366 transitions, 336349 flow [2022-12-13 07:11:47,891 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 816 places, 2366 transitions, 336349 flow [2022-12-13 07:11:47,956 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:11:47,956 INFO L89 Accepts]: Start accepts. Operand has 816 places, 2366 transitions, 336349 flow [2022-12-13 07:11:48,046 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:11:48,046 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:11:48,046 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 816 places, 2366 transitions, 336349 flow [2022-12-13 07:11:48,150 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 816 places, 2366 transitions, 336349 flow [2022-12-13 07:11:48,150 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:11:48,153 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:11:48,154 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-13 07:11:48,154 INFO L495 AbstractCegarLoop]: Abstraction has has 816 places, 2366 transitions, 336349 flow [2022-12-13 07:11:48,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:11:48,154 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:11:48,154 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:11:48,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-12-13 07:11:48,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-12-13 07:11:48,355 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:11:48,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:11:48,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1773230691, now seen corresponding path program 5 times [2022-12-13 07:11:48,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:11:48,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928585833] [2022-12-13 07:11:48,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:11:48,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:11:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:11:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:11:49,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:11:49,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928585833] [2022-12-13 07:11:49,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928585833] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:11:49,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825615539] [2022-12-13 07:11:49,106 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:11:49,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:11:49,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:11:49,107 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:11:49,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-12-13 07:11:49,396 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 07:11:49,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:11:49,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-13 07:11:49,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:11:49,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:11:49,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2022-12-13 07:11:49,589 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:11:49,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 41 [2022-12-13 07:11:49,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:11:49,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:11:49,775 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4769 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4769))) (let ((.cse1 (select .cse0 ~o_2~0.base))) (or (= (select (select .cse0 c_~o_0~0.base) c_~o_0~0.offset) (select .cse1 c_~o_2~0.offset)) (not (= (select .cse1 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) |c_thread1Thread1of1ForFork0_#t~mem1#1|)))))) is different from false [2022-12-13 07:11:49,822 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-12-13 07:11:49,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 131 [2022-12-13 07:11:49,840 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:11:49,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 90 [2022-12-13 07:11:50,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:11:50,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825615539] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:11:50,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:11:50,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 24 [2022-12-13 07:11:50,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554097140] [2022-12-13 07:11:50,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:11:50,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 07:11:50,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:11:50,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 07:11:50,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=464, Unknown=1, NotChecked=44, Total=600 [2022-12-13 07:11:50,174 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:11:50,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 816 places, 2366 transitions, 336349 flow. Second operand has 25 states, 25 states have (on average 1.68) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:11:50,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:11:50,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:11:50,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:11:57,889 INFO L130 PetriNetUnfolder]: 2548/4498 cut-off events. [2022-12-13 07:11:57,889 INFO L131 PetriNetUnfolder]: For 224/224 co-relation queries the response was YES. [2022-12-13 07:11:57,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324092 conditions, 4498 events. 2548/4498 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 30804 event pairs, 0 based on Foata normal form. 6/3684 useless extension candidates. Maximal degree in co-relation 294669. Up to 4499 conditions per place. [2022-12-13 07:11:57,974 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 1909 selfloop transitions, 427 changer transitions 6/2342 dead transitions. [2022-12-13 07:11:57,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 823 places, 2342 transitions, 337613 flow [2022-12-13 07:11:57,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 07:11:57,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 07:11:57,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-12-13 07:11:57,975 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3742690058479532 [2022-12-13 07:11:57,975 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 800 predicate places. [2022-12-13 07:11:57,976 INFO L82 GeneralOperation]: Start removeDead. Operand has 823 places, 2342 transitions, 337613 flow [2022-12-13 07:11:58,158 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 822 places, 2336 transitions, 336749 flow [2022-12-13 07:11:58,228 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:11:58,228 INFO L89 Accepts]: Start accepts. Operand has 822 places, 2336 transitions, 336749 flow [2022-12-13 07:11:58,432 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:11:58,433 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:11:58,433 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 822 places, 2336 transitions, 336749 flow [2022-12-13 07:11:58,537 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 822 places, 2336 transitions, 336749 flow [2022-12-13 07:11:58,537 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:11:58,540 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:11:58,540 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 312 [2022-12-13 07:11:58,540 INFO L495 AbstractCegarLoop]: Abstraction has has 822 places, 2336 transitions, 336749 flow [2022-12-13 07:11:58,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:11:58,540 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:11:58,540 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:11:58,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-12-13 07:11:58,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:11:58,742 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:11:58,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:11:58,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1238471734, now seen corresponding path program 44 times [2022-12-13 07:11:58,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:11:58,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053721235] [2022-12-13 07:11:58,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:11:58,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:11:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:11:59,330 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 07:11:59,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:11:59,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053721235] [2022-12-13 07:11:59,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053721235] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:11:59,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45306171] [2022-12-13 07:11:59,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:11:59,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:11:59,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:11:59,332 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:11:59,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-12-13 07:11:59,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:11:59,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:11:59,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 07:11:59,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:11:59,751 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:11:59,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 51 [2022-12-13 07:11:59,827 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 07:11:59,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:11:59,993 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-13 07:11:59,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 107 [2022-12-13 07:12:00,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:12:00,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45306171] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:12:00,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:12:00,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 22 [2022-12-13 07:12:00,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119634250] [2022-12-13 07:12:00,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:12:00,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 07:12:00,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:12:00,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 07:12:00,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2022-12-13 07:12:00,075 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:12:00,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 822 places, 2336 transitions, 336749 flow. Second operand has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:12:00,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:12:00,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:12:00,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:12:09,100 INFO L130 PetriNetUnfolder]: 2623/4623 cut-off events. [2022-12-13 07:12:09,100 INFO L131 PetriNetUnfolder]: For 237/237 co-relation queries the response was YES. [2022-12-13 07:12:09,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337722 conditions, 4623 events. 2623/4623 cut-off events. For 237/237 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 31769 event pairs, 3 based on Foata normal form. 0/3785 useless extension candidates. Maximal degree in co-relation 306718. Up to 4624 conditions per place. [2022-12-13 07:12:09,188 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 1617 selfloop transitions, 780 changer transitions 0/2397 dead transitions. [2022-12-13 07:12:09,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 842 places, 2397 transitions, 350339 flow [2022-12-13 07:12:09,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 07:12:09,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 07:12:09,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 101 transitions. [2022-12-13 07:12:09,189 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2531328320802005 [2022-12-13 07:12:09,189 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 819 predicate places. [2022-12-13 07:12:09,189 INFO L82 GeneralOperation]: Start removeDead. Operand has 842 places, 2397 transitions, 350339 flow [2022-12-13 07:12:09,372 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 842 places, 2397 transitions, 350339 flow [2022-12-13 07:12:09,571 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:12:09,571 INFO L89 Accepts]: Start accepts. Operand has 842 places, 2397 transitions, 350339 flow [2022-12-13 07:12:09,626 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:12:09,626 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:12:09,626 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 842 places, 2397 transitions, 350339 flow [2022-12-13 07:12:09,743 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 842 places, 2397 transitions, 350339 flow [2022-12-13 07:12:09,743 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:12:09,747 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:12:09,747 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-13 07:12:09,747 INFO L495 AbstractCegarLoop]: Abstraction has has 842 places, 2397 transitions, 350339 flow [2022-12-13 07:12:09,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:12:09,747 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:12:09,747 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:12:09,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-12-13 07:12:09,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:12:09,948 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:12:09,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:12:09,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1883517014, now seen corresponding path program 45 times [2022-12-13 07:12:09,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:12:09,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514492628] [2022-12-13 07:12:09,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:12:09,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:12:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:12:10,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:12:10,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:12:10,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514492628] [2022-12-13 07:12:10,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514492628] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:12:10,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181618588] [2022-12-13 07:12:10,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:12:10,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:12:10,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:12:10,420 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:12:10,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-12-13 07:12:10,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:12:10,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:12:10,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 07:12:10,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:12:10,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:12:10,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:12:11,066 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-13 07:12:11,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-13 07:12:11,081 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 07:12:11,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 07:12:11,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:12:11,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181618588] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:12:11,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:12:11,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2022-12-13 07:12:11,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245162220] [2022-12-13 07:12:11,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:12:11,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 07:12:11,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:12:11,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 07:12:11,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2022-12-13 07:12:11,106 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:12:11,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 842 places, 2397 transitions, 350339 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 07:12:11,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:12:11,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:12:11,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:12:21,138 INFO L130 PetriNetUnfolder]: 2616/4616 cut-off events. [2022-12-13 07:12:21,138 INFO L131 PetriNetUnfolder]: For 231/231 co-relation queries the response was YES. [2022-12-13 07:12:21,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341828 conditions, 4616 events. 2616/4616 cut-off events. For 231/231 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 31695 event pairs, 3 based on Foata normal form. 7/3785 useless extension candidates. Maximal degree in co-relation 310697. Up to 4617 conditions per place. [2022-12-13 07:12:21,228 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 1713 selfloop transitions, 668 changer transitions 14/2395 dead transitions. [2022-12-13 07:12:21,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 852 places, 2395 transitions, 354837 flow [2022-12-13 07:12:21,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:12:21,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:12:21,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2022-12-13 07:12:21,229 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2679425837320574 [2022-12-13 07:12:21,229 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 829 predicate places. [2022-12-13 07:12:21,229 INFO L82 GeneralOperation]: Start removeDead. Operand has 852 places, 2395 transitions, 354837 flow [2022-12-13 07:12:21,417 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 850 places, 2381 transitions, 352753 flow [2022-12-13 07:12:21,487 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:12:21,488 INFO L89 Accepts]: Start accepts. Operand has 850 places, 2381 transitions, 352753 flow [2022-12-13 07:12:21,605 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:12:21,605 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:12:21,605 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 850 places, 2381 transitions, 352753 flow [2022-12-13 07:12:21,862 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 850 places, 2381 transitions, 352753 flow [2022-12-13 07:12:21,863 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:12:21,865 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:12:21,866 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 379 [2022-12-13 07:12:21,866 INFO L495 AbstractCegarLoop]: Abstraction has has 850 places, 2381 transitions, 352753 flow [2022-12-13 07:12:21,866 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 07:12:21,866 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:12:21,866 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:12:21,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2022-12-13 07:12:22,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable72 [2022-12-13 07:12:22,067 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:12:22,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:12:22,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1903407586, now seen corresponding path program 46 times [2022-12-13 07:12:22,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:12:22,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524579948] [2022-12-13 07:12:22,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:12:22,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:12:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:12:22,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:12:22,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:12:22,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524579948] [2022-12-13 07:12:22,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524579948] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:12:22,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794486345] [2022-12-13 07:12:22,802 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:12:22,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:12:22,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:12:22,803 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:12:22,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-12-13 07:12:23,106 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:12:23,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:12:23,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-13 07:12:23,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:12:23,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:12:23,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:12:23,294 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 07:12:23,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2022-12-13 07:12:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:12:23,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:12:23,656 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:12:23,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 134 [2022-12-13 07:12:23,666 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:12:23,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2022-12-13 07:12:23,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:12:23,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794486345] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:12:23,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:12:23,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-12-13 07:12:23,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373162834] [2022-12-13 07:12:23,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:12:23,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-13 07:12:23,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:12:23,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 07:12:23,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=697, Unknown=1, NotChecked=0, Total=812 [2022-12-13 07:12:23,922 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:12:23,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 850 places, 2381 transitions, 352753 flow. Second operand has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:12:23,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:12:23,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:12:23,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:12:33,789 INFO L130 PetriNetUnfolder]: 2614/4616 cut-off events. [2022-12-13 07:12:33,790 INFO L131 PetriNetUnfolder]: For 231/231 co-relation queries the response was YES. [2022-12-13 07:12:33,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346445 conditions, 4616 events. 2614/4616 cut-off events. For 231/231 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 31726 event pairs, 0 based on Foata normal form. 8/3789 useless extension candidates. Maximal degree in co-relation 314895. Up to 4617 conditions per place. [2022-12-13 07:12:33,878 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 1875 selfloop transitions, 515 changer transitions 27/2417 dead transitions. [2022-12-13 07:12:33,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 859 places, 2417 transitions, 362930 flow [2022-12-13 07:12:33,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 07:12:33,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 07:12:33,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2022-12-13 07:12:33,880 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3473684210526316 [2022-12-13 07:12:33,880 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 836 predicate places. [2022-12-13 07:12:33,880 INFO L82 GeneralOperation]: Start removeDead. Operand has 859 places, 2417 transitions, 362930 flow [2022-12-13 07:12:34,105 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 857 places, 2390 transitions, 358859 flow [2022-12-13 07:12:34,175 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:12:34,175 INFO L89 Accepts]: Start accepts. Operand has 857 places, 2390 transitions, 358859 flow [2022-12-13 07:12:34,266 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:12:34,266 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:12:34,266 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 857 places, 2390 transitions, 358859 flow [2022-12-13 07:12:34,389 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 857 places, 2390 transitions, 358859 flow [2022-12-13 07:12:34,389 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:12:34,392 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:12:34,393 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 218 [2022-12-13 07:12:34,393 INFO L495 AbstractCegarLoop]: Abstraction has has 857 places, 2390 transitions, 358859 flow [2022-12-13 07:12:34,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:12:34,393 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:12:34,393 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:12:34,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2022-12-13 07:12:34,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:12:34,594 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:12:34,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:12:34,594 INFO L85 PathProgramCache]: Analyzing trace with hash -649174038, now seen corresponding path program 47 times [2022-12-13 07:12:34,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:12:34,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442007469] [2022-12-13 07:12:34,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:12:34,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:12:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:12:35,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:12:35,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:12:35,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442007469] [2022-12-13 07:12:35,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442007469] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:12:35,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930606498] [2022-12-13 07:12:35,084 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:12:35,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:12:35,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:12:35,086 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:12:35,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-12-13 07:12:35,384 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:12:35,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:12:35,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 07:12:35,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:12:35,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:12:35,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 07:12:35,607 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 07:12:35,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 32 [2022-12-13 07:12:35,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:12:35,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:12:36,048 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:12:36,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 148 [2022-12-13 07:12:36,067 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:12:36,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 84 [2022-12-13 07:12:36,470 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 07:12:36,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:12:36,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930606498] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:12:36,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:12:36,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 24 [2022-12-13 07:12:36,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229542032] [2022-12-13 07:12:36,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:12:36,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 07:12:36,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:12:36,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 07:12:36,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=487, Unknown=21, NotChecked=0, Total=600 [2022-12-13 07:12:36,513 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:12:36,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 857 places, 2390 transitions, 358859 flow. Second operand has 25 states, 25 states have (on average 1.76) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:12:36,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:12:36,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:12:36,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:12:44,654 INFO L130 PetriNetUnfolder]: 2591/4564 cut-off events. [2022-12-13 07:12:44,654 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2022-12-13 07:12:44,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347102 conditions, 4564 events. 2591/4564 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 31221 event pairs, 0 based on Foata normal form. 7/3745 useless extension candidates. Maximal degree in co-relation 316963. Up to 4565 conditions per place. [2022-12-13 07:12:44,744 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 1702 selfloop transitions, 672 changer transitions 14/2388 dead transitions. [2022-12-13 07:12:44,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 867 places, 2388 transitions, 363335 flow [2022-12-13 07:12:44,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:12:44,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:12:44,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2022-12-13 07:12:44,745 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2966507177033493 [2022-12-13 07:12:44,746 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 844 predicate places. [2022-12-13 07:12:44,746 INFO L82 GeneralOperation]: Start removeDead. Operand has 867 places, 2388 transitions, 363335 flow [2022-12-13 07:12:44,922 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 863 places, 2374 transitions, 361195 flow [2022-12-13 07:12:44,994 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:12:44,994 INFO L89 Accepts]: Start accepts. Operand has 863 places, 2374 transitions, 361195 flow [2022-12-13 07:12:45,093 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:12:45,093 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:12:45,093 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 863 places, 2374 transitions, 361195 flow [2022-12-13 07:12:45,219 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 863 places, 2374 transitions, 361195 flow [2022-12-13 07:12:45,219 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:12:45,222 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:12:45,223 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 229 [2022-12-13 07:12:45,223 INFO L495 AbstractCegarLoop]: Abstraction has has 863 places, 2374 transitions, 361195 flow [2022-12-13 07:12:45,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.76) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:12:45,223 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:12:45,223 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:12:45,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2022-12-13 07:12:45,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:12:45,424 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:12:45,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:12:45,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1409557534, now seen corresponding path program 48 times [2022-12-13 07:12:45,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:12:45,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002530073] [2022-12-13 07:12:45,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:12:45,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:12:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:12:46,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:12:46,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:12:46,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002530073] [2022-12-13 07:12:46,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002530073] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:12:46,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147850359] [2022-12-13 07:12:46,009 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:12:46,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:12:46,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:12:46,010 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:12:46,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-12-13 07:12:46,397 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 07:12:46,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:12:46,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 07:12:46,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:12:46,483 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:12:46,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 51 [2022-12-13 07:12:46,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:12:46,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:12:46,711 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-13 07:12:46,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-13 07:12:46,725 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 07:12:46,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 07:12:46,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:12:46,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147850359] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:12:46,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:12:46,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2022-12-13 07:12:46,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129545404] [2022-12-13 07:12:46,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:12:46,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 07:12:46,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:12:46,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 07:12:46,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-12-13 07:12:46,754 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:12:46,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 863 places, 2374 transitions, 361195 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 07:12:46,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:12:46,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:12:46,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:12:55,277 INFO L130 PetriNetUnfolder]: 2569/4508 cut-off events. [2022-12-13 07:12:55,278 INFO L131 PetriNetUnfolder]: For 202/202 co-relation queries the response was YES. [2022-12-13 07:12:55,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347345 conditions, 4508 events. 2569/4508 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 30651 event pairs, 0 based on Foata normal form. 4/3697 useless extension candidates. Maximal degree in co-relation 319439. Up to 4509 conditions per place. [2022-12-13 07:12:55,375 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 1684 selfloop transitions, 668 changer transitions 4/2356 dead transitions. [2022-12-13 07:12:55,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 872 places, 2356 transitions, 363156 flow [2022-12-13 07:12:55,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 07:12:55,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 07:12:55,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-12-13 07:12:55,376 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26720647773279355 [2022-12-13 07:12:55,376 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 849 predicate places. [2022-12-13 07:12:55,377 INFO L82 GeneralOperation]: Start removeDead. Operand has 872 places, 2356 transitions, 363156 flow [2022-12-13 07:12:55,731 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 871 places, 2352 transitions, 362537 flow [2022-12-13 07:12:55,801 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:12:55,801 INFO L89 Accepts]: Start accepts. Operand has 871 places, 2352 transitions, 362537 flow [2022-12-13 07:12:55,857 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:12:55,858 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:12:55,858 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 871 places, 2352 transitions, 362537 flow [2022-12-13 07:12:55,994 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 871 places, 2352 transitions, 362537 flow [2022-12-13 07:12:55,994 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:12:55,997 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:12:55,997 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-13 07:12:55,998 INFO L495 AbstractCegarLoop]: Abstraction has has 871 places, 2352 transitions, 362537 flow [2022-12-13 07:12:55,998 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 07:12:55,998 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:12:55,998 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:12:56,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2022-12-13 07:12:56,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:12:56,199 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:12:56,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:12:56,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1228957398, now seen corresponding path program 49 times [2022-12-13 07:12:56,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:12:56,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641263940] [2022-12-13 07:12:56,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:12:56,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:12:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:12:56,641 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 07:12:56,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:12:56,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641263940] [2022-12-13 07:12:56,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641263940] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:12:56,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041343010] [2022-12-13 07:12:56,642 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:12:56,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:12:56,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:12:56,643 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:12:56,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-12-13 07:12:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:12:56,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 07:12:56,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:12:57,092 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 07:12:57,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:12:57,241 INFO L321 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2022-12-13 07:12:57,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 107 [2022-12-13 07:12:57,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:12:57,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041343010] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:12:57,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:12:57,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-12-13 07:12:57,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119595890] [2022-12-13 07:12:57,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:12:57,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 07:12:57,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:12:57,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 07:12:57,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-12-13 07:12:57,325 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:12:57,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 871 places, 2352 transitions, 362537 flow. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:12:57,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:12:57,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:12:57,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:13:07,279 INFO L130 PetriNetUnfolder]: 2570/4503 cut-off events. [2022-12-13 07:13:07,279 INFO L131 PetriNetUnfolder]: For 171/171 co-relation queries the response was YES. [2022-12-13 07:13:07,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351457 conditions, 4503 events. 2570/4503 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 30507 event pairs, 0 based on Foata normal form. 0/3694 useless extension candidates. Maximal degree in co-relation 324913. Up to 4504 conditions per place. [2022-12-13 07:13:07,450 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 1587 selfloop transitions, 776 changer transitions 0/2363 dead transitions. [2022-12-13 07:13:07,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 884 places, 2363 transitions, 368945 flow [2022-12-13 07:13:07,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 07:13:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 07:13:07,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 75 transitions. [2022-12-13 07:13:07,452 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24671052631578946 [2022-12-13 07:13:07,452 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 861 predicate places. [2022-12-13 07:13:07,452 INFO L82 GeneralOperation]: Start removeDead. Operand has 884 places, 2363 transitions, 368945 flow [2022-12-13 07:13:07,626 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 884 places, 2363 transitions, 368945 flow [2022-12-13 07:13:07,759 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:13:07,760 INFO L89 Accepts]: Start accepts. Operand has 884 places, 2363 transitions, 368945 flow [2022-12-13 07:13:07,825 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:13:07,825 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:13:07,825 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 884 places, 2363 transitions, 368945 flow [2022-12-13 07:13:07,937 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 884 places, 2363 transitions, 368945 flow [2022-12-13 07:13:07,937 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:13:07,940 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:13:07,941 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-13 07:13:07,941 INFO L495 AbstractCegarLoop]: Abstraction has has 884 places, 2363 transitions, 368945 flow [2022-12-13 07:13:07,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:13:07,941 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:13:07,941 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:13:07,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2022-12-13 07:13:08,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2022-12-13 07:13:08,143 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:13:08,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:13:08,143 INFO L85 PathProgramCache]: Analyzing trace with hash -161661790, now seen corresponding path program 50 times [2022-12-13 07:13:08,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:13:08,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92076345] [2022-12-13 07:13:08,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:13:08,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:13:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:13:08,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:13:08,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:13:08,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92076345] [2022-12-13 07:13:08,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92076345] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:13:08,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760383212] [2022-12-13 07:13:08,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:13:08,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:13:08,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:13:08,823 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:13:08,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-12-13 07:13:09,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:13:09,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:13:09,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-13 07:13:09,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:13:09,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:13:09,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 07:13:09,333 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:13:09,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 41 [2022-12-13 07:13:09,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:13:09,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:13:09,557 WARN L837 $PredicateComparison]: unable to prove that (and (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_5276 (Array Int Int)) (~o_2~0.base Int)) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5276))) (= (select (select .cse0 c_~o_0~0.base) c_~o_0~0.offset) (select (select .cse0 ~o_2~0.base) c_~o_2~0.offset)))))) (forall ((v_ArrVal_5276 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5276))) (let ((.cse1 (select .cse2 ~o_2~0.base))) (or (= (select .cse1 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (not (= (select (select .cse2 c_~o_0~0.base) c_~o_0~0.offset) (select .cse1 c_~o_2~0.offset)))))))) is different from false [2022-12-13 07:13:09,587 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:13:09,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 148 [2022-12-13 07:13:09,604 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:13:09,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 84 [2022-12-13 07:13:10,024 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:13:10,025 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 07:13:10,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:13:10,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760383212] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:13:10,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:13:10,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 26 [2022-12-13 07:13:10,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213274458] [2022-12-13 07:13:10,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:13:10,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 07:13:10,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:13:10,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 07:13:10,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=544, Unknown=1, NotChecked=48, Total=702 [2022-12-13 07:13:10,062 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:13:10,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 884 places, 2363 transitions, 368945 flow. Second operand has 27 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 26 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:13:10,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:13:10,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:13:10,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:13:21,586 INFO L130 PetriNetUnfolder]: 3405/6093 cut-off events. [2022-12-13 07:13:21,586 INFO L131 PetriNetUnfolder]: For 205/205 co-relation queries the response was YES. [2022-12-13 07:13:21,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481583 conditions, 6093 events. 3405/6093 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 44844 event pairs, 0 based on Foata normal form. 7/4944 useless extension candidates. Maximal degree in co-relation 452002. Up to 6094 conditions per place. [2022-12-13 07:13:21,711 INFO L137 encePairwiseOnDemand]: 7/19 looper letters, 1987 selfloop transitions, 1413 changer transitions 7/3407 dead transitions. [2022-12-13 07:13:21,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 905 places, 3407 transitions, 538653 flow [2022-12-13 07:13:21,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 07:13:21,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 07:13:21,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 127 transitions. [2022-12-13 07:13:21,712 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3038277511961722 [2022-12-13 07:13:21,712 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 882 predicate places. [2022-12-13 07:13:21,712 INFO L82 GeneralOperation]: Start removeDead. Operand has 905 places, 3407 transitions, 538653 flow [2022-12-13 07:13:22,132 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 904 places, 3400 transitions, 537541 flow [2022-12-13 07:13:22,252 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:13:22,253 INFO L89 Accepts]: Start accepts. Operand has 904 places, 3400 transitions, 537541 flow [2022-12-13 07:13:22,415 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:13:22,416 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:13:22,416 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 904 places, 3400 transitions, 537541 flow [2022-12-13 07:13:22,598 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 904 places, 3400 transitions, 537541 flow [2022-12-13 07:13:22,598 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:13:22,603 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:13:22,603 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 351 [2022-12-13 07:13:22,603 INFO L495 AbstractCegarLoop]: Abstraction has has 904 places, 3400 transitions, 537541 flow [2022-12-13 07:13:22,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 26 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:13:22,603 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:13:22,604 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:13:22,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Ended with exit code 0 [2022-12-13 07:13:22,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:13:22,805 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:13:22,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:13:22,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1651066786, now seen corresponding path program 51 times [2022-12-13 07:13:22,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:13:22,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510631836] [2022-12-13 07:13:22,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:13:22,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:13:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:13:23,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:13:23,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:13:23,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510631836] [2022-12-13 07:13:23,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510631836] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:13:23,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713951745] [2022-12-13 07:13:23,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:13:23,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:13:23,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:13:23,467 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:13:23,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-12-13 07:13:23,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:13:23,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:13:23,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-13 07:13:23,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:13:23,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:13:23,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 07:13:23,972 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:13:23,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 51 [2022-12-13 07:13:24,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:13:24,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:13:24,233 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5349 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5349))) (let ((.cse0 (select .cse1 ~o_2~0.base))) (or (= (select .cse0 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (not (= (select (select .cse1 c_~o_0~0.base) c_~o_0~0.offset) (select .cse0 c_~o_2~0.offset))))))) (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_5349 (Array Int Int)) (~o_2~0.base Int)) (not (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5349))) (= (select (select .cse2 c_~o_0~0.base) c_~o_0~0.offset) (select (select .cse2 ~o_2~0.base) c_~o_2~0.offset))))))) is different from false [2022-12-13 07:13:24,247 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:13:24,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 66 [2022-12-13 07:13:24,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:13:24,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2022-12-13 07:13:24,300 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:13:24,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 148 [2022-12-13 07:13:24,316 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:13:24,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 84 [2022-12-13 07:13:24,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:13:24,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713951745] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:13:24,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:13:24,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 25 [2022-12-13 07:13:24,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847020486] [2022-12-13 07:13:24,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:13:24,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 07:13:24,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:13:24,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 07:13:24,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=508, Unknown=1, NotChecked=46, Total=650 [2022-12-13 07:13:24,648 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:13:24,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 904 places, 3400 transitions, 537541 flow. Second operand has 26 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:13:24,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:13:24,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:13:24,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:13:45,602 INFO L130 PetriNetUnfolder]: 3399/6090 cut-off events. [2022-12-13 07:13:45,602 INFO L131 PetriNetUnfolder]: For 192/192 co-relation queries the response was YES. [2022-12-13 07:13:45,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487432 conditions, 6090 events. 3399/6090 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 44937 event pairs, 0 based on Foata normal form. 6/4946 useless extension candidates. Maximal degree in co-relation 458923. Up to 6091 conditions per place. [2022-12-13 07:13:45,728 INFO L137 encePairwiseOnDemand]: 7/19 looper letters, 2337 selfloop transitions, 1067 changer transitions 6/3410 dead transitions. [2022-12-13 07:13:45,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 916 places, 3410 transitions, 545935 flow [2022-12-13 07:13:45,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 07:13:45,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 07:13:45,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 89 transitions. [2022-12-13 07:13:45,728 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33458646616541354 [2022-12-13 07:13:45,729 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 893 predicate places. [2022-12-13 07:13:45,729 INFO L82 GeneralOperation]: Start removeDead. Operand has 916 places, 3410 transitions, 545935 flow [2022-12-13 07:13:46,006 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 914 places, 3404 transitions, 544969 flow [2022-12-13 07:13:46,236 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:13:46,237 INFO L89 Accepts]: Start accepts. Operand has 914 places, 3404 transitions, 544969 flow [2022-12-13 07:13:46,335 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:13:46,335 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:13:46,335 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 914 places, 3404 transitions, 544969 flow [2022-12-13 07:13:46,520 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 914 places, 3404 transitions, 544969 flow [2022-12-13 07:13:46,521 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:13:46,525 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:13:46,526 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 290 [2022-12-13 07:13:46,526 INFO L495 AbstractCegarLoop]: Abstraction has has 914 places, 3404 transitions, 544969 flow [2022-12-13 07:13:46,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:13:46,526 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:13:46,526 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:13:46,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2022-12-13 07:13:46,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:13:46,727 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:13:46,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:13:46,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1295135106, now seen corresponding path program 52 times [2022-12-13 07:13:46,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:13:46,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922836233] [2022-12-13 07:13:46,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:13:46,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:13:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:13:47,280 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 07:13:47,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:13:47,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922836233] [2022-12-13 07:13:47,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922836233] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:13:47,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855390933] [2022-12-13 07:13:47,281 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:13:47,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:13:47,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:13:47,282 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:13:47,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-12-13 07:13:47,606 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:13:47,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:13:47,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 07:13:47,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:13:47,699 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:13:47,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 35 [2022-12-13 07:13:47,782 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 07:13:47,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:13:47,943 INFO L321 Elim1Store]: treesize reduction 32, result has 62.4 percent of original size [2022-12-13 07:13:47,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 60 [2022-12-13 07:13:47,961 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 07:13:47,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2022-12-13 07:13:47,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:13:47,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855390933] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:13:47,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:13:47,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 19 [2022-12-13 07:13:47,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822153121] [2022-12-13 07:13:47,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:13:47,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 07:13:47,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:13:47,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 07:13:47,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-12-13 07:13:47,991 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:13:47,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 914 places, 3404 transitions, 544969 flow. Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:13:47,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:13:47,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:13:47,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:14:07,766 INFO L130 PetriNetUnfolder]: 3411/6100 cut-off events. [2022-12-13 07:14:07,766 INFO L131 PetriNetUnfolder]: For 172/172 co-relation queries the response was YES. [2022-12-13 07:14:07,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494325 conditions, 6100 events. 3411/6100 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 44840 event pairs, 0 based on Foata normal form. 0/4954 useless extension candidates. Maximal degree in co-relation 467413. Up to 6101 conditions per place. [2022-12-13 07:14:07,890 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 2208 selfloop transitions, 1208 changer transitions 0/3416 dead transitions. [2022-12-13 07:14:07,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 924 places, 3416 transitions, 553709 flow [2022-12-13 07:14:07,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 07:14:07,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 07:14:07,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-12-13 07:14:07,892 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.242914979757085 [2022-12-13 07:14:07,892 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 901 predicate places. [2022-12-13 07:14:07,892 INFO L82 GeneralOperation]: Start removeDead. Operand has 924 places, 3416 transitions, 553709 flow [2022-12-13 07:14:08,188 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 924 places, 3416 transitions, 553709 flow [2022-12-13 07:14:08,291 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:14:08,291 INFO L89 Accepts]: Start accepts. Operand has 924 places, 3416 transitions, 553709 flow [2022-12-13 07:14:08,563 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:14:08,563 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:14:08,564 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 924 places, 3416 transitions, 553709 flow [2022-12-13 07:14:08,759 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 924 places, 3416 transitions, 553709 flow [2022-12-13 07:14:08,759 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:14:08,764 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:14:08,764 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 473 [2022-12-13 07:14:08,764 INFO L495 AbstractCegarLoop]: Abstraction has has 924 places, 3416 transitions, 553709 flow [2022-12-13 07:14:08,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:14:08,764 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:14:08,764 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:14:08,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2022-12-13 07:14:08,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2022-12-13 07:14:08,965 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:14:08,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:14:08,965 INFO L85 PathProgramCache]: Analyzing trace with hash 76948534, now seen corresponding path program 53 times [2022-12-13 07:14:08,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:14:08,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075083283] [2022-12-13 07:14:08,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:14:08,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:14:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:14:09,551 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 07:14:09,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:14:09,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075083283] [2022-12-13 07:14:09,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075083283] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:14:09,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018257850] [2022-12-13 07:14:09,552 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:14:09,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:14:09,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:14:09,553 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:14:09,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-12-13 07:14:09,873 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 07:14:09,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:14:09,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 07:14:09,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:14:09,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:14:09,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 07:14:10,064 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:14:10,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 35 [2022-12-13 07:14:10,157 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 07:14:10,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:14:10,379 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5494 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5494))) (let ((.cse0 (select .cse1 ~o_2~0.base))) (or (not (= (select .cse0 c_~o_2~0.offset) (select (select .cse1 c_~o_0~0.base) c_~o_0~0.offset))) (= |c_thread1Thread1of1ForFork0_#t~mem1#1| (select .cse0 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))))))) (or (forall ((v_ArrVal_5494 (Array Int Int)) (~o_2~0.base Int)) (not (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5494))) (= (select (select .cse2 ~o_2~0.base) c_~o_2~0.offset) (select (select .cse2 c_~o_0~0.base) c_~o_0~0.offset))))) (< |c_thread1Thread1of1ForFork0_~i~0#1| 4))) is different from false [2022-12-13 07:14:10,390 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:14:10,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 66 [2022-12-13 07:14:10,397 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:14:10,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2022-12-13 07:14:10,443 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:14:10,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 148 [2022-12-13 07:14:10,461 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:14:10,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 84 [2022-12-13 07:14:10,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:14:10,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018257850] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:14:10,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:14:10,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 24 [2022-12-13 07:14:10,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154127847] [2022-12-13 07:14:10,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:14:10,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 07:14:10,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:14:10,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 07:14:10,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=466, Unknown=1, NotChecked=44, Total=600 [2022-12-13 07:14:10,862 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:14:10,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 924 places, 3416 transitions, 553709 flow. Second operand has 25 states, 25 states have (on average 1.8) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:14:10,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:14:10,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:14:10,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:14:12,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:14:13,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:14:16,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:14:18,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:14:38,716 INFO L130 PetriNetUnfolder]: 3405/6084 cut-off events. [2022-12-13 07:14:38,716 INFO L131 PetriNetUnfolder]: For 173/173 co-relation queries the response was YES. [2022-12-13 07:14:38,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499111 conditions, 6084 events. 3405/6084 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 44701 event pairs, 0 based on Foata normal form. 0/4942 useless extension candidates. Maximal degree in co-relation 472527. Up to 6085 conditions per place. [2022-12-13 07:14:38,844 INFO L137 encePairwiseOnDemand]: 7/19 looper letters, 2269 selfloop transitions, 1140 changer transitions 0/3409 dead transitions. [2022-12-13 07:14:38,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 935 places, 3409 transitions, 559387 flow [2022-12-13 07:14:38,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 07:14:38,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 07:14:38,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-12-13 07:14:38,845 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29959514170040485 [2022-12-13 07:14:38,845 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 912 predicate places. [2022-12-13 07:14:38,845 INFO L82 GeneralOperation]: Start removeDead. Operand has 935 places, 3409 transitions, 559387 flow [2022-12-13 07:14:39,227 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 935 places, 3409 transitions, 559387 flow [2022-12-13 07:14:39,329 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:14:39,329 INFO L89 Accepts]: Start accepts. Operand has 935 places, 3409 transitions, 559387 flow [2022-12-13 07:14:39,537 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:14:39,537 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:14:39,537 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 935 places, 3409 transitions, 559387 flow [2022-12-13 07:14:39,803 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 935 places, 3409 transitions, 559387 flow [2022-12-13 07:14:39,803 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:14:39,807 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:14:39,808 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 479 [2022-12-13 07:14:39,808 INFO L495 AbstractCegarLoop]: Abstraction has has 935 places, 3409 transitions, 559387 flow [2022-12-13 07:14:39,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:14:39,808 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:14:39,808 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:14:39,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Forceful destruction successful, exit code 0 [2022-12-13 07:14:40,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:14:40,009 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:14:40,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:14:40,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1698760412, now seen corresponding path program 54 times [2022-12-13 07:14:40,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:14:40,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913171193] [2022-12-13 07:14:40,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:14:40,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:14:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:14:40,956 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 07:14:40,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:14:40,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913171193] [2022-12-13 07:14:40,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913171193] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:14:40,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468411299] [2022-12-13 07:14:40,956 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:14:40,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:14:40,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:14:40,957 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:14:40,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-12-13 07:14:41,345 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 07:14:41,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:14:41,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-13 07:14:41,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:14:41,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:14:41,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:14:41,530 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 07:14:41,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2022-12-13 07:14:41,674 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:14:41,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-12-13 07:14:41,745 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 07:14:41,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:14:42,043 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:14:42,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 134 [2022-12-13 07:14:42,053 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:14:42,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2022-12-13 07:14:42,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:14:42,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468411299] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:14:42,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:14:42,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 26 [2022-12-13 07:14:42,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087694795] [2022-12-13 07:14:42,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:14:42,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 07:14:42,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:14:42,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 07:14:42,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=588, Unknown=4, NotChecked=0, Total=702 [2022-12-13 07:14:42,318 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:14:42,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 935 places, 3409 transitions, 559387 flow. Second operand has 27 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:14:42,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:14:42,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:14:42,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:15:01,920 INFO L130 PetriNetUnfolder]: 3401/6080 cut-off events. [2022-12-13 07:15:01,920 INFO L131 PetriNetUnfolder]: For 177/177 co-relation queries the response was YES. [2022-12-13 07:15:01,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504864 conditions, 6080 events. 3401/6080 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 44753 event pairs, 0 based on Foata normal form. 0/4942 useless extension candidates. Maximal degree in co-relation 477957. Up to 6081 conditions per place. [2022-12-13 07:15:02,087 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 2270 selfloop transitions, 1138 changer transitions 0/3408 dead transitions. [2022-12-13 07:15:02,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 949 places, 3408 transitions, 566039 flow [2022-12-13 07:15:02,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 07:15:02,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 07:15:02,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 85 transitions. [2022-12-13 07:15:02,088 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2982456140350877 [2022-12-13 07:15:02,089 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 926 predicate places. [2022-12-13 07:15:02,089 INFO L82 GeneralOperation]: Start removeDead. Operand has 949 places, 3408 transitions, 566039 flow [2022-12-13 07:15:02,384 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 949 places, 3408 transitions, 566039 flow [2022-12-13 07:15:02,555 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:15:02,555 INFO L89 Accepts]: Start accepts. Operand has 949 places, 3408 transitions, 566039 flow [2022-12-13 07:15:02,657 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:15:02,657 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:15:02,657 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 949 places, 3408 transitions, 566039 flow [2022-12-13 07:15:02,861 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 949 places, 3408 transitions, 566039 flow [2022-12-13 07:15:02,861 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:15:02,865 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:15:02,865 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 310 [2022-12-13 07:15:02,865 INFO L495 AbstractCegarLoop]: Abstraction has has 949 places, 3408 transitions, 566039 flow [2022-12-13 07:15:02,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:15:02,865 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:15:02,865 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:15:02,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Forceful destruction successful, exit code 0 [2022-12-13 07:15:03,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:15:03,066 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:15:03,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:15:03,066 INFO L85 PathProgramCache]: Analyzing trace with hash 914049366, now seen corresponding path program 55 times [2022-12-13 07:15:03,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:15:03,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88717870] [2022-12-13 07:15:03,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:15:03,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:15:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:15:03,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:15:03,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:15:03,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88717870] [2022-12-13 07:15:03,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88717870] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:15:03,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908168242] [2022-12-13 07:15:03,770 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:15:03,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:15:03,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:15:03,771 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:15:03,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-12-13 07:15:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:15:04,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 07:15:04,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:15:04,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:15:04,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 07:15:04,412 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:15:04,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 35 [2022-12-13 07:15:04,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:15:04,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:15:04,755 WARN L837 $PredicateComparison]: unable to prove that (and (or (< |c_thread1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_5640 (Array Int Int)) (~o_2~0.base Int)) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5640))) (= (select (select .cse0 ~o_2~0.base) c_~o_2~0.offset) (select (select .cse0 c_~o_0~0.base) c_~o_0~0.offset)))))) (forall ((v_ArrVal_5640 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5640))) (let ((.cse1 (select .cse2 ~o_2~0.base))) (or (= (select .cse1 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (not (= (select .cse1 c_~o_2~0.offset) (select (select .cse2 c_~o_0~0.base) c_~o_0~0.offset)))))))) is different from false [2022-12-13 07:15:04,794 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:15:04,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 148 [2022-12-13 07:15:04,816 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:15:04,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 84 [2022-12-13 07:15:05,115 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 07:15:05,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:15:05,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908168242] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:15:05,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:15:05,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 24 [2022-12-13 07:15:05,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142194289] [2022-12-13 07:15:05,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:15:05,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 07:15:05,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:15:05,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 07:15:05,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=466, Unknown=1, NotChecked=44, Total=600 [2022-12-13 07:15:05,148 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:15:05,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 949 places, 3408 transitions, 566039 flow. Second operand has 25 states, 25 states have (on average 1.76) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:15:05,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:15:05,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:15:05,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:15:27,290 INFO L130 PetriNetUnfolder]: 3416/6131 cut-off events. [2022-12-13 07:15:27,290 INFO L131 PetriNetUnfolder]: For 184/184 co-relation queries the response was YES. [2022-12-13 07:15:27,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515230 conditions, 6131 events. 3416/6131 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 45370 event pairs, 0 based on Foata normal form. 4/4989 useless extension candidates. Maximal degree in co-relation 487831. Up to 6132 conditions per place. [2022-12-13 07:15:27,419 INFO L137 encePairwiseOnDemand]: 7/19 looper letters, 2074 selfloop transitions, 1373 changer transitions 4/3451 dead transitions. [2022-12-13 07:15:27,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 974 places, 3451 transitions, 580082 flow [2022-12-13 07:15:27,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 07:15:27,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-13 07:15:27,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 146 transitions. [2022-12-13 07:15:27,424 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29554655870445345 [2022-12-13 07:15:27,424 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 951 predicate places. [2022-12-13 07:15:27,424 INFO L82 GeneralOperation]: Start removeDead. Operand has 974 places, 3451 transitions, 580082 flow [2022-12-13 07:15:27,720 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 973 places, 3447 transitions, 579407 flow [2022-12-13 07:15:27,949 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:15:27,949 INFO L89 Accepts]: Start accepts. Operand has 973 places, 3447 transitions, 579407 flow [2022-12-13 07:15:28,047 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:15:28,047 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:15:28,047 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 973 places, 3447 transitions, 579407 flow [2022-12-13 07:15:28,239 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 973 places, 3447 transitions, 579407 flow [2022-12-13 07:15:28,239 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:15:28,243 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:15:28,244 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 295 [2022-12-13 07:15:28,244 INFO L495 AbstractCegarLoop]: Abstraction has has 973 places, 3447 transitions, 579407 flow [2022-12-13 07:15:28,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.76) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:15:28,244 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:15:28,244 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:15:28,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Forceful destruction successful, exit code 0 [2022-12-13 07:15:28,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:15:28,444 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:15:28,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:15:28,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1454001764, now seen corresponding path program 56 times [2022-12-13 07:15:28,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:15:28,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288042795] [2022-12-13 07:15:28,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:15:28,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:15:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:15:29,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:15:29,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:15:29,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288042795] [2022-12-13 07:15:29,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288042795] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:15:29,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598634373] [2022-12-13 07:15:29,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:15:29,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:15:29,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:15:29,024 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:15:29,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2022-12-13 07:15:29,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:15:29,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:15:29,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 07:15:29,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:15:29,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:15:29,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 07:15:29,743 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 07:15:29,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 32 [2022-12-13 07:15:29,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:15:29,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:15:29,941 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5713 (Array Int Int)) (~o_2~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5713))) (let ((.cse0 (select .cse1 ~o_2~0.base))) (or (= (select .cse0 (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) |c_thread1Thread1of1ForFork0_#t~mem1#1|) (not (= (select (select .cse1 c_~o_0~0.base) c_~o_0~0.offset) (select .cse0 c_~o_2~0.offset))))))) (or (forall ((v_ArrVal_5713 (Array Int Int)) (~o_2~0.base Int)) (not (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5713))) (= (select (select .cse2 c_~o_0~0.base) c_~o_0~0.offset) (select (select .cse2 ~o_2~0.base) c_~o_2~0.offset))))) (< |c_thread1Thread1of1ForFork0_~i~0#1| 4))) is different from false [2022-12-13 07:15:29,981 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:15:29,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 148 [2022-12-13 07:15:30,000 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:15:30,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 84 [2022-12-13 07:15:30,403 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 07:15:30,434 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:15:30,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598634373] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:15:30,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:15:30,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 24 [2022-12-13 07:15:30,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728630902] [2022-12-13 07:15:30,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:15:30,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 07:15:30,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:15:30,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 07:15:30,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=463, Unknown=1, NotChecked=44, Total=600 [2022-12-13 07:15:30,435 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:15:30,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 973 places, 3447 transitions, 579407 flow. Second operand has 25 states, 25 states have (on average 1.76) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:15:30,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:15:30,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:15:30,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:15:51,312 INFO L130 PetriNetUnfolder]: 3408/6111 cut-off events. [2022-12-13 07:15:51,312 INFO L131 PetriNetUnfolder]: For 168/168 co-relation queries the response was YES. [2022-12-13 07:15:51,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519658 conditions, 6111 events. 3408/6111 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 45315 event pairs, 0 based on Foata normal form. 4/4975 useless extension candidates. Maximal degree in co-relation 493128. Up to 6112 conditions per place. [2022-12-13 07:15:51,443 INFO L137 encePairwiseOnDemand]: 7/19 looper letters, 2089 selfloop transitions, 1345 changer transitions 8/3442 dead transitions. [2022-12-13 07:15:51,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 988 places, 3442 transitions, 585445 flow [2022-12-13 07:15:51,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 07:15:51,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 07:15:51,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 94 transitions. [2022-12-13 07:15:51,444 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3092105263157895 [2022-12-13 07:15:51,444 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 965 predicate places. [2022-12-13 07:15:51,445 INFO L82 GeneralOperation]: Start removeDead. Operand has 988 places, 3442 transitions, 585445 flow [2022-12-13 07:15:51,748 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 986 places, 3434 transitions, 584079 flow [2022-12-13 07:15:51,860 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:15:51,860 INFO L89 Accepts]: Start accepts. Operand has 986 places, 3434 transitions, 584079 flow [2022-12-13 07:15:52,176 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:15:52,176 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:15:52,176 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 986 places, 3434 transitions, 584079 flow [2022-12-13 07:15:52,505 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 986 places, 3434 transitions, 584079 flow [2022-12-13 07:15:52,506 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:15:52,510 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:15:52,510 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 650 [2022-12-13 07:15:52,510 INFO L495 AbstractCegarLoop]: Abstraction has has 986 places, 3434 transitions, 584079 flow [2022-12-13 07:15:52,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.76) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:15:52,511 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:15:52,511 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:15:52,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Forceful destruction successful, exit code 0 [2022-12-13 07:15:52,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable83 [2022-12-13 07:15:52,711 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:15:52,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:15:52,712 INFO L85 PathProgramCache]: Analyzing trace with hash -992379460, now seen corresponding path program 57 times [2022-12-13 07:15:52,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:15:52,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290968439] [2022-12-13 07:15:52,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:15:52,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:15:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:15:53,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:15:53,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:15:53,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290968439] [2022-12-13 07:15:53,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290968439] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:15:53,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848763958] [2022-12-13 07:15:53,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:15:53,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:15:53,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:15:53,488 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:15:53,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2022-12-13 07:15:53,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:15:53,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:15:53,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-13 07:15:53,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:15:53,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-12-13 07:15:54,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:15:54,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2022-12-13 07:15:54,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 33 [2022-12-13 07:15:54,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:15:54,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:15:54,442 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:15:54,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 134 [2022-12-13 07:15:54,452 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:15:54,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2022-12-13 07:15:54,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:15:54,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848763958] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:15:54,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:15:54,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2022-12-13 07:15:54,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092561618] [2022-12-13 07:15:54,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:15:54,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-13 07:15:54,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:15:54,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-13 07:15:54,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=753, Unknown=3, NotChecked=0, Total=870 [2022-12-13 07:15:54,635 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:15:54,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 986 places, 3434 transitions, 584079 flow. Second operand has 30 states, 30 states have (on average 1.6) internal successors, (48), 29 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:15:54,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:15:54,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:15:54,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:16:25,434 INFO L130 PetriNetUnfolder]: 3403/6102 cut-off events. [2022-12-13 07:16:25,435 INFO L131 PetriNetUnfolder]: For 173/173 co-relation queries the response was YES. [2022-12-13 07:16:25,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524995 conditions, 6102 events. 3403/6102 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 45103 event pairs, 0 based on Foata normal form. 4/4968 useless extension candidates. Maximal degree in co-relation 498499. Up to 6103 conditions per place. [2022-12-13 07:16:25,569 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 2209 selfloop transitions, 1224 changer transitions 4/3437 dead transitions. [2022-12-13 07:16:25,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1007 places, 3437 transitions, 591466 flow [2022-12-13 07:16:25,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 07:16:25,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 07:16:25,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 111 transitions. [2022-12-13 07:16:25,570 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26555023923444976 [2022-12-13 07:16:25,571 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 984 predicate places. [2022-12-13 07:16:25,571 INFO L82 GeneralOperation]: Start removeDead. Operand has 1007 places, 3437 transitions, 591466 flow [2022-12-13 07:16:25,870 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1006 places, 3433 transitions, 590775 flow [2022-12-13 07:16:26,123 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:16:26,123 INFO L89 Accepts]: Start accepts. Operand has 1006 places, 3433 transitions, 590775 flow [2022-12-13 07:16:26,229 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:16:26,230 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:16:26,230 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 1006 places, 3433 transitions, 590775 flow [2022-12-13 07:16:26,423 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 1006 places, 3433 transitions, 590775 flow [2022-12-13 07:16:26,423 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:16:26,430 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:16:26,430 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 307 [2022-12-13 07:16:26,430 INFO L495 AbstractCegarLoop]: Abstraction has has 1006 places, 3433 transitions, 590775 flow [2022-12-13 07:16:26,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.6) internal successors, (48), 29 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:16:26,430 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:16:26,430 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:16:26,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Forceful destruction successful, exit code 0 [2022-12-13 07:16:26,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:16:26,635 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:16:26,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:16:26,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1479891708, now seen corresponding path program 58 times [2022-12-13 07:16:26,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:16:26,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018583657] [2022-12-13 07:16:26,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:16:26,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:16:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:16:27,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:16:27,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:16:27,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018583657] [2022-12-13 07:16:27,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018583657] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:16:27,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583610820] [2022-12-13 07:16:27,331 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:16:27,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:16:27,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:16:27,333 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:16:27,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2022-12-13 07:16:27,817 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:16:27,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:16:27,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-13 07:16:27,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:16:27,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:16:27,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:16:27,984 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 07:16:27,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2022-12-13 07:16:28,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:16:28,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:16:28,373 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:16:28,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 134 [2022-12-13 07:16:28,382 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:16:28,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2022-12-13 07:16:28,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:16:28,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583610820] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:16:28,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:16:28,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2022-12-13 07:16:28,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781883245] [2022-12-13 07:16:28,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:16:28,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 07:16:28,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:16:28,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 07:16:28,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=644, Unknown=2, NotChecked=0, Total=756 [2022-12-13 07:16:28,568 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:16:28,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1006 places, 3433 transitions, 590775 flow. Second operand has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:16:28,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:16:28,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:16:28,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:16:50,231 INFO L130 PetriNetUnfolder]: 3392/6077 cut-off events. [2022-12-13 07:16:50,232 INFO L131 PetriNetUnfolder]: For 171/171 co-relation queries the response was YES. [2022-12-13 07:16:50,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528919 conditions, 6077 events. 3392/6077 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 44915 event pairs, 0 based on Foata normal form. 4/4949 useless extension candidates. Maximal degree in co-relation 503338. Up to 6078 conditions per place. [2022-12-13 07:16:50,377 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 2002 selfloop transitions, 1415 changer transitions 8/3425 dead transitions. [2022-12-13 07:16:50,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1016 places, 3425 transitions, 596243 flow [2022-12-13 07:16:50,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 07:16:50,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 07:16:50,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 77 transitions. [2022-12-13 07:16:50,378 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3117408906882591 [2022-12-13 07:16:50,378 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 993 predicate places. [2022-12-13 07:16:50,378 INFO L82 GeneralOperation]: Start removeDead. Operand has 1016 places, 3425 transitions, 596243 flow [2022-12-13 07:16:50,687 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1009 places, 3417 transitions, 594845 flow [2022-12-13 07:16:50,797 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:16:50,797 INFO L89 Accepts]: Start accepts. Operand has 1009 places, 3417 transitions, 594845 flow [2022-12-13 07:16:51,047 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:16:51,048 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:16:51,048 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 1009 places, 3417 transitions, 594845 flow [2022-12-13 07:16:51,308 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 1009 places, 3417 transitions, 594845 flow [2022-12-13 07:16:51,308 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:16:51,313 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:16:51,315 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 519 [2022-12-13 07:16:51,315 INFO L495 AbstractCegarLoop]: Abstraction has has 1009 places, 3417 transitions, 594845 flow [2022-12-13 07:16:51,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:16:51,315 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:16:51,315 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:16:51,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Forceful destruction successful, exit code 0 [2022-12-13 07:16:51,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:16:51,526 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:16:51,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:16:51,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1590778973, now seen corresponding path program 59 times [2022-12-13 07:16:51,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:16:51,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562704560] [2022-12-13 07:16:51,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:16:51,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:16:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:16:52,088 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:16:52,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:16:52,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562704560] [2022-12-13 07:16:52,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562704560] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:16:52,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965381394] [2022-12-13 07:16:52,089 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:16:52,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:16:52,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:16:52,091 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:16:52,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2022-12-13 07:16:52,431 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 07:16:52,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:16:52,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 07:16:52,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:16:52,560 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 07:16:52,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 12 [2022-12-13 07:16:52,573 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:16:52,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:16:52,711 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-13 07:16:52,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-13 07:16:52,734 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:16:52,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965381394] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:16:52,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:16:52,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 17 [2022-12-13 07:16:52,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540926023] [2022-12-13 07:16:52,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:16:52,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 07:16:52,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:16:52,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 07:16:52,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-12-13 07:16:52,735 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:16:52,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1009 places, 3417 transitions, 594845 flow. Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 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 07:16:52,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:16:52,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:16:52,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:17,524 INFO L130 PetriNetUnfolder]: 3548/6347 cut-off events. [2022-12-13 07:17:17,525 INFO L131 PetriNetUnfolder]: For 191/191 co-relation queries the response was YES. [2022-12-13 07:17:17,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 558772 conditions, 6347 events. 3548/6347 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 47230 event pairs, 0 based on Foata normal form. 0/5168 useless extension candidates. Maximal degree in co-relation 529897. Up to 6348 conditions per place. [2022-12-13 07:17:17,791 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 2757 selfloop transitions, 801 changer transitions 0/3558 dead transitions. [2022-12-13 07:17:17,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1020 places, 3558 transitions, 626531 flow [2022-12-13 07:17:17,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 07:17:17,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 07:17:17,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 82 transitions. [2022-12-13 07:17:17,792 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35964912280701755 [2022-12-13 07:17:17,792 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 997 predicate places. [2022-12-13 07:17:17,792 INFO L82 GeneralOperation]: Start removeDead. Operand has 1020 places, 3558 transitions, 626531 flow [2022-12-13 07:17:18,141 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1020 places, 3558 transitions, 626531 flow [2022-12-13 07:17:18,259 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:18,259 INFO L89 Accepts]: Start accepts. Operand has 1020 places, 3558 transitions, 626531 flow [2022-12-13 07:17:18,487 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:18,487 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:18,488 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 1020 places, 3558 transitions, 626531 flow [2022-12-13 07:17:18,852 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 1020 places, 3558 transitions, 626531 flow [2022-12-13 07:17:18,853 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:17:18,857 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:17:18,857 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 598 [2022-12-13 07:17:18,857 INFO L495 AbstractCegarLoop]: Abstraction has has 1020 places, 3558 transitions, 626531 flow [2022-12-13 07:17:18,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 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 07:17:18,857 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:18,857 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:17:18,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Forceful destruction successful, exit code 0 [2022-12-13 07:17:19,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable86 [2022-12-13 07:17:19,058 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:17:19,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:19,058 INFO L85 PathProgramCache]: Analyzing trace with hash 334432485, now seen corresponding path program 60 times [2022-12-13 07:17:19,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:19,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791666398] [2022-12-13 07:17:19,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:19,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:19,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:17:19,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:19,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791666398] [2022-12-13 07:17:19,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791666398] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:17:19,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231781028] [2022-12-13 07:17:19,514 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:17:19,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:17:19,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:17:19,515 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:17:19,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2022-12-13 07:17:19,977 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 07:17:19,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:17:19,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 07:17:19,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:17:20,140 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 07:17:20,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 12 [2022-12-13 07:17:20,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:17:20,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:17:20,310 INFO L321 Elim1Store]: treesize reduction 30, result has 58.9 percent of original size [2022-12-13 07:17:20,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 50 [2022-12-13 07:17:20,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:17:20,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231781028] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:17:20,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:17:20,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2022-12-13 07:17:20,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237862215] [2022-12-13 07:17:20,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:17:20,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 07:17:20,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:20,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 07:17:20,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-12-13 07:17:20,334 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 07:17:20,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1020 places, 3558 transitions, 626531 flow. Second operand has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 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 07:17:20,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:20,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 07:17:20,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:44,505 INFO L130 PetriNetUnfolder]: 3720/6651 cut-off events. [2022-12-13 07:17:44,505 INFO L131 PetriNetUnfolder]: For 213/213 co-relation queries the response was YES. [2022-12-13 07:17:44,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 592190 conditions, 6651 events. 3720/6651 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 49889 event pairs, 0 based on Foata normal form. 0/5420 useless extension candidates. Maximal degree in co-relation 558346. Up to 6652 conditions per place. [2022-12-13 07:17:44,744 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 3045 selfloop transitions, 655 changer transitions 0/3700 dead transitions. [2022-12-13 07:17:44,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1032 places, 3700 transitions, 658959 flow [2022-12-13 07:17:44,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 07:17:44,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 07:17:44,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 85 transitions. [2022-12-13 07:17:44,745 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3441295546558704 [2022-12-13 07:17:44,745 INFO L295 CegarLoopForPetriNet]: 23 programPoint places, 1009 predicate places. [2022-12-13 07:17:44,745 INFO L82 GeneralOperation]: Start removeDead. Operand has 1032 places, 3700 transitions, 658959 flow [2022-12-13 07:17:45,114 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1032 places, 3700 transitions, 658959 flow [2022-12-13 07:17:45,320 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:45,321 INFO L89 Accepts]: Start accepts. Operand has 1032 places, 3700 transitions, 658959 flow [2022-12-13 07:17:45,457 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:45,457 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:45,458 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 1032 places, 3700 transitions, 658959 flow [2022-12-13 07:17:45,713 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 1032 places, 3700 transitions, 658959 flow [2022-12-13 07:17:45,714 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:17:45,719 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:17:45,720 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 400 [2022-12-13 07:17:45,720 INFO L495 AbstractCegarLoop]: Abstraction has has 1032 places, 3700 transitions, 658959 flow [2022-12-13 07:17:45,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 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 07:17:45,720 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:45,720 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:17:45,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Forceful destruction successful, exit code 0 [2022-12-13 07:17:45,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:17:45,921 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 07:17:45,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:45,921 INFO L85 PathProgramCache]: Analyzing trace with hash -424307227, now seen corresponding path program 61 times [2022-12-13 07:17:45,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:45,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791651757] [2022-12-13 07:17:45,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:45,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2022-12-13 07:17:46,620 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-13 07:17:46,621 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 07:17:46,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2022-12-13 07:17:46,622 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 20 with TraceHistMax 2,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 3ms.. [2022-12-13 07:17:46,623 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 07:17:46,623 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 07:17:46,623 INFO L445 BasicCegarLoop]: Path program histogram: [61, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2022-12-13 07:17:46,626 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 07:17:46,626 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 07:17:46,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 07:17:46 BasicIcfg [2022-12-13 07:17:46,628 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 07:17:46,628 INFO L158 Benchmark]: Toolchain (without parser) took 787454.82ms. Allocated memory was 185.6MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 161.5MB in the beginning and 729.1MB in the end (delta: -567.5MB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2022-12-13 07:17:46,628 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 185.6MB. Free memory is still 161.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 07:17:46,628 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.34ms. Allocated memory is still 185.6MB. Free memory was 161.5MB in the beginning and 149.8MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 07:17:46,628 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.69ms. Allocated memory is still 185.6MB. Free memory was 149.8MB in the beginning and 147.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 07:17:46,629 INFO L158 Benchmark]: Boogie Preprocessor took 24.01ms. Allocated memory is still 185.6MB. Free memory was 147.2MB in the beginning and 145.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 07:17:46,629 INFO L158 Benchmark]: RCFGBuilder took 584.00ms. Allocated memory is still 185.6MB. Free memory was 145.7MB in the beginning and 125.2MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-13 07:17:46,629 INFO L158 Benchmark]: TraceAbstraction took 786560.40ms. Allocated memory was 185.6MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 123.6MB in the beginning and 729.1MB in the end (delta: -605.4MB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2022-12-13 07:17:46,629 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 185.6MB. Free memory is still 161.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 222.34ms. Allocated memory is still 185.6MB. Free memory was 161.5MB in the beginning and 149.8MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.69ms. Allocated memory is still 185.6MB. Free memory was 149.8MB in the beginning and 147.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.01ms. Allocated memory is still 185.6MB. Free memory was 147.2MB in the beginning and 145.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 584.00ms. Allocated memory is still 185.6MB. Free memory was 145.7MB in the beginning and 125.2MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 786560.40ms. Allocated memory was 185.6MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 123.6MB in the beginning and 729.1MB in the end (delta: -605.4MB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 203 PlacesBefore, 23 PlacesAfterwards, 217 TransitionsBefore, 20 TransitionsAfterwards, 5400 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 98 TrivialYvCompositions, 82 ConcurrentYvCompositions, 17 ChoiceCompositions, 197 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3479, independent: 3467, independent conditional: 3467, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3479, independent: 3467, independent conditional: 0, independent unconditional: 3467, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3479, independent: 3467, independent conditional: 0, independent unconditional: 3467, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3479, independent: 3467, independent conditional: 0, independent unconditional: 3467, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3116, independent: 3107, independent conditional: 0, independent unconditional: 3107, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3116, independent: 3107, independent conditional: 0, independent unconditional: 3107, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3479, independent: 360, independent conditional: 0, independent unconditional: 360, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 3116, unknown conditional: 0, unknown unconditional: 3116] , Statistics on independence cache: Total cache size (in pairs): 6784, Positive cache size: 6775, Positive conditional cache size: 0, Positive unconditional cache size: 6775, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 60 TransitionsBefore, 60 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, 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, 45 PlacesBefore, 45 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 111 TransitionsBefore, 111 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, 50 PlacesBefore, 50 PlacesAfterwards, 98 TransitionsBefore, 98 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, 52 PlacesBefore, 52 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 65 PlacesBefore, 61 PlacesAfterwards, 166 TransitionsBefore, 164 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 71 PlacesBefore, 71 PlacesAfterwards, 182 TransitionsBefore, 182 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.9s, 84 PlacesBefore, 80 PlacesAfterwards, 204 TransitionsBefore, 202 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 91 PlacesBefore, 91 PlacesAfterwards, 204 TransitionsBefore, 204 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 104 PlacesBefore, 100 PlacesAfterwards, 240 TransitionsBefore, 238 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 111 PlacesBefore, 108 PlacesAfterwards, 252 TransitionsBefore, 250 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 119 PlacesBefore, 117 PlacesAfterwards, 252 TransitionsBefore, 250 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 128 PlacesBefore, 128 PlacesAfterwards, 264 TransitionsBefore, 264 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, 138 PlacesBefore, 138 PlacesAfterwards, 266 TransitionsBefore, 266 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: 3.2s, 149 PlacesBefore, 148 PlacesAfterwards, 271 TransitionsBefore, 270 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, 157 PlacesBefore, 157 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, 170 PlacesBefore, 170 PlacesAfterwards, 372 TransitionsBefore, 372 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, 180 PlacesBefore, 180 PlacesAfterwards, 413 TransitionsBefore, 413 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, 190 PlacesBefore, 190 PlacesAfterwards, 472 TransitionsBefore, 472 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, 200 PlacesBefore, 200 PlacesAfterwards, 468 TransitionsBefore, 468 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, 211 PlacesBefore, 211 PlacesAfterwards, 484 TransitionsBefore, 484 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, 221 PlacesBefore, 221 PlacesAfterwards, 488 TransitionsBefore, 488 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, 231 PlacesBefore, 231 PlacesAfterwards, 475 TransitionsBefore, 475 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, 243 PlacesBefore, 243 PlacesAfterwards, 492 TransitionsBefore, 492 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, 254 PlacesBefore, 254 PlacesAfterwards, 536 TransitionsBefore, 536 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, 266 PlacesBefore, 266 PlacesAfterwards, 559 TransitionsBefore, 559 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 [2022-12-13 07:17:46,650 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 Lipton Reduction Statistics: ReductionTime: 0.0s, 278 PlacesBefore, 278 PlacesAfterwards, 631 TransitionsBefore, 631 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, 629 TransitionsBefore, 629 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, 301 PlacesBefore, 301 PlacesAfterwards, 611 TransitionsBefore, 611 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, 308 PlacesBefore, 308 PlacesAfterwards, 659 TransitionsBefore, 659 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, 317 PlacesBefore, 317 PlacesAfterwards, 773 TransitionsBefore, 773 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 347 PlacesBefore, 347 PlacesAfterwards, 862 TransitionsBefore, 862 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 364 PlacesBefore, 364 PlacesAfterwards, 921 TransitionsBefore, 921 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, 373 PlacesBefore, 373 PlacesAfterwards, 1139 TransitionsBefore, 1139 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, 384 PlacesBefore, 384 PlacesAfterwards, 1134 TransitionsBefore, 1134 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, 412 PlacesBefore, 412 PlacesAfterwards, 1563 TransitionsBefore, 1563 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, 422 PlacesBefore, 422 PlacesAfterwards, 1629 TransitionsBefore, 1629 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, 430 PlacesBefore, 430 PlacesAfterwards, 1597 TransitionsBefore, 1597 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, 442 PlacesBefore, 442 PlacesAfterwards, 1615 TransitionsBefore, 1615 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, 456 PlacesBefore, 456 PlacesAfterwards, 1627 TransitionsBefore, 1627 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, 465 PlacesBefore, 465 PlacesAfterwards, 1615 TransitionsBefore, 1615 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, 473 PlacesBefore, 473 PlacesAfterwards, 1591 TransitionsBefore, 1591 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, 493 PlacesBefore, 493 PlacesAfterwards, 1661 TransitionsBefore, 1661 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, 506 PlacesBefore, 506 PlacesAfterwards, 1695 TransitionsBefore, 1695 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, 519 PlacesBefore, 519 PlacesAfterwards, 1723 TransitionsBefore, 1723 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, 532 PlacesBefore, 532 PlacesAfterwards, 1699 TransitionsBefore, 1699 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, 540 PlacesBefore, 540 PlacesAfterwards, 1683 TransitionsBefore, 1683 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, 553 PlacesBefore, 553 PlacesAfterwards, 1661 TransitionsBefore, 1661 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, 564 PlacesBefore, 564 PlacesAfterwards, 1673 TransitionsBefore, 1673 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, 577 PlacesBefore, 577 PlacesAfterwards, 1689 TransitionsBefore, 1689 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, 593 PlacesBefore, 593 PlacesAfterwards, 1712 TransitionsBefore, 1712 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, 601 PlacesBefore, 601 PlacesAfterwards, 1700 TransitionsBefore, 1700 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, 621 PlacesBefore, 621 PlacesAfterwards, 1782 TransitionsBefore, 1782 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, 647 PlacesBefore, 647 PlacesAfterwards, 1974 TransitionsBefore, 1974 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, 659 PlacesBefore, 659 PlacesAfterwards, 2022 TransitionsBefore, 2022 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, 669 PlacesBefore, 669 PlacesAfterwards, 2034 TransitionsBefore, 2034 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, 682 PlacesBefore, 682 PlacesAfterwards, 2066 TransitionsBefore, 2066 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, 706 PlacesBefore, 706 PlacesAfterwards, 2159 TransitionsBefore, 2159 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, 719 PlacesBefore, 719 PlacesAfterwards, 2179 TransitionsBefore, 2179 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, 731 PlacesBefore, 731 PlacesAfterwards, 2173 TransitionsBefore, 2173 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, 748 PlacesBefore, 748 PlacesAfterwards, 2225 TransitionsBefore, 2225 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, 763 PlacesBefore, 763 PlacesAfterwards, 2249 TransitionsBefore, 2249 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, 777 PlacesBefore, 777 PlacesAfterwards, 2224 TransitionsBefore, 2224 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, 792 PlacesBefore, 792 PlacesAfterwards, 2252 TransitionsBefore, 2252 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, 802 PlacesBefore, 802 PlacesAfterwards, 2349 TransitionsBefore, 2349 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, 816 PlacesBefore, 816 PlacesAfterwards, 2366 TransitionsBefore, 2366 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, 2336 TransitionsBefore, 2336 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, 842 PlacesBefore, 842 PlacesAfterwards, 2397 TransitionsBefore, 2397 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, 850 PlacesBefore, 850 PlacesAfterwards, 2381 TransitionsBefore, 2381 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, 857 PlacesBefore, 857 PlacesAfterwards, 2390 TransitionsBefore, 2390 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, 863 PlacesBefore, 863 PlacesAfterwards, 2374 TransitionsBefore, 2374 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, 871 PlacesBefore, 871 PlacesAfterwards, 2352 TransitionsBefore, 2352 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, 884 PlacesBefore, 884 PlacesAfterwards, 2363 TransitionsBefore, 2363 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, 904 PlacesBefore, 904 PlacesAfterwards, 3400 TransitionsBefore, 3400 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, 914 PlacesBefore, 914 PlacesAfterwards, 3404 TransitionsBefore, 3404 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, 924 PlacesBefore, 924 PlacesAfterwards, 3416 TransitionsBefore, 3416 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, 935 PlacesBefore, 935 PlacesAfterwards, 3409 TransitionsBefore, 3409 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, 949 PlacesBefore, 949 PlacesAfterwards, 3408 TransitionsBefore, 3408 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, 973 PlacesBefore, 973 PlacesAfterwards, 3447 TransitionsBefore, 3447 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, 986 PlacesBefore, 986 PlacesAfterwards, 3434 TransitionsBefore, 3434 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, 1006 PlacesBefore, 1006 PlacesAfterwards, 3433 TransitionsBefore, 3433 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, 1009 PlacesBefore, 1009 PlacesAfterwards, 3417 TransitionsBefore, 3417 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, 1020 PlacesBefore, 1020 PlacesAfterwards, 3558 TransitionsBefore, 3558 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, 1032 PlacesBefore, 1032 PlacesAfterwards, 3700 TransitionsBefore, 3700 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 20 with TraceHistMax 2,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 3ms.. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 20 with TraceHistMax 2,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 3ms.. - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 20 with TraceHistMax 2,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 3ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 291 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 786.3s, OverallIterations: 89, TraceHistogramMax: 5, PathProgramHistogramMax: 61, EmptinessCheckTime: 0.0s, AutomataDifference: 525.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 382 mSolverCounterUnknown, 10565 SdHoareTripleChecker+Valid, 42.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10565 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 38.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1311 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1249 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42860 IncrementalHoareTripleChecker+Invalid, 45802 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1249 mSolverCounterUnsat, 0 mSDtfsCounter, 42860 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5033 GetRequests, 2289 SyntacticMatches, 76 SemanticMatches, 2668 ConstructedPredicates, 25 IntricatePredicates, 7 DeprecatedPredicates, 17698 ImplicationChecksByTransitivity, 167.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=658959occurred in iteration=88, InterpolantAutomatonStates: 1201, 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: 1.2s SsaConstructionTime, 6.2s SatisfiabilityAnalysisTime, 178.9s InterpolantComputationTime, 3191 NumberOfCodeBlocks, 3175 NumberOfCodeBlocksAsserted, 247 NumberOfCheckSat, 4429 ConstructedInterpolants, 171 QuantifiedInterpolants, 74492 SizeOfPredicates, 1999 NumberOfNonLiveVariables, 26032 ConjunctsInSsa, 4035 ConjunctsInUnsatCore, 252 InterpolantComputations, 7 PerfectInterpolantSequences, 697/1385 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