/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 08:41:07,339 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 08:41:07,340 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 08:41:07,367 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 08:41:07,368 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 08:41:07,370 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 08:41:07,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 08:41:07,377 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 08:41:07,380 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 08:41:07,384 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 08:41:07,385 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 08:41:07,388 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 08:41:07,388 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 08:41:07,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 08:41:07,392 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 08:41:07,393 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 08:41:07,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 08:41:07,394 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 08:41:07,395 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 08:41:07,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 08:41:07,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 08:41:07,408 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 08:41:07,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 08:41:07,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 08:41:07,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 08:41:07,418 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 08:41:07,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 08:41:07,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 08:41:07,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 08:41:07,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 08:41:07,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 08:41:07,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 08:41:07,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 08:41:07,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 08:41:07,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 08:41:07,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 08:41:07,424 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 08:41:07,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 08:41:07,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 08:41:07,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 08:41:07,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 08:41:07,426 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 08:41:07,455 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 08:41:07,456 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 08:41:07,457 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 08:41:07,458 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 08:41:07,458 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 08:41:07,458 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 08:41:07,458 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 08:41:07,459 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 08:41:07,459 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 08:41:07,459 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 08:41:07,459 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 08:41:07,460 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 08:41:07,460 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 08:41:07,460 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 08:41:07,460 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 08:41:07,460 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 08:41:07,460 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 08:41:07,460 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 08:41:07,460 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 08:41:07,460 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 08:41:07,460 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 08:41:07,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 08:41:07,461 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 08:41:07,461 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 08:41:07,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 08:41:07,461 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 08:41:07,461 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 08:41:07,461 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 08:41:07,461 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 08:41:07,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 08:41:07,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 08:41:07,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 08:41:07,757 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 08:41:07,757 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 08:41:07,758 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c [2022-12-13 08:41:08,827 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 08:41:09,003 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 08:41:09,004 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c [2022-12-13 08:41:09,009 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff7a7bfc4/f1f44436b89343278c00e6496a63d6f9/FLAGcf359b8ee [2022-12-13 08:41:09,024 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff7a7bfc4/f1f44436b89343278c00e6496a63d6f9 [2022-12-13 08:41:09,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 08:41:09,027 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 08:41:09,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 08:41:09,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 08:41:09,032 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 08:41:09,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:41:09" (1/1) ... [2022-12-13 08:41:09,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c8edd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:41:09, skipping insertion in model container [2022-12-13 08:41:09,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:41:09" (1/1) ... [2022-12-13 08:41:09,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 08:41:09,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 08:41:09,199 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2500,2513] [2022-12-13 08:41:09,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 08:41:09,216 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 08:41:09,244 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2500,2513] [2022-12-13 08:41:09,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 08:41:09,258 INFO L208 MainTranslator]: Completed translation [2022-12-13 08:41:09,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:41:09 WrapperNode [2022-12-13 08:41:09,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 08:41:09,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 08:41:09,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 08:41:09,261 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 08:41:09,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:41:09" (1/1) ... [2022-12-13 08:41:09,278 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:41:09" (1/1) ... [2022-12-13 08:41:09,302 INFO L138 Inliner]: procedures = 24, calls = 34, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 144 [2022-12-13 08:41:09,303 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 08:41:09,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 08:41:09,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 08:41:09,303 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 08:41:09,309 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:41:09" (1/1) ... [2022-12-13 08:41:09,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:41:09" (1/1) ... [2022-12-13 08:41:09,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:41:09" (1/1) ... [2022-12-13 08:41:09,312 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:41:09" (1/1) ... [2022-12-13 08:41:09,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:41:09" (1/1) ... [2022-12-13 08:41:09,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:41:09" (1/1) ... [2022-12-13 08:41:09,329 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:41:09" (1/1) ... [2022-12-13 08:41:09,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:41:09" (1/1) ... [2022-12-13 08:41:09,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 08:41:09,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 08:41:09,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 08:41:09,332 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 08:41:09,333 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:41:09" (1/1) ... [2022-12-13 08:41:09,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 08:41:09,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:41:09,356 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 08:41:09,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 08:41:09,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 08:41:09,397 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 08:41:09,397 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 08:41:09,397 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 08:41:09,397 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 08:41:09,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 08:41:09,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 08:41:09,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 08:41:09,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 08:41:09,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 08:41:09,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 08:41:09,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 08:41:09,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 08:41:09,399 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 08:41:09,461 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 08:41:09,462 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 08:41:09,694 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 08:41:09,700 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 08:41:09,700 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 08:41:09,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:41:09 BoogieIcfgContainer [2022-12-13 08:41:09,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 08:41:09,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 08:41:09,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 08:41:09,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 08:41:09,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:41:09" (1/3) ... [2022-12-13 08:41:09,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@300af66c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:41:09, skipping insertion in model container [2022-12-13 08:41:09,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:41:09" (2/3) ... [2022-12-13 08:41:09,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@300af66c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:41:09, skipping insertion in model container [2022-12-13 08:41:09,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:41:09" (3/3) ... [2022-12-13 08:41:09,707 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-3.wvr.c [2022-12-13 08:41:09,719 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 08:41:09,720 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 08:41:09,720 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 08:41:09,808 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 08:41:09,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 167 transitions, 350 flow [2022-12-13 08:41:09,945 INFO L130 PetriNetUnfolder]: 15/165 cut-off events. [2022-12-13 08:41:09,946 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 08:41:09,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 165 events. 15/165 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 165 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-13 08:41:09,950 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 167 transitions, 350 flow [2022-12-13 08:41:09,957 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 157 transitions, 326 flow [2022-12-13 08:41:09,958 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:09,974 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 157 transitions, 326 flow [2022-12-13 08:41:09,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 157 transitions, 326 flow [2022-12-13 08:41:10,025 INFO L130 PetriNetUnfolder]: 15/157 cut-off events. [2022-12-13 08:41:10,025 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 08:41:10,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 157 events. 15/157 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 146 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-13 08:41:10,030 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 157 transitions, 326 flow [2022-12-13 08:41:10,030 INFO L226 LiptonReduction]: Number of co-enabled transitions 2592 [2022-12-13 08:41:14,075 INFO L241 LiptonReduction]: Total number of compositions: 140 [2022-12-13 08:41:14,096 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 08:41:14,100 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;@3612d612, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 08:41:14,100 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 08:41:14,103 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-13 08:41:14,103 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 08:41:14,103 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:14,104 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:14,104 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:14,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:14,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1887355417, now seen corresponding path program 1 times [2022-12-13 08:41:14,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:14,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506311099] [2022-12-13 08:41:14,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:14,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:14,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:14,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506311099] [2022-12-13 08:41:14,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506311099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:41:14,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:41:14,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 08:41:14,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582846078] [2022-12-13 08:41:14,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:41:14,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 08:41:14,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:14,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 08:41:14,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 08:41:14,419 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-13 08:41:14,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:14,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:14,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-13 08:41:14,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:14,450 INFO L130 PetriNetUnfolder]: 49/84 cut-off events. [2022-12-13 08:41:14,451 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 08:41:14,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 84 events. 49/84 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 19 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 129. Up to 81 conditions per place. [2022-12-13 08:41:14,452 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-13 08:41:14,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 80 flow [2022-12-13 08:41:14,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:41:14,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 08:41:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-13 08:41:14,461 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-13 08:41:14,465 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 2 predicate places. [2022-12-13 08:41:14,465 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 18 transitions, 80 flow [2022-12-13 08:41:14,467 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 80 flow [2022-12-13 08:41:14,468 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:14,469 INFO L89 Accepts]: Start accepts. Operand has 23 places, 18 transitions, 80 flow [2022-12-13 08:41:14,472 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:14,472 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:14,472 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 18 transitions, 80 flow [2022-12-13 08:41:14,480 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 18 transitions, 80 flow [2022-12-13 08:41:14,480 INFO L226 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-13 08:41:15,135 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 08:41:15,136 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 668 [2022-12-13 08:41:15,136 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 17 transitions, 76 flow [2022-12-13 08:41:15,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:15,136 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:15,137 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:15,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 08:41:15,137 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:15,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:15,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1661137616, now seen corresponding path program 1 times [2022-12-13 08:41:15,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:15,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299646967] [2022-12-13 08:41:15,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:15,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:15,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:15,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:15,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299646967] [2022-12-13 08:41:15,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299646967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:41:15,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:41:15,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 08:41:15,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470637423] [2022-12-13 08:41:15,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:41:15,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 08:41:15,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:15,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 08:41:15,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 08:41:15,296 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-13 08:41:15,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 17 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:15,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:15,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-13 08:41:15,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:15,335 INFO L130 PetriNetUnfolder]: 66/116 cut-off events. [2022-12-13 08:41:15,335 INFO L131 PetriNetUnfolder]: For 17/19 co-relation queries the response was YES. [2022-12-13 08:41:15,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 116 events. 66/116 cut-off events. For 17/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 319 event pairs, 9 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 263. Up to 114 conditions per place. [2022-12-13 08:41:15,336 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 21 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2022-12-13 08:41:15,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 27 transitions, 175 flow [2022-12-13 08:41:15,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 08:41:15,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 08:41:15,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-13 08:41:15,338 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-13 08:41:15,339 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-13 08:41:15,339 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 27 transitions, 175 flow [2022-12-13 08:41:15,339 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 26 transitions, 166 flow [2022-12-13 08:41:15,340 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:15,341 INFO L89 Accepts]: Start accepts. Operand has 24 places, 26 transitions, 166 flow [2022-12-13 08:41:15,341 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:15,341 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:15,341 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 26 transitions, 166 flow [2022-12-13 08:41:15,345 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 26 transitions, 166 flow [2022-12-13 08:41:15,345 INFO L226 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-13 08:41:15,346 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:41:15,347 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 08:41:15,348 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 26 transitions, 166 flow [2022-12-13 08:41:15,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:15,348 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:15,348 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:15,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 08:41:15,348 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:15,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:15,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1402005448, now seen corresponding path program 1 times [2022-12-13 08:41:15,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:15,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575119886] [2022-12-13 08:41:15,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:15,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:15,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:15,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:15,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575119886] [2022-12-13 08:41:15,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575119886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:41:15,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:41:15,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:41:15,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267399296] [2022-12-13 08:41:15,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:41:15,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 08:41:15,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:15,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 08:41:15,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 08:41:15,472 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 08:41:15,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 26 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:15,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:15,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 08:41:15,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:15,575 INFO L130 PetriNetUnfolder]: 85/167 cut-off events. [2022-12-13 08:41:15,576 INFO L131 PetriNetUnfolder]: For 95/95 co-relation queries the response was YES. [2022-12-13 08:41:15,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 167 events. 85/167 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 561 event pairs, 8 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 518. Up to 142 conditions per place. [2022-12-13 08:41:15,577 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 36 selfloop transitions, 4 changer transitions 12/52 dead transitions. [2022-12-13 08:41:15,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 52 transitions, 433 flow [2022-12-13 08:41:15,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 08:41:15,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 08:41:15,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-13 08:41:15,578 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2022-12-13 08:41:15,578 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 7 predicate places. [2022-12-13 08:41:15,579 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 52 transitions, 433 flow [2022-12-13 08:41:15,579 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 40 transitions, 332 flow [2022-12-13 08:41:15,580 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:15,580 INFO L89 Accepts]: Start accepts. Operand has 27 places, 40 transitions, 332 flow [2022-12-13 08:41:15,581 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:15,581 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:15,581 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 40 transitions, 332 flow [2022-12-13 08:41:15,582 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 40 transitions, 332 flow [2022-12-13 08:41:15,582 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:41:15,582 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:41:15,583 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 08:41:15,583 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 40 transitions, 332 flow [2022-12-13 08:41:15,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:15,583 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:15,583 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:15,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 08:41:15,583 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:15,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:15,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1928454682, now seen corresponding path program 1 times [2022-12-13 08:41:15,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:15,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917028059] [2022-12-13 08:41:15,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:15,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:15,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:15,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917028059] [2022-12-13 08:41:15,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917028059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:41:15,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:41:15,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:41:15,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610473865] [2022-12-13 08:41:15,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:41:15,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 08:41:15,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:15,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 08:41:15,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 08:41:15,686 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 08:41:15,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 40 transitions, 332 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:15,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:15,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 08:41:15,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:15,769 INFO L130 PetriNetUnfolder]: 81/157 cut-off events. [2022-12-13 08:41:15,770 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2022-12-13 08:41:15,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 157 events. 81/157 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 458 event pairs, 8 based on Foata normal form. 4/126 useless extension candidates. Maximal degree in co-relation 622. Up to 136 conditions per place. [2022-12-13 08:41:15,772 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 49 selfloop transitions, 6 changer transitions 6/61 dead transitions. [2022-12-13 08:41:15,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 61 transitions, 623 flow [2022-12-13 08:41:15,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 08:41:15,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 08:41:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-12-13 08:41:15,774 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2022-12-13 08:41:15,776 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 10 predicate places. [2022-12-13 08:41:15,776 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 61 transitions, 623 flow [2022-12-13 08:41:15,777 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 55 transitions, 567 flow [2022-12-13 08:41:15,778 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:15,778 INFO L89 Accepts]: Start accepts. Operand has 30 places, 55 transitions, 567 flow [2022-12-13 08:41:15,779 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:15,779 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:15,779 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 55 transitions, 567 flow [2022-12-13 08:41:15,781 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 55 transitions, 567 flow [2022-12-13 08:41:15,782 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:41:15,782 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:41:15,788 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 08:41:15,789 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 55 transitions, 567 flow [2022-12-13 08:41:15,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:15,790 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:15,792 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:15,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 08:41:15,792 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:15,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:15,793 INFO L85 PathProgramCache]: Analyzing trace with hash 22053400, now seen corresponding path program 2 times [2022-12-13 08:41:15,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:15,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414349293] [2022-12-13 08:41:15,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:15,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:15,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:15,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:15,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414349293] [2022-12-13 08:41:15,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414349293] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:41:15,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854229604] [2022-12-13 08:41:15,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:41:15,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:15,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:41:15,981 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:41:15,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 08:41:16,081 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:41:16,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:41:16,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 08:41:16,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:41:16,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:16,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 08:41:16,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854229604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:41:16,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 08:41:16,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-12-13 08:41:16,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375290302] [2022-12-13 08:41:16,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:41:16,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 08:41:16,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:16,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 08:41:16,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 08:41:16,129 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-13 08:41:16,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 55 transitions, 567 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:16,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:16,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-13 08:41:16,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:16,183 INFO L130 PetriNetUnfolder]: 86/162 cut-off events. [2022-12-13 08:41:16,183 INFO L131 PetriNetUnfolder]: For 137/137 co-relation queries the response was YES. [2022-12-13 08:41:16,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 162 events. 86/162 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 458 event pairs, 8 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 780. Up to 143 conditions per place. [2022-12-13 08:41:16,185 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 54 selfloop transitions, 6 changer transitions 0/62 dead transitions. [2022-12-13 08:41:16,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 62 transitions, 756 flow [2022-12-13 08:41:16,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 08:41:16,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 08:41:16,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-13 08:41:16,186 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2022-12-13 08:41:16,186 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 12 predicate places. [2022-12-13 08:41:16,186 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 62 transitions, 756 flow [2022-12-13 08:41:16,187 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 62 transitions, 756 flow [2022-12-13 08:41:16,188 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:16,189 INFO L89 Accepts]: Start accepts. Operand has 33 places, 62 transitions, 756 flow [2022-12-13 08:41:16,189 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:16,189 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:16,189 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 62 transitions, 756 flow [2022-12-13 08:41:16,190 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 62 transitions, 756 flow [2022-12-13 08:41:16,191 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:41:16,191 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:41:16,191 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 08:41:16,192 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 62 transitions, 756 flow [2022-12-13 08:41:16,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:16,192 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:16,192 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:16,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 08:41:16,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:16,398 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:16,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:16,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1325783280, now seen corresponding path program 2 times [2022-12-13 08:41:16,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:16,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639884790] [2022-12-13 08:41:16,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:16,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:16,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:16,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:16,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639884790] [2022-12-13 08:41:16,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639884790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:41:16,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:41:16,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 08:41:16,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950406715] [2022-12-13 08:41:16,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:41:16,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 08:41:16,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:16,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 08:41:16,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 08:41:16,477 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-13 08:41:16,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 62 transitions, 756 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:16,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:16,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-13 08:41:16,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:16,530 INFO L130 PetriNetUnfolder]: 92/172 cut-off events. [2022-12-13 08:41:16,531 INFO L131 PetriNetUnfolder]: For 191/191 co-relation queries the response was YES. [2022-12-13 08:41:16,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1174 conditions, 172 events. 92/172 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 501 event pairs, 8 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 976. Up to 153 conditions per place. [2022-12-13 08:41:16,532 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 58 selfloop transitions, 6 changer transitions 0/67 dead transitions. [2022-12-13 08:41:16,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 67 transitions, 938 flow [2022-12-13 08:41:16,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 08:41:16,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 08:41:16,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-13 08:41:16,533 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45588235294117646 [2022-12-13 08:41:16,534 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 15 predicate places. [2022-12-13 08:41:16,534 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 67 transitions, 938 flow [2022-12-13 08:41:16,536 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 67 transitions, 938 flow [2022-12-13 08:41:16,536 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:16,536 INFO L89 Accepts]: Start accepts. Operand has 36 places, 67 transitions, 938 flow [2022-12-13 08:41:16,537 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:16,537 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:16,538 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 67 transitions, 938 flow [2022-12-13 08:41:16,539 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 67 transitions, 938 flow [2022-12-13 08:41:16,539 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:41:16,540 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:41:16,541 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 08:41:16,541 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 67 transitions, 938 flow [2022-12-13 08:41:16,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:16,542 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:16,542 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:16,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 08:41:16,542 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:16,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:16,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1537929234, now seen corresponding path program 3 times [2022-12-13 08:41:16,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:16,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640545411] [2022-12-13 08:41:16,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:16,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:16,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:16,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:16,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640545411] [2022-12-13 08:41:16,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640545411] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:41:16,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087458399] [2022-12-13 08:41:16,708 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 08:41:16,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:16,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:41:16,721 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:41:16,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 08:41:16,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 08:41:16,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:41:16,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 08:41:16,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:41:16,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:16,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:41:16,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:16,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087458399] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:41:16,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:41:16,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2022-12-13 08:41:16,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826205723] [2022-12-13 08:41:16,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:41:16,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 08:41:16,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:16,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 08:41:16,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-13 08:41:16,938 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 08:41:16,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 67 transitions, 938 flow. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:16,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:16,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 08:41:16,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:17,094 INFO L130 PetriNetUnfolder]: 111/205 cut-off events. [2022-12-13 08:41:17,094 INFO L131 PetriNetUnfolder]: For 217/217 co-relation queries the response was YES. [2022-12-13 08:41:17,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1613 conditions, 205 events. 111/205 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 628 event pairs, 8 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 1388. Up to 186 conditions per place. [2022-12-13 08:41:17,096 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 65 selfloop transitions, 17 changer transitions 0/82 dead transitions. [2022-12-13 08:41:17,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 82 transitions, 1318 flow [2022-12-13 08:41:17,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 08:41:17,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 08:41:17,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-12-13 08:41:17,097 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4369747899159664 [2022-12-13 08:41:17,097 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 21 predicate places. [2022-12-13 08:41:17,097 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 82 transitions, 1318 flow [2022-12-13 08:41:17,099 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 82 transitions, 1318 flow [2022-12-13 08:41:17,100 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:17,100 INFO L89 Accepts]: Start accepts. Operand has 42 places, 82 transitions, 1318 flow [2022-12-13 08:41:17,100 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:17,101 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:17,101 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 82 transitions, 1318 flow [2022-12-13 08:41:17,102 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 82 transitions, 1318 flow [2022-12-13 08:41:17,102 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:41:17,102 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:41:17,102 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 08:41:17,102 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 82 transitions, 1318 flow [2022-12-13 08:41:17,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:17,103 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:17,103 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:17,113 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 08:41:17,303 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,SelfDestructingSolverStorable6 [2022-12-13 08:41:17,304 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:17,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:17,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1647120298, now seen corresponding path program 3 times [2022-12-13 08:41:17,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:17,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094721430] [2022-12-13 08:41:17,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:17,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:17,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:17,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:17,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094721430] [2022-12-13 08:41:17,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094721430] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:41:17,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301680489] [2022-12-13 08:41:17,378 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 08:41:17,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:17,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:41:17,379 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:41:17,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 08:41:17,447 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 08:41:17,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:41:17,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 08:41:17,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:41:17,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:17,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:41:17,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:17,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301680489] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:41:17,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:41:17,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 08:41:17,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989750350] [2022-12-13 08:41:17,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:41:17,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 08:41:17,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:17,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 08:41:17,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-13 08:41:17,510 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 08:41:17,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 82 transitions, 1318 flow. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:17,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:17,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 08:41:17,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:17,635 INFO L130 PetriNetUnfolder]: 111/199 cut-off events. [2022-12-13 08:41:17,635 INFO L131 PetriNetUnfolder]: For 214/214 co-relation queries the response was YES. [2022-12-13 08:41:17,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1762 conditions, 199 events. 111/199 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 587 event pairs, 8 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 1529. Up to 180 conditions per place. [2022-12-13 08:41:17,637 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 66 selfloop transitions, 13 changer transitions 0/79 dead transitions. [2022-12-13 08:41:17,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 79 transitions, 1422 flow [2022-12-13 08:41:17,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 08:41:17,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 08:41:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-12-13 08:41:17,638 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3764705882352941 [2022-12-13 08:41:17,638 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 24 predicate places. [2022-12-13 08:41:17,638 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 79 transitions, 1422 flow [2022-12-13 08:41:17,640 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 79 transitions, 1422 flow [2022-12-13 08:41:17,640 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:17,641 INFO L89 Accepts]: Start accepts. Operand has 45 places, 79 transitions, 1422 flow [2022-12-13 08:41:17,641 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:17,641 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:17,641 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 79 transitions, 1422 flow [2022-12-13 08:41:17,642 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 79 transitions, 1422 flow [2022-12-13 08:41:17,642 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:41:17,643 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:41:17,643 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 08:41:17,643 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 79 transitions, 1422 flow [2022-12-13 08:41:17,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:17,643 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:17,643 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:17,660 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 08:41:17,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:17,849 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:17,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:17,849 INFO L85 PathProgramCache]: Analyzing trace with hash -273483660, now seen corresponding path program 4 times [2022-12-13 08:41:17,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:17,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272007775] [2022-12-13 08:41:17,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:17,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:17,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:17,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:17,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272007775] [2022-12-13 08:41:17,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272007775] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:41:17,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330468351] [2022-12-13 08:41:17,925 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 08:41:17,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:17,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:41:17,941 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:41:17,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 08:41:17,998 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 08:41:17,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:41:17,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 08:41:17,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:41:18,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:18,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:41:18,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:18,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330468351] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:41:18,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:41:18,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 08:41:18,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113378596] [2022-12-13 08:41:18,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:41:18,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 08:41:18,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:18,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 08:41:18,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-13 08:41:18,064 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 08:41:18,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 79 transitions, 1422 flow. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:18,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:18,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 08:41:18,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:18,172 INFO L130 PetriNetUnfolder]: 105/185 cut-off events. [2022-12-13 08:41:18,172 INFO L131 PetriNetUnfolder]: For 210/210 co-relation queries the response was YES. [2022-12-13 08:41:18,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1820 conditions, 185 events. 105/185 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 525 event pairs, 8 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 1583. Up to 166 conditions per place. [2022-12-13 08:41:18,173 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 58 selfloop transitions, 14 changer transitions 0/72 dead transitions. [2022-12-13 08:41:18,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 72 transitions, 1434 flow [2022-12-13 08:41:18,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 08:41:18,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 08:41:18,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-12-13 08:41:18,174 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-13 08:41:18,174 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 27 predicate places. [2022-12-13 08:41:18,175 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 72 transitions, 1434 flow [2022-12-13 08:41:18,176 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 72 transitions, 1434 flow [2022-12-13 08:41:18,177 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:18,177 INFO L89 Accepts]: Start accepts. Operand has 48 places, 72 transitions, 1434 flow [2022-12-13 08:41:18,178 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:18,178 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:18,178 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 72 transitions, 1434 flow [2022-12-13 08:41:18,179 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 72 transitions, 1434 flow [2022-12-13 08:41:18,179 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:41:18,179 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:41:18,179 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 08:41:18,179 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 72 transitions, 1434 flow [2022-12-13 08:41:18,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:18,180 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:18,180 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:18,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 08:41:18,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:18,394 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:18,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:18,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1720729894, now seen corresponding path program 1 times [2022-12-13 08:41:18,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:18,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208120655] [2022-12-13 08:41:18,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:18,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:18,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:41:18,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:18,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208120655] [2022-12-13 08:41:18,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208120655] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:41:18,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071346933] [2022-12-13 08:41:18,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:18,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:18,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:41:18,521 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:41:18,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 08:41:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:18,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-13 08:41:18,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:41:18,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 08:41:18,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 08:41:18,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 08:41:18,723 INFO L321 Elim1Store]: treesize reduction 23, result has 58.2 percent of original size [2022-12-13 08:41:18,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 54 [2022-12-13 08:41:18,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:18,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:41:20,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:20,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071346933] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:41:20,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:41:20,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-13 08:41:20,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842771148] [2022-12-13 08:41:20,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:41:20,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 08:41:20,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:20,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 08:41:20,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=144, Unknown=3, NotChecked=0, Total=182 [2022-12-13 08:41:20,907 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-13 08:41:20,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 72 transitions, 1434 flow. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:20,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:20,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-13 08:41:20,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:21,659 INFO L130 PetriNetUnfolder]: 315/553 cut-off events. [2022-12-13 08:41:21,659 INFO L131 PetriNetUnfolder]: For 877/877 co-relation queries the response was YES. [2022-12-13 08:41:21,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5948 conditions, 553 events. 315/553 cut-off events. For 877/877 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2288 event pairs, 10 based on Foata normal form. 2/465 useless extension candidates. Maximal degree in co-relation 3737. Up to 498 conditions per place. [2022-12-13 08:41:21,662 INFO L137 encePairwiseOnDemand]: 8/17 looper letters, 66 selfloop transitions, 24 changer transitions 125/218 dead transitions. [2022-12-13 08:41:21,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 218 transitions, 4832 flow [2022-12-13 08:41:21,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 08:41:21,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 08:41:21,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 141 transitions. [2022-12-13 08:41:21,665 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3770053475935829 [2022-12-13 08:41:21,665 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 48 predicate places. [2022-12-13 08:41:21,666 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 218 transitions, 4832 flow [2022-12-13 08:41:21,669 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 93 transitions, 2034 flow [2022-12-13 08:41:21,672 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:21,672 INFO L89 Accepts]: Start accepts. Operand has 60 places, 93 transitions, 2034 flow [2022-12-13 08:41:21,673 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:21,673 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:21,674 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 93 transitions, 2034 flow [2022-12-13 08:41:21,675 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 93 transitions, 2034 flow [2022-12-13 08:41:21,675 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:41:21,677 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [630] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_3| v_~f~0.base_In_1) (+ v_~f~0.offset_In_1 (* v_~x1~0_In_1 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod (* 3 v_~n~0_In_3) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_3|, ~n~0=v_~n~0_In_3, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_1} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_1, ~f~0.base=v_~f~0.base_In_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_3, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~x1~0] and [626] L85-3-->L86-3: Formula: (and (= |v_#memory_int_115| (store |v_#memory_int_116| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_116| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_29|))) (= |v_ULTIMATE.start_main_#t~pre14#1_29| |v_#pthreadsForks_52|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_116|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_37|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_29|, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #memory_int=|v_#memory_int_115|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] [2022-12-13 08:41:23,516 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 08:41:23,517 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1845 [2022-12-13 08:41:23,517 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 90 transitions, 1976 flow [2022-12-13 08:41:23,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:23,518 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:23,518 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:23,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 08:41:23,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 08:41:23,723 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:23,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:23,723 INFO L85 PathProgramCache]: Analyzing trace with hash -359385205, now seen corresponding path program 1 times [2022-12-13 08:41:23,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:23,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394666329] [2022-12-13 08:41:23,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:23,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:23,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:23,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:23,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394666329] [2022-12-13 08:41:23,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394666329] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:41:23,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484025212] [2022-12-13 08:41:23,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:23,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:23,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:41:23,948 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:41:23,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 08:41:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:24,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-13 08:41:24,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:41:24,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-13 08:41:24,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 08:41:24,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 08:41:24,121 INFO L321 Elim1Store]: treesize reduction 33, result has 52.2 percent of original size [2022-12-13 08:41:24,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 6 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 62 [2022-12-13 08:41:24,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:24,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:41:24,256 WARN L837 $PredicateComparison]: unable to prove that (forall ((~x1~0 Int) (~x2~0 Int) (v_ArrVal_266 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_266) c_~f~0.base))) (let ((.cse1 (select .cse0 (+ (* (select .cse0 (+ c_~f~0.offset (* ~x2~0 4))) 4) c_~f~0.offset)))) (or (< ~x1~0 0) (= (select .cse0 (+ c_~f~0.offset (* .cse1 4))) (select .cse0 (+ (* ~x1~0 4) c_~f~0.offset))) (<= c_~size~0 ~x1~0) (<= c_~size~0 .cse1) (< .cse1 0))))) is different from false [2022-12-13 08:41:24,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:24,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484025212] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:41:24,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:41:24,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-13 08:41:24,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511510339] [2022-12-13 08:41:24,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:41:24,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 08:41:24,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:24,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 08:41:24,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=85, Unknown=1, NotChecked=18, Total=132 [2022-12-13 08:41:24,271 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-13 08:41:24,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 90 transitions, 1976 flow. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 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 08:41:24,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:24,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-13 08:41:24,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:24,723 INFO L130 PetriNetUnfolder]: 219/386 cut-off events. [2022-12-13 08:41:24,724 INFO L131 PetriNetUnfolder]: For 756/756 co-relation queries the response was YES. [2022-12-13 08:41:24,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4546 conditions, 386 events. 219/386 cut-off events. For 756/756 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1424 event pairs, 4 based on Foata normal form. 1/320 useless extension candidates. Maximal degree in co-relation 2239. Up to 355 conditions per place. [2022-12-13 08:41:24,729 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 108 selfloop transitions, 17 changer transitions 24/152 dead transitions. [2022-12-13 08:41:24,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 152 transitions, 3668 flow [2022-12-13 08:41:24,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 08:41:24,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 08:41:24,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 87 transitions. [2022-12-13 08:41:24,730 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32706766917293234 [2022-12-13 08:41:24,731 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 49 predicate places. [2022-12-13 08:41:24,731 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 152 transitions, 3668 flow [2022-12-13 08:41:24,734 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 128 transitions, 3086 flow [2022-12-13 08:41:24,737 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:24,737 INFO L89 Accepts]: Start accepts. Operand has 66 places, 128 transitions, 3086 flow [2022-12-13 08:41:24,739 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:24,739 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:24,740 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 128 transitions, 3086 flow [2022-12-13 08:41:24,741 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 128 transitions, 3086 flow [2022-12-13 08:41:24,741 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:41:24,742 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:41:24,743 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 08:41:24,743 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 128 transitions, 3086 flow [2022-12-13 08:41:24,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 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 08:41:24,743 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:24,743 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:24,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 08:41:24,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:24,949 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:24,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:24,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1991361207, now seen corresponding path program 2 times [2022-12-13 08:41:24,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:24,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843515979] [2022-12-13 08:41:24,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:24,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:25,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:25,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:25,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843515979] [2022-12-13 08:41:25,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843515979] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:41:25,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756806988] [2022-12-13 08:41:25,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:41:25,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:25,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:41:25,645 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:41:25,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 08:41:25,721 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:41:25,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:41:25,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 08:41:25,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:41:25,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-13 08:41:25,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 08:41:25,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 08:41:25,863 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:41:25,876 INFO L321 Elim1Store]: treesize reduction 38, result has 20.8 percent of original size [2022-12-13 08:41:25,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 32 [2022-12-13 08:41:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:41:25,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:41:26,060 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int)) (v_~x1~0_108 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_305) c_~f~0.base))) (let ((.cse0 (select .cse1 (+ (* c_~x2~0 4) c_~f~0.offset)))) (or (not (< .cse0 c_~size~0)) (not (<= 0 .cse0)) (<= c_~size~0 v_~x1~0_108) (= (select .cse1 (+ c_~f~0.offset (* (select .cse1 (+ c_~f~0.offset (* 4 .cse0))) 4))) (select .cse1 (+ c_~f~0.offset (* v_~x1~0_108 4)))) (< v_~x1~0_108 0))))) is different from false [2022-12-13 08:41:26,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:41:26,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756806988] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:41:26,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:41:26,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-13 08:41:26,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132501593] [2022-12-13 08:41:26,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:41:26,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 08:41:26,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:26,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 08:41:26,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=107, Unknown=1, NotChecked=22, Total=182 [2022-12-13 08:41:26,074 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-13 08:41:26,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 128 transitions, 3086 flow. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:26,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:26,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-13 08:41:26,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:26,258 INFO L130 PetriNetUnfolder]: 175/316 cut-off events. [2022-12-13 08:41:26,258 INFO L131 PetriNetUnfolder]: For 1028/1028 co-relation queries the response was YES. [2022-12-13 08:41:26,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3988 conditions, 316 events. 175/316 cut-off events. For 1028/1028 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1137 event pairs, 4 based on Foata normal form. 1/270 useless extension candidates. Maximal degree in co-relation 2412. Up to 285 conditions per place. [2022-12-13 08:41:26,261 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 74 selfloop transitions, 7 changer transitions 40/127 dead transitions. [2022-12-13 08:41:26,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 127 transitions, 3304 flow [2022-12-13 08:41:26,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:41:26,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 08:41:26,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-12-13 08:41:26,262 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2022-12-13 08:41:26,263 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 50 predicate places. [2022-12-13 08:41:26,263 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 127 transitions, 3304 flow [2022-12-13 08:41:26,265 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 87 transitions, 2235 flow [2022-12-13 08:41:26,268 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:26,268 INFO L89 Accepts]: Start accepts. Operand has 62 places, 87 transitions, 2235 flow [2022-12-13 08:41:26,269 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:26,269 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:26,269 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 87 transitions, 2235 flow [2022-12-13 08:41:26,271 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 87 transitions, 2235 flow [2022-12-13 08:41:26,271 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:41:26,271 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:41:26,272 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 08:41:26,272 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 87 transitions, 2235 flow [2022-12-13 08:41:26,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:26,272 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:26,272 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:26,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 08:41:26,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:26,477 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:26,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:26,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1224056861, now seen corresponding path program 1 times [2022-12-13 08:41:26,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:26,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027370366] [2022-12-13 08:41:26,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:26,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:26,714 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 08:41:26,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:26,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027370366] [2022-12-13 08:41:26,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027370366] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:41:26,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141318524] [2022-12-13 08:41:26,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:26,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:26,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:41:26,716 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:41:26,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 08:41:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:26,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 08:41:26,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:41:26,972 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 08:41:26,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:41:27,082 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 08:41:27,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141318524] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:41:27,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:41:27,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-13 08:41:27,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757035406] [2022-12-13 08:41:27,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:41:27,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 08:41:27,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:27,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 08:41:27,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-12-13 08:41:27,083 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-13 08:41:27,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 87 transitions, 2235 flow. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 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 08:41:27,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:27,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-13 08:41:27,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:27,738 INFO L130 PetriNetUnfolder]: 233/391 cut-off events. [2022-12-13 08:41:27,738 INFO L131 PetriNetUnfolder]: For 1338/1338 co-relation queries the response was YES. [2022-12-13 08:41:27,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5338 conditions, 391 events. 233/391 cut-off events. For 1338/1338 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1370 event pairs, 0 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 4850. Up to 362 conditions per place. [2022-12-13 08:41:27,742 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 118 selfloop transitions, 43 changer transitions 0/164 dead transitions. [2022-12-13 08:41:27,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 164 transitions, 4571 flow [2022-12-13 08:41:27,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 08:41:27,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 08:41:27,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2022-12-13 08:41:27,743 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37967914438502676 [2022-12-13 08:41:27,743 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 51 predicate places. [2022-12-13 08:41:27,743 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 164 transitions, 4571 flow [2022-12-13 08:41:27,748 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 164 transitions, 4571 flow [2022-12-13 08:41:27,751 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:27,751 INFO L89 Accepts]: Start accepts. Operand has 72 places, 164 transitions, 4571 flow [2022-12-13 08:41:27,752 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:27,752 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:27,753 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 164 transitions, 4571 flow [2022-12-13 08:41:27,754 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 164 transitions, 4571 flow [2022-12-13 08:41:27,755 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:41:27,755 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:41:27,755 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 08:41:27,755 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 164 transitions, 4571 flow [2022-12-13 08:41:27,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 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 08:41:27,756 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:27,756 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:27,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 08:41:27,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 08:41:27,961 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:27,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:27,961 INFO L85 PathProgramCache]: Analyzing trace with hash -617482369, now seen corresponding path program 2 times [2022-12-13 08:41:27,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:27,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097384165] [2022-12-13 08:41:27,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:27,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:28,865 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:28,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:28,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097384165] [2022-12-13 08:41:28,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097384165] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:41:28,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023142503] [2022-12-13 08:41:28,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:41:28,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:28,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:41:28,867 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:41:28,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 08:41:28,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:41:28,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:41:28,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 08:41:28,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:41:29,067 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:41:29,068 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2022-12-13 08:41:29,080 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:29,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:41:29,274 INFO L321 Elim1Store]: treesize reduction 15, result has 90.4 percent of original size [2022-12-13 08:41:29,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 177 [2022-12-13 08:41:29,525 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:41:29,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023142503] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:41:29,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:41:29,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 4] total 15 [2022-12-13 08:41:29,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141025440] [2022-12-13 08:41:29,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:41:29,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 08:41:29,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:29,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 08:41:29,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-12-13 08:41:29,526 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-13 08:41:29,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 164 transitions, 4571 flow. Second operand has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 17 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:29,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:29,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-13 08:41:29,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:30,104 INFO L130 PetriNetUnfolder]: 510/858 cut-off events. [2022-12-13 08:41:30,104 INFO L131 PetriNetUnfolder]: For 2750/2750 co-relation queries the response was YES. [2022-12-13 08:41:30,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12593 conditions, 858 events. 510/858 cut-off events. For 2750/2750 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3499 event pairs, 2 based on Foata normal form. 1/693 useless extension candidates. Maximal degree in co-relation 10070. Up to 807 conditions per place. [2022-12-13 08:41:30,113 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 246 selfloop transitions, 89 changer transitions 1/342 dead transitions. [2022-12-13 08:41:30,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 342 transitions, 10266 flow [2022-12-13 08:41:30,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 08:41:30,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 08:41:30,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 126 transitions. [2022-12-13 08:41:30,114 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4632352941176471 [2022-12-13 08:41:30,114 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 66 predicate places. [2022-12-13 08:41:30,115 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 342 transitions, 10266 flow [2022-12-13 08:41:30,123 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 341 transitions, 10233 flow [2022-12-13 08:41:30,131 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:30,131 INFO L89 Accepts]: Start accepts. Operand has 87 places, 341 transitions, 10233 flow [2022-12-13 08:41:30,134 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:30,135 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:30,135 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 341 transitions, 10233 flow [2022-12-13 08:41:30,139 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 341 transitions, 10233 flow [2022-12-13 08:41:30,140 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:41:32,318 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 08:41:32,319 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2188 [2022-12-13 08:41:32,319 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 340 transitions, 10203 flow [2022-12-13 08:41:32,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 17 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:32,319 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:32,319 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:32,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 08:41:32,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 08:41:32,520 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:32,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:32,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1837146697, now seen corresponding path program 1 times [2022-12-13 08:41:32,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:32,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037242369] [2022-12-13 08:41:32,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:32,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:33,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:33,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037242369] [2022-12-13 08:41:33,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037242369] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:41:33,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094739080] [2022-12-13 08:41:33,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:33,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:33,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:41:33,604 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:41:33,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 08:41:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:33,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 08:41:33,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:41:33,783 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:41:33,783 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2022-12-13 08:41:33,791 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:33,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:41:33,956 INFO L321 Elim1Store]: treesize reduction 15, result has 90.4 percent of original size [2022-12-13 08:41:33,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 177 [2022-12-13 08:41:34,179 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:41:34,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094739080] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:41:34,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:41:34,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 13 [2022-12-13 08:41:34,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827241244] [2022-12-13 08:41:34,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:41:34,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 08:41:34,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:34,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 08:41:34,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-12-13 08:41:34,181 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-13 08:41:34,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 340 transitions, 10203 flow. Second operand has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:34,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:34,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-13 08:41:34,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:34,909 INFO L130 PetriNetUnfolder]: 823/1382 cut-off events. [2022-12-13 08:41:34,909 INFO L131 PetriNetUnfolder]: For 4002/4002 co-relation queries the response was YES. [2022-12-13 08:41:34,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21771 conditions, 1382 events. 823/1382 cut-off events. For 4002/4002 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6455 event pairs, 10 based on Foata normal form. 2/1074 useless extension candidates. Maximal degree in co-relation 16717. Up to 1327 conditions per place. [2022-12-13 08:41:34,922 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 398 selfloop transitions, 124 changer transitions 2/530 dead transitions. [2022-12-13 08:41:34,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 530 transitions, 16996 flow [2022-12-13 08:41:34,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 08:41:34,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 08:41:34,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 128 transitions. [2022-12-13 08:41:34,924 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2022-12-13 08:41:34,924 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 78 predicate places. [2022-12-13 08:41:34,924 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 530 transitions, 16996 flow [2022-12-13 08:41:34,970 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 528 transitions, 16926 flow [2022-12-13 08:41:34,984 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:34,984 INFO L89 Accepts]: Start accepts. Operand has 99 places, 528 transitions, 16926 flow [2022-12-13 08:41:34,990 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:34,990 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:34,990 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 528 transitions, 16926 flow [2022-12-13 08:41:34,998 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 528 transitions, 16926 flow [2022-12-13 08:41:34,999 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:41:34,999 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:41:35,000 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 08:41:35,000 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 528 transitions, 16926 flow [2022-12-13 08:41:35,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:35,002 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:35,002 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:35,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 08:41:35,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 08:41:35,207 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:35,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:35,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1640199075, now seen corresponding path program 2 times [2022-12-13 08:41:35,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:35,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545243619] [2022-12-13 08:41:35,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:35,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:36,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:36,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:36,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545243619] [2022-12-13 08:41:36,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545243619] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:41:36,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180343282] [2022-12-13 08:41:36,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:41:36,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:36,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:41:36,495 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:41:36,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 08:41:36,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:41:36,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:41:36,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 08:41:36,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:41:36,669 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:41:36,669 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2022-12-13 08:41:36,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:36,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:41:36,858 INFO L321 Elim1Store]: treesize reduction 15, result has 90.4 percent of original size [2022-12-13 08:41:36,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 177 [2022-12-13 08:41:37,084 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 08:41:37,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180343282] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:41:37,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:41:37,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 13 [2022-12-13 08:41:37,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442030297] [2022-12-13 08:41:37,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:41:37,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 08:41:37,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:37,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 08:41:37,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-12-13 08:41:37,085 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-13 08:41:37,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 528 transitions, 16926 flow. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:37,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:37,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-13 08:41:37,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:37,915 INFO L130 PetriNetUnfolder]: 1049/1789 cut-off events. [2022-12-13 08:41:37,915 INFO L131 PetriNetUnfolder]: For 6297/6297 co-relation queries the response was YES. [2022-12-13 08:41:37,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29936 conditions, 1789 events. 1049/1789 cut-off events. For 6297/6297 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8720 event pairs, 2 based on Foata normal form. 2/1372 useless extension candidates. Maximal degree in co-relation 21908. Up to 1722 conditions per place. [2022-12-13 08:41:37,928 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 557 selfloop transitions, 118 changer transitions 4/685 dead transitions. [2022-12-13 08:41:37,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 685 transitions, 23386 flow [2022-12-13 08:41:37,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 08:41:37,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 08:41:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2022-12-13 08:41:37,930 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5353535353535354 [2022-12-13 08:41:37,930 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 88 predicate places. [2022-12-13 08:41:37,930 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 685 transitions, 23386 flow [2022-12-13 08:41:37,947 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 681 transitions, 23244 flow [2022-12-13 08:41:37,958 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:37,958 INFO L89 Accepts]: Start accepts. Operand has 109 places, 681 transitions, 23244 flow [2022-12-13 08:41:37,966 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:37,966 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:37,967 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 681 transitions, 23244 flow [2022-12-13 08:41:37,980 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 681 transitions, 23244 flow [2022-12-13 08:41:37,980 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:41:37,981 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:41:37,982 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 08:41:37,982 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 681 transitions, 23244 flow [2022-12-13 08:41:37,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:37,982 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:37,982 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:38,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 08:41:38,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 08:41:38,188 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:38,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:38,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1265905417, now seen corresponding path program 3 times [2022-12-13 08:41:38,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:38,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322118346] [2022-12-13 08:41:38,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:38,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:38,898 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:38,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:38,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322118346] [2022-12-13 08:41:38,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322118346] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:41:38,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891401346] [2022-12-13 08:41:38,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 08:41:38,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:38,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:41:38,899 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:41:38,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 08:41:38,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 08:41:38,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:41:39,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 08:41:39,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:41:39,097 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:41:39,098 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2022-12-13 08:41:39,105 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:39,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:41:39,260 INFO L321 Elim1Store]: treesize reduction 15, result has 90.4 percent of original size [2022-12-13 08:41:39,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 177 [2022-12-13 08:41:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:39,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891401346] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:41:39,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:41:39,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 13 [2022-12-13 08:41:39,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886577843] [2022-12-13 08:41:39,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:41:39,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 08:41:39,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:39,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 08:41:39,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-12-13 08:41:39,522 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-13 08:41:39,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 681 transitions, 23244 flow. Second operand has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:39,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:39,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-13 08:41:39,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:40,710 INFO L130 PetriNetUnfolder]: 1517/2590 cut-off events. [2022-12-13 08:41:40,710 INFO L131 PetriNetUnfolder]: For 7995/7995 co-relation queries the response was YES. [2022-12-13 08:41:40,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46079 conditions, 2590 events. 1517/2590 cut-off events. For 7995/7995 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 13930 event pairs, 2 based on Foata normal form. 3/1944 useless extension candidates. Maximal degree in co-relation 35405. Up to 2519 conditions per place. [2022-12-13 08:41:40,727 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 808 selfloop transitions, 150 changer transitions 5/969 dead transitions. [2022-12-13 08:41:40,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 969 transitions, 35034 flow [2022-12-13 08:41:40,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 08:41:40,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 08:41:40,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 134 transitions. [2022-12-13 08:41:40,728 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4652777777777778 [2022-12-13 08:41:40,728 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 103 predicate places. [2022-12-13 08:41:40,728 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 969 transitions, 35034 flow [2022-12-13 08:41:40,752 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 964 transitions, 34845 flow [2022-12-13 08:41:40,768 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:40,768 INFO L89 Accepts]: Start accepts. Operand has 124 places, 964 transitions, 34845 flow [2022-12-13 08:41:40,783 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:40,783 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:40,783 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 964 transitions, 34845 flow [2022-12-13 08:41:40,802 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 964 transitions, 34845 flow [2022-12-13 08:41:40,802 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:41:40,804 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:41:40,804 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-13 08:41:40,805 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 964 transitions, 34845 flow [2022-12-13 08:41:40,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:40,805 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:40,805 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:40,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 08:41:41,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 08:41:41,024 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:41,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:41,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1764255123, now seen corresponding path program 4 times [2022-12-13 08:41:41,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:41,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542197681] [2022-12-13 08:41:41,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:41,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:41,939 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:41,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:41,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542197681] [2022-12-13 08:41:41,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542197681] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:41:41,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271886263] [2022-12-13 08:41:41,939 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 08:41:41,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:41,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:41:41,941 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:41:41,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 08:41:42,050 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 08:41:42,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:41:42,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 08:41:42,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:41:42,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:41:42,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 08:41:42,190 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:41:42,190 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2022-12-13 08:41:42,199 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:42,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:41:42,263 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_522 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_522) c_~f~0.base))) (= (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* c_~x1~0 4) c_~f~0.offset)) 4))) (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset)) 4))) 4)))))) is different from false [2022-12-13 08:41:42,331 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:41:42,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 102 treesize of output 234 [2022-12-13 08:41:42,383 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:41:42,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 140 [2022-12-13 08:41:43,281 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:43,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271886263] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:41:43,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:41:43,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-13 08:41:43,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384460911] [2022-12-13 08:41:43,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:41:43,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:41:43,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:43,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:41:43,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=231, Unknown=1, NotChecked=30, Total=306 [2022-12-13 08:41:43,283 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-13 08:41:43,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 964 transitions, 34845 flow. Second operand has 18 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 18 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:43,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:43,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-13 08:41:43,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:49,128 INFO L130 PetriNetUnfolder]: 1765/3038 cut-off events. [2022-12-13 08:41:49,129 INFO L131 PetriNetUnfolder]: For 9987/9987 co-relation queries the response was YES. [2022-12-13 08:41:49,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57107 conditions, 3038 events. 1765/3038 cut-off events. For 9987/9987 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 17154 event pairs, 4 based on Foata normal form. 2/2276 useless extension candidates. Maximal degree in co-relation 42456. Up to 2965 conditions per place. [2022-12-13 08:41:49,155 INFO L137 encePairwiseOnDemand]: 9/18 looper letters, 941 selfloop transitions, 198 changer transitions 2/1147 dead transitions. [2022-12-13 08:41:49,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 1147 transitions, 43766 flow [2022-12-13 08:41:49,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 08:41:49,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 08:41:49,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 131 transitions. [2022-12-13 08:41:49,156 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4548611111111111 [2022-12-13 08:41:49,156 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 118 predicate places. [2022-12-13 08:41:49,156 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 1147 transitions, 43766 flow [2022-12-13 08:41:49,191 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 1145 transitions, 43684 flow [2022-12-13 08:41:49,219 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:41:49,220 INFO L89 Accepts]: Start accepts. Operand has 139 places, 1145 transitions, 43684 flow [2022-12-13 08:41:49,239 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:41:49,239 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:41:49,239 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 1145 transitions, 43684 flow [2022-12-13 08:41:49,265 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 1145 transitions, 43684 flow [2022-12-13 08:41:49,266 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:41:49,268 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:41:49,268 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-13 08:41:49,269 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 1145 transitions, 43684 flow [2022-12-13 08:41:49,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 18 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:49,269 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:41:49,269 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:41:49,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 08:41:49,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 08:41:49,474 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:41:49,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:41:49,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1006456183, now seen corresponding path program 5 times [2022-12-13 08:41:49,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:41:49,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271672891] [2022-12-13 08:41:49,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:41:49,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:41:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:41:50,556 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:50,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:41:50,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271672891] [2022-12-13 08:41:50,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271672891] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:41:50,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44520497] [2022-12-13 08:41:50,557 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 08:41:50,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:41:50,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:41:50,568 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:41:50,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 08:41:50,654 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-12-13 08:41:50,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:41:50,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 08:41:50,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:41:50,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:41:50,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-12-13 08:41:50,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 08:41:50,861 INFO L321 Elim1Store]: treesize reduction 88, result has 29.0 percent of original size [2022-12-13 08:41:50,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 41 treesize of output 62 [2022-12-13 08:41:50,894 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:50,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:41:51,107 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:41:51,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 104 treesize of output 228 [2022-12-13 08:41:51,142 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:41:51,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 92 [2022-12-13 08:41:51,961 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:41:51,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44520497] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:41:51,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:41:51,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-13 08:41:51,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026515380] [2022-12-13 08:41:51,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:41:51,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:41:51,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:41:51,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:41:51,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=263, Unknown=2, NotChecked=0, Total=306 [2022-12-13 08:41:51,963 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-13 08:41:51,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 1145 transitions, 43684 flow. Second operand has 18 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 18 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:41:51,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:41:51,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-13 08:41:51,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:41:57,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:42:01,329 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 08:42:01,435 INFO L130 PetriNetUnfolder]: 2016/3479 cut-off events. [2022-12-13 08:42:01,435 INFO L131 PetriNetUnfolder]: For 12272/12272 co-relation queries the response was YES. [2022-12-13 08:42:01,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68892 conditions, 3479 events. 2016/3479 cut-off events. For 12272/12272 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 20272 event pairs, 12 based on Foata normal form. 1/2590 useless extension candidates. Maximal degree in co-relation 50448. Up to 3404 conditions per place. [2022-12-13 08:42:01,461 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 1119 selfloop transitions, 189 changer transitions 2/1316 dead transitions. [2022-12-13 08:42:01,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 1316 transitions, 52856 flow [2022-12-13 08:42:01,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 08:42:01,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 08:42:01,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 107 transitions. [2022-12-13 08:42:01,462 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45726495726495725 [2022-12-13 08:42:01,463 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 130 predicate places. [2022-12-13 08:42:01,463 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 1316 transitions, 52856 flow [2022-12-13 08:42:01,498 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 1314 transitions, 52773 flow [2022-12-13 08:42:01,530 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:42:01,530 INFO L89 Accepts]: Start accepts. Operand has 151 places, 1314 transitions, 52773 flow [2022-12-13 08:42:01,565 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:42:01,565 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:42:01,566 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 1314 transitions, 52773 flow [2022-12-13 08:42:01,603 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 1314 transitions, 52773 flow [2022-12-13 08:42:01,603 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:42:01,605 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:42:01,606 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-13 08:42:01,606 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 1314 transitions, 52773 flow [2022-12-13 08:42:01,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 18 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:42:01,606 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:42:01,606 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:42:01,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 08:42:01,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:42:01,811 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:42:01,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:42:01,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1613695321, now seen corresponding path program 6 times [2022-12-13 08:42:01,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:42:01,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077377382] [2022-12-13 08:42:01,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:42:01,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:42:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:42:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:42:02,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:42:02,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077377382] [2022-12-13 08:42:02,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077377382] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:42:02,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738225573] [2022-12-13 08:42:02,950 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 08:42:02,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:42:02,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:42:02,952 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:42:02,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 08:42:03,067 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 08:42:03,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:42:03,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 08:42:03,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:42:03,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:42:03,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-12-13 08:42:03,215 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:42:03,216 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2022-12-13 08:42:03,226 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:42:03,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:42:05,463 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:42:05,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 104 treesize of output 228 [2022-12-13 08:42:05,504 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:42:05,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 92 [2022-12-13 08:42:06,236 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:42:06,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738225573] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:42:06,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:42:06,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-13 08:42:06,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004682493] [2022-12-13 08:42:06,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:42:06,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:42:06,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:42:06,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:42:06,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=253, Unknown=8, NotChecked=0, Total=306 [2022-12-13 08:42:06,237 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-13 08:42:06,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 1314 transitions, 52773 flow. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:42:06,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:42:06,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-13 08:42:06,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:42:06,759 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~f~0.base)) (.cse1 (+ (* c_~x2~0 4) c_~f~0.offset))) (and (= (select .cse0 (+ c_~f~0.offset (* 4 (select .cse0 (+ (* (select .cse0 .cse1) 4) c_~f~0.offset))))) c_~x1~0) (forall ((v_ArrVal_600 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_600) c_~f~0.base))) (= (select .cse2 (+ c_~f~0.offset (* (select .cse0 (+ (* c_~x1~0 4) c_~f~0.offset)) 4))) (select .cse2 (+ (* 4 (select .cse2 (+ (* (select .cse2 .cse1) 4) c_~f~0.offset))) c_~f~0.offset))))))) is different from false [2022-12-13 08:42:08,864 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 08:42:11,267 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 08:42:12,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:42:15,719 INFO L130 PetriNetUnfolder]: 2168/3732 cut-off events. [2022-12-13 08:42:15,720 INFO L131 PetriNetUnfolder]: For 15545/15545 co-relation queries the response was YES. [2022-12-13 08:42:15,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77543 conditions, 3732 events. 2168/3732 cut-off events. For 15545/15545 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 22087 event pairs, 13 based on Foata normal form. 2/2772 useless extension candidates. Maximal degree in co-relation 56156. Up to 3651 conditions per place. [2022-12-13 08:42:15,748 INFO L137 encePairwiseOnDemand]: 8/18 looper letters, 1293 selfloop transitions, 169 changer transitions 6/1474 dead transitions. [2022-12-13 08:42:15,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 1474 transitions, 62154 flow [2022-12-13 08:42:15,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 08:42:15,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 08:42:15,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 107 transitions. [2022-12-13 08:42:15,749 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4246031746031746 [2022-12-13 08:42:15,749 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 143 predicate places. [2022-12-13 08:42:15,750 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 1474 transitions, 62154 flow [2022-12-13 08:42:15,790 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 1468 transitions, 61896 flow [2022-12-13 08:42:15,818 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:42:15,818 INFO L89 Accepts]: Start accepts. Operand has 164 places, 1468 transitions, 61896 flow [2022-12-13 08:42:15,839 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:42:15,839 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:42:15,839 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 1468 transitions, 61896 flow [2022-12-13 08:42:15,867 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 1468 transitions, 61896 flow [2022-12-13 08:42:15,867 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:42:15,870 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:42:15,871 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-13 08:42:15,871 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 1468 transitions, 61896 flow [2022-12-13 08:42:15,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:42:15,871 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:42:15,871 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:42:15,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 08:42:16,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:42:16,076 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:42:16,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:42:16,079 INFO L85 PathProgramCache]: Analyzing trace with hash -746873719, now seen corresponding path program 7 times [2022-12-13 08:42:16,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:42:16,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070589970] [2022-12-13 08:42:16,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:42:16,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:42:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:42:17,336 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:42:17,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:42:17,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070589970] [2022-12-13 08:42:17,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070589970] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:42:17,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727562235] [2022-12-13 08:42:17,337 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 08:42:17,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:42:17,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:42:17,338 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:42:17,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 08:42:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:42:17,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 08:42:17,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:42:17,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:42:17,539 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 30 treesize of output 28 [2022-12-13 08:42:17,583 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:42:17,583 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2022-12-13 08:42:17,598 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:42:17,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:42:17,627 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_639 (Array Int Int))) (= c_~x1~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_639) c_~f~0.base))) (select .cse0 (+ (* (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset)) 4))) 4) c_~f~0.offset))))) is different from false [2022-12-13 08:42:17,660 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_639 (Array Int Int))) (= (let ((.cse0 (select |c_#memory_int| c_~f~0.base))) (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* c_~x1~0 4) c_~f~0.offset)) 4)))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_639) c_~f~0.base))) (select .cse1 (+ (* (select .cse1 (+ c_~f~0.offset (* (select .cse1 (+ (* c_~x2~0 4) c_~f~0.offset)) 4))) 4) c_~f~0.offset))))) is different from false [2022-12-13 08:42:17,726 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:42:17,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 106 treesize of output 222 [2022-12-13 08:42:17,749 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:42:17,749 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 56 [2022-12-13 08:42:18,299 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-13 08:42:18,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727562235] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:42:18,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:42:18,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-13 08:42:18,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397079069] [2022-12-13 08:42:18,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:42:18,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:42:18,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:42:18,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:42:18,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=202, Unknown=3, NotChecked=58, Total=306 [2022-12-13 08:42:18,301 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-13 08:42:18,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 1468 transitions, 61896 flow. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:42:18,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:42:18,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-13 08:42:18,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:42:21,872 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 08:42:22,592 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* c_~x2~0 4) c_~f~0.offset))) (and (= (let ((.cse0 (select |c_#memory_int| c_~f~0.base))) (select .cse0 (+ c_~f~0.offset (* 4 (select .cse0 (+ (* (select .cse0 .cse1) 4) c_~f~0.offset)))))) c_~x1~0) (forall ((v_ArrVal_639 (Array Int Int))) (= c_~x1~0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_639) c_~f~0.base))) (select .cse2 (+ (* (select .cse2 (+ c_~f~0.offset (* (select .cse2 .cse1) 4))) 4) c_~f~0.offset))))))) is different from false [2022-12-13 08:42:24,069 INFO L130 PetriNetUnfolder]: 2377/4116 cut-off events. [2022-12-13 08:42:24,069 INFO L131 PetriNetUnfolder]: For 19352/19352 co-relation queries the response was YES. [2022-12-13 08:42:24,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89581 conditions, 4116 events. 2377/4116 cut-off events. For 19352/19352 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 25129 event pairs, 9 based on Foata normal form. 2/3050 useless extension candidates. Maximal degree in co-relation 64444. Up to 4029 conditions per place. [2022-12-13 08:42:24,103 INFO L137 encePairwiseOnDemand]: 8/18 looper letters, 1425 selfloop transitions, 206 changer transitions 8/1645 dead transitions. [2022-12-13 08:42:24,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 1645 transitions, 72665 flow [2022-12-13 08:42:24,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 08:42:24,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 08:42:24,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 121 transitions. [2022-12-13 08:42:24,104 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4801587301587302 [2022-12-13 08:42:24,105 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 156 predicate places. [2022-12-13 08:42:24,105 INFO L82 GeneralOperation]: Start removeDead. Operand has 177 places, 1645 transitions, 72665 flow [2022-12-13 08:42:24,150 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 1637 transitions, 72301 flow [2022-12-13 08:42:24,179 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:42:24,179 INFO L89 Accepts]: Start accepts. Operand has 177 places, 1637 transitions, 72301 flow [2022-12-13 08:42:24,204 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:42:24,204 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:42:24,204 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 1637 transitions, 72301 flow [2022-12-13 08:42:24,238 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 1637 transitions, 72301 flow [2022-12-13 08:42:24,239 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:42:24,241 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:42:24,242 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-13 08:42:24,242 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 1637 transitions, 72301 flow [2022-12-13 08:42:24,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:42:24,242 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:42:24,242 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:42:24,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 08:42:24,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:42:24,447 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:42:24,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:42:24,448 INFO L85 PathProgramCache]: Analyzing trace with hash 885566709, now seen corresponding path program 1 times [2022-12-13 08:42:24,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:42:24,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719148317] [2022-12-13 08:42:24,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:42:24,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:42:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:42:25,712 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:42:25,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:42:25,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719148317] [2022-12-13 08:42:25,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719148317] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:42:25,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738590903] [2022-12-13 08:42:25,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:42:25,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:42:25,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:42:25,714 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:42:25,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 08:42:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:42:25,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 08:42:25,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:42:25,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:42:25,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-12-13 08:42:25,969 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:42:25,969 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2022-12-13 08:42:25,979 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:42:25,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:42:26,029 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_674 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_674) c_~f~0.base))) (= (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* 4 (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset))) c_~f~0.offset)) 4))) (select .cse0 (+ (* c_~x1~0 4) c_~f~0.offset))))) is different from false [2022-12-13 08:42:26,035 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_674 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_674) c_~f~0.base))) (= (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* 4 (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset))) c_~f~0.offset)) 4))) (select .cse0 (+ c_~f~0.offset (* (select (select |c_#memory_int| c_~f~0.base) (+ (* c_~x1~0 4) c_~f~0.offset)) 4)))))) is different from false [2022-12-13 08:42:26,106 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:42:26,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 104 treesize of output 228 [2022-12-13 08:42:26,141 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:42:26,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 92 [2022-12-13 08:42:26,947 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-13 08:42:26,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738590903] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:42:26,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:42:26,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-12-13 08:42:26,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447639789] [2022-12-13 08:42:26,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:42:26,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 08:42:26,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:42:26,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 08:42:26,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=295, Unknown=2, NotChecked=70, Total=420 [2022-12-13 08:42:26,949 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-13 08:42:26,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 1637 transitions, 72301 flow. Second operand has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 21 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:42:26,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:42:26,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-13 08:42:26,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:42:29,550 INFO L130 PetriNetUnfolder]: 2487/4317 cut-off events. [2022-12-13 08:42:29,551 INFO L131 PetriNetUnfolder]: For 26779/26779 co-relation queries the response was YES. [2022-12-13 08:42:29,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97982 conditions, 4317 events. 2487/4317 cut-off events. For 26779/26779 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 26633 event pairs, 17 based on Foata normal form. 1/3223 useless extension candidates. Maximal degree in co-relation 67954. Up to 4212 conditions per place. [2022-12-13 08:42:29,584 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 1606 selfloop transitions, 120 changer transitions 2/1734 dead transitions. [2022-12-13 08:42:29,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 1734 transitions, 80061 flow [2022-12-13 08:42:29,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 08:42:29,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 08:42:29,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2022-12-13 08:42:29,585 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2022-12-13 08:42:29,585 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 166 predicate places. [2022-12-13 08:42:29,585 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 1734 transitions, 80061 flow [2022-12-13 08:42:29,633 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 1732 transitions, 79966 flow [2022-12-13 08:42:29,664 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:42:29,664 INFO L89 Accepts]: Start accepts. Operand has 187 places, 1732 transitions, 79966 flow [2022-12-13 08:42:29,692 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:42:29,692 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:42:29,692 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 1732 transitions, 79966 flow [2022-12-13 08:42:29,726 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 1732 transitions, 79966 flow [2022-12-13 08:42:29,726 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:42:32,175 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 08:42:32,175 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2511 [2022-12-13 08:42:32,175 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 1731 transitions, 79920 flow [2022-12-13 08:42:32,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 21 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:42:32,176 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:42:32,176 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:42:32,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 08:42:32,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:42:32,381 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:42:32,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:42:32,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1092924073, now seen corresponding path program 1 times [2022-12-13 08:42:32,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:42:32,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919717762] [2022-12-13 08:42:32,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:42:32,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:42:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:42:33,712 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:42:33,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:42:33,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919717762] [2022-12-13 08:42:33,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919717762] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:42:33,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313155508] [2022-12-13 08:42:33,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:42:33,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:42:33,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:42:33,714 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:42:33,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 08:42:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:42:33,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 08:42:33,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:42:33,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:42:33,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-12-13 08:42:33,936 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:42:33,936 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2022-12-13 08:42:33,943 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:42:33,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:42:34,009 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_717 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_717) c_~f~0.base))) (= (select .cse0 (+ c_~f~0.offset (* (select (select |c_#memory_int| c_~f~0.base) (+ (* c_~x1~0 4) c_~f~0.offset)) 4))) (select .cse0 (+ c_~f~0.offset (* 4 (select .cse0 (+ (* (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset)) 4) c_~f~0.offset)))))))) is different from false [2022-12-13 08:42:34,074 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:42:34,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 104 treesize of output 228 [2022-12-13 08:42:34,104 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:42:34,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 92 [2022-12-13 08:42:34,836 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-13 08:42:34,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313155508] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:42:34,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:42:34,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-13 08:42:34,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241629103] [2022-12-13 08:42:34,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:42:34,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:42:34,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:42:34,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:42:34,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=226, Unknown=5, NotChecked=30, Total=306 [2022-12-13 08:42:34,837 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-13 08:42:34,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 1731 transitions, 79920 flow. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:42:34,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:42:34,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-13 08:42:34,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:42:37,484 INFO L130 PetriNetUnfolder]: 2585/4492 cut-off events. [2022-12-13 08:42:37,484 INFO L131 PetriNetUnfolder]: For 33900/33900 co-relation queries the response was YES. [2022-12-13 08:42:37,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106210 conditions, 4492 events. 2585/4492 cut-off events. For 33900/33900 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 28041 event pairs, 5 based on Foata normal form. 1/3363 useless extension candidates. Maximal degree in co-relation 70844. Up to 4375 conditions per place. [2022-12-13 08:42:37,518 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 1680 selfloop transitions, 108 changer transitions 1/1795 dead transitions. [2022-12-13 08:42:37,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 1795 transitions, 86481 flow [2022-12-13 08:42:37,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 08:42:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 08:42:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-12-13 08:42:37,519 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4473684210526316 [2022-12-13 08:42:37,520 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 172 predicate places. [2022-12-13 08:42:37,520 INFO L82 GeneralOperation]: Start removeDead. Operand has 193 places, 1795 transitions, 86481 flow [2022-12-13 08:42:37,572 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 193 places, 1794 transitions, 86430 flow [2022-12-13 08:42:37,604 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:42:37,604 INFO L89 Accepts]: Start accepts. Operand has 193 places, 1794 transitions, 86430 flow [2022-12-13 08:42:37,632 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:42:37,632 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:42:37,632 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 1794 transitions, 86430 flow [2022-12-13 08:42:37,667 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 1794 transitions, 86430 flow [2022-12-13 08:42:37,667 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:42:37,670 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:42:37,670 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-13 08:42:37,671 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 1794 transitions, 86430 flow [2022-12-13 08:42:37,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:42:37,671 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:42:37,671 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:42:37,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 08:42:37,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:42:37,876 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:42:37,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:42:37,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1876981567, now seen corresponding path program 2 times [2022-12-13 08:42:37,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:42:37,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052465710] [2022-12-13 08:42:37,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:42:37,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:42:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:42:38,976 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:42:38,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:42:38,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052465710] [2022-12-13 08:42:38,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052465710] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:42:38,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799198738] [2022-12-13 08:42:38,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:42:38,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:42:38,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:42:38,979 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:42:39,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 08:42:39,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:42:39,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:42:39,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 08:42:39,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:42:39,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:42:39,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 08:42:39,231 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:42:39,232 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2022-12-13 08:42:39,239 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:42:39,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:42:39,304 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_760 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760) c_~f~0.base))) (= (select .cse0 (+ (* (select .cse0 (+ (* c_~x1~0 4) c_~f~0.offset)) 4) c_~f~0.offset)) (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset)) 4) c_~f~0.offset)) 4)))))) is different from false [2022-12-13 08:42:39,375 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:42:39,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 102 treesize of output 234 [2022-12-13 08:42:39,429 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:42:39,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 140 [2022-12-13 08:42:40,356 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:42:40,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799198738] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:42:40,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:42:40,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-13 08:42:40,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311045746] [2022-12-13 08:42:40,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:42:40,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:42:40,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:42:40,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:42:40,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=231, Unknown=1, NotChecked=30, Total=306 [2022-12-13 08:42:40,357 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-13 08:42:40,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 1794 transitions, 86430 flow. Second operand has 18 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 18 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:42:40,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:42:40,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-13 08:42:40,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:42:45,754 INFO L130 PetriNetUnfolder]: 2870/5014 cut-off events. [2022-12-13 08:42:45,754 INFO L131 PetriNetUnfolder]: For 38166/38166 co-relation queries the response was YES. [2022-12-13 08:42:45,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123675 conditions, 5014 events. 2870/5014 cut-off events. For 38166/38166 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 31803 event pairs, 13 based on Foata normal form. 2/3724 useless extension candidates. Maximal degree in co-relation 78530. Up to 4897 conditions per place. [2022-12-13 08:42:45,796 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 1801 selfloop transitions, 188 changer transitions 5/2000 dead transitions. [2022-12-13 08:42:45,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 2000 transitions, 100387 flow [2022-12-13 08:42:45,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 08:42:45,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 08:42:45,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 115 transitions. [2022-12-13 08:42:45,797 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46558704453441296 [2022-12-13 08:42:45,798 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 184 predicate places. [2022-12-13 08:42:45,798 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 2000 transitions, 100387 flow [2022-12-13 08:42:45,939 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 205 places, 1995 transitions, 100131 flow [2022-12-13 08:42:45,990 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:42:45,990 INFO L89 Accepts]: Start accepts. Operand has 205 places, 1995 transitions, 100131 flow [2022-12-13 08:42:46,030 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:42:46,030 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:42:46,030 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 1995 transitions, 100131 flow [2022-12-13 08:42:46,072 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 1995 transitions, 100131 flow [2022-12-13 08:42:46,072 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:42:46,075 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:42:46,076 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-13 08:42:46,076 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 1995 transitions, 100131 flow [2022-12-13 08:42:46,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 18 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:42:46,076 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:42:46,076 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:42:46,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-13 08:42:46,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:42:46,283 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:42:46,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:42:46,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1959745675, now seen corresponding path program 3 times [2022-12-13 08:42:46,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:42:46,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102039197] [2022-12-13 08:42:46,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:42:46,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:42:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:42:48,505 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:42:48,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:42:48,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102039197] [2022-12-13 08:42:48,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102039197] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:42:48,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340507710] [2022-12-13 08:42:48,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 08:42:48,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:42:48,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:42:48,507 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:42:48,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 08:42:48,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 08:42:48,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:42:48,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 08:42:48,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:42:48,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 08:42:48,734 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 30 treesize of output 28 [2022-12-13 08:42:48,770 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:42:48,770 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2022-12-13 08:42:48,780 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:42:48,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:42:48,808 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_803 (Array Int Int))) (= c_~x1~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_803) c_~f~0.base))) (select .cse0 (+ c_~f~0.offset (* 4 (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset)) 4))))))))) is different from false [2022-12-13 08:42:48,948 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:42:48,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 106 treesize of output 222 [2022-12-13 08:42:48,969 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 08:42:48,970 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 56 [2022-12-13 08:42:49,537 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-13 08:42:49,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340507710] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:42:49,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:42:49,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-13 08:42:49,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350743570] [2022-12-13 08:42:49,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:42:49,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:42:49,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:42:49,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:42:49,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=225, Unknown=6, NotChecked=30, Total=306 [2022-12-13 08:42:49,538 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-13 08:42:49,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 1995 transitions, 100131 flow. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:42:49,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:42:49,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-13 08:42:49,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:42:53,189 INFO L130 PetriNetUnfolder]: 2989/5221 cut-off events. [2022-12-13 08:42:53,189 INFO L131 PetriNetUnfolder]: For 44844/44844 co-relation queries the response was YES. [2022-12-13 08:42:53,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133855 conditions, 5221 events. 2989/5221 cut-off events. For 44844/44844 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 33408 event pairs, 9 based on Foata normal form. 1/3880 useless extension candidates. Maximal degree in co-relation 84568. Up to 5098 conditions per place. [2022-12-13 08:42:53,233 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 1902 selfloop transitions, 168 changer transitions 1/2077 dead transitions. [2022-12-13 08:42:53,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 2077 transitions, 108400 flow [2022-12-13 08:42:53,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 08:42:53,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 08:42:53,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 93 transitions. [2022-12-13 08:42:53,234 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40789473684210525 [2022-12-13 08:42:53,234 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 195 predicate places. [2022-12-13 08:42:53,234 INFO L82 GeneralOperation]: Start removeDead. Operand has 216 places, 2077 transitions, 108400 flow [2022-12-13 08:42:53,303 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 216 places, 2076 transitions, 108345 flow [2022-12-13 08:42:53,345 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:42:53,345 INFO L89 Accepts]: Start accepts. Operand has 216 places, 2076 transitions, 108345 flow [2022-12-13 08:42:53,379 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:42:53,379 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:42:53,379 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 216 places, 2076 transitions, 108345 flow [2022-12-13 08:42:53,423 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 216 places, 2076 transitions, 108345 flow [2022-12-13 08:42:53,424 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:42:53,427 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:42:53,428 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-13 08:42:53,428 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 2076 transitions, 108345 flow [2022-12-13 08:42:53,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:42:53,428 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:42:53,428 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:42:53,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-13 08:42:53,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-13 08:42:53,632 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:42:53,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:42:53,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1466589705, now seen corresponding path program 8 times [2022-12-13 08:42:53,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:42:53,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801949839] [2022-12-13 08:42:53,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:42:53,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:42:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:42:53,846 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:42:53,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:42:53,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801949839] [2022-12-13 08:42:53,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801949839] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:42:53,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166408567] [2022-12-13 08:42:53,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:42:53,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:42:53,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:42:53,848 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:42:53,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 08:42:53,937 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:42:53,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:42:53,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 08:42:53,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:42:54,092 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:42:54,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:42:54,279 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:42:54,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166408567] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:42:54,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:42:54,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-12-13 08:42:54,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622220308] [2022-12-13 08:42:54,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:42:54,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 08:42:54,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:42:54,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 08:42:54,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-12-13 08:42:54,280 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 08:42:54,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 2076 transitions, 108345 flow. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:42:54,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:42:54,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 08:42:54,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:42:59,356 INFO L130 PetriNetUnfolder]: 3205/5934 cut-off events. [2022-12-13 08:42:59,357 INFO L131 PetriNetUnfolder]: For 45242/45242 co-relation queries the response was YES. [2022-12-13 08:42:59,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158391 conditions, 5934 events. 3205/5934 cut-off events. For 45242/45242 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 41775 event pairs, 5 based on Foata normal form. 0/4502 useless extension candidates. Maximal degree in co-relation 93673. Up to 5808 conditions per place. [2022-12-13 08:42:59,409 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 2293 selfloop transitions, 749 changer transitions 438/3480 dead transitions. [2022-12-13 08:42:59,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 3480 transitions, 188741 flow [2022-12-13 08:42:59,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 08:42:59,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 08:42:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 94 transitions. [2022-12-13 08:42:59,416 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3092105263157895 [2022-12-13 08:42:59,416 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 210 predicate places. [2022-12-13 08:42:59,416 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 3480 transitions, 188741 flow [2022-12-13 08:42:59,503 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 231 places, 3042 transitions, 164792 flow [2022-12-13 08:42:59,553 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:42:59,553 INFO L89 Accepts]: Start accepts. Operand has 231 places, 3042 transitions, 164792 flow [2022-12-13 08:42:59,607 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:42:59,608 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:42:59,608 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 3042 transitions, 164792 flow [2022-12-13 08:42:59,680 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 231 places, 3042 transitions, 164792 flow [2022-12-13 08:42:59,680 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:42:59,684 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:42:59,685 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 08:42:59,685 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 3042 transitions, 164792 flow [2022-12-13 08:42:59,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:42:59,685 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:42:59,685 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:42:59,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-13 08:42:59,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 08:42:59,890 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:42:59,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:42:59,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1715220527, now seen corresponding path program 9 times [2022-12-13 08:42:59,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:42:59,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749249740] [2022-12-13 08:42:59,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:42:59,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:42:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:43:00,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:43:00,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:43:00,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749249740] [2022-12-13 08:43:00,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749249740] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:43:00,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899781608] [2022-12-13 08:43:00,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 08:43:00,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:43:00,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:43:00,069 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:43:00,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 08:43:00,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 08:43:00,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:43:00,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 08:43:00,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:43:00,437 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:43:00,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:43:00,618 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:43:00,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899781608] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:43:00,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:43:00,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-12-13 08:43:00,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108632065] [2022-12-13 08:43:00,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:43:00,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 08:43:00,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:43:00,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 08:43:00,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-12-13 08:43:00,619 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 08:43:00,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 3042 transitions, 164792 flow. Second operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:43:00,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:43:00,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 08:43:00,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:43:08,316 INFO L130 PetriNetUnfolder]: 3017/5457 cut-off events. [2022-12-13 08:43:08,316 INFO L131 PetriNetUnfolder]: For 36011/36011 co-relation queries the response was YES. [2022-12-13 08:43:08,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151354 conditions, 5457 events. 3017/5457 cut-off events. For 36011/36011 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 36528 event pairs, 3 based on Foata normal form. 0/4255 useless extension candidates. Maximal degree in co-relation 94564. Up to 5356 conditions per place. [2022-12-13 08:43:08,439 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 2790 selfloop transitions, 463 changer transitions 0/3253 dead transitions. [2022-12-13 08:43:08,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 3253 transitions, 182722 flow [2022-12-13 08:43:08,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 08:43:08,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-13 08:43:08,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 137 transitions. [2022-12-13 08:43:08,440 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28842105263157897 [2022-12-13 08:43:08,440 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 234 predicate places. [2022-12-13 08:43:08,440 INFO L82 GeneralOperation]: Start removeDead. Operand has 255 places, 3253 transitions, 182722 flow [2022-12-13 08:43:08,531 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 255 places, 3253 transitions, 182722 flow [2022-12-13 08:43:08,577 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:43:08,577 INFO L89 Accepts]: Start accepts. Operand has 255 places, 3253 transitions, 182722 flow [2022-12-13 08:43:08,636 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:43:08,636 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:43:08,636 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 255 places, 3253 transitions, 182722 flow [2022-12-13 08:43:08,717 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 255 places, 3253 transitions, 182722 flow [2022-12-13 08:43:08,717 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:43:08,721 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:43:08,722 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 08:43:08,722 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 3253 transitions, 182722 flow [2022-12-13 08:43:08,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:43:08,722 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:43:08,722 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:43:08,727 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 08:43:08,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 08:43:08,927 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:43:08,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:43:08,928 INFO L85 PathProgramCache]: Analyzing trace with hash -730632673, now seen corresponding path program 10 times [2022-12-13 08:43:08,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:43:08,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854647405] [2022-12-13 08:43:08,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:43:08,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:43:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:43:09,122 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:43:09,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:43:09,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854647405] [2022-12-13 08:43:09,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854647405] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:43:09,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180517206] [2022-12-13 08:43:09,122 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 08:43:09,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:43:09,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:43:09,132 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:43:09,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 08:43:09,220 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 08:43:09,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:43:09,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 08:43:09,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:43:09,292 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:43:09,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:43:09,478 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:43:09,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180517206] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:43:09,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:43:09,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-12-13 08:43:09,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15532183] [2022-12-13 08:43:09,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:43:09,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 08:43:09,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:43:09,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 08:43:09,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-12-13 08:43:09,480 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 08:43:09,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 3253 transitions, 182722 flow. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:43:09,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:43:09,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 08:43:09,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:43:19,626 INFO L130 PetriNetUnfolder]: 3173/6158 cut-off events. [2022-12-13 08:43:19,627 INFO L131 PetriNetUnfolder]: For 36098/36098 co-relation queries the response was YES. [2022-12-13 08:43:19,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177206 conditions, 6158 events. 3173/6158 cut-off events. For 36098/36098 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 45948 event pairs, 0 based on Foata normal form. 42/4935 useless extension candidates. Maximal degree in co-relation 111335. Up to 6057 conditions per place. [2022-12-13 08:43:19,683 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 2760 selfloop transitions, 1021 changer transitions 42/3823 dead transitions. [2022-12-13 08:43:19,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 3823 transitions, 222519 flow [2022-12-13 08:43:19,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-13 08:43:19,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-13 08:43:19,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 184 transitions. [2022-12-13 08:43:19,684 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24210526315789474 [2022-12-13 08:43:19,685 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 273 predicate places. [2022-12-13 08:43:19,686 INFO L82 GeneralOperation]: Start removeDead. Operand has 294 places, 3823 transitions, 222519 flow [2022-12-13 08:43:19,879 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 294 places, 3781 transitions, 220062 flow [2022-12-13 08:43:19,934 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:43:19,935 INFO L89 Accepts]: Start accepts. Operand has 294 places, 3781 transitions, 220062 flow [2022-12-13 08:43:20,014 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:43:20,014 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:43:20,015 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 294 places, 3781 transitions, 220062 flow [2022-12-13 08:43:20,117 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 294 places, 3781 transitions, 220062 flow [2022-12-13 08:43:20,117 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:43:20,122 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:43:20,123 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-13 08:43:20,123 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 3781 transitions, 220062 flow [2022-12-13 08:43:20,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:43:20,123 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:43:20,123 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:43:20,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-13 08:43:20,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:43:20,328 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:43:20,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:43:20,328 INFO L85 PathProgramCache]: Analyzing trace with hash 750116127, now seen corresponding path program 11 times [2022-12-13 08:43:20,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:43:20,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778512663] [2022-12-13 08:43:20,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:43:20,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:43:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:43:20,458 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:43:20,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:43:20,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778512663] [2022-12-13 08:43:20,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778512663] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:43:20,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203837150] [2022-12-13 08:43:20,459 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 08:43:20,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:43:20,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:43:20,472 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:43:20,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 08:43:20,641 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-12-13 08:43:20,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:43:20,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 08:43:20,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:43:20,712 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:43:20,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:43:20,900 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:43:20,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203837150] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:43:20,900 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:43:20,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-12-13 08:43:20,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777795911] [2022-12-13 08:43:20,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:43:20,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 08:43:20,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:43:20,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 08:43:20,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-12-13 08:43:20,901 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 08:43:20,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 3781 transitions, 220062 flow. Second operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:43:20,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:43:20,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 08:43:20,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:43:36,706 WARN L233 SmtUtils]: Spent 7.08s on a formula simplification. DAG size of input: 38 DAG size of output: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 08:43:48,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:43:50,189 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 08:43:54,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:43:57,419 INFO L130 PetriNetUnfolder]: 3479/6712 cut-off events. [2022-12-13 08:43:57,419 INFO L131 PetriNetUnfolder]: For 35762/35762 co-relation queries the response was YES. [2022-12-13 08:43:57,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200011 conditions, 6712 events. 3479/6712 cut-off events. For 35762/35762 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 50761 event pairs, 0 based on Foata normal form. 0/5354 useless extension candidates. Maximal degree in co-relation 124858. Up to 6611 conditions per place. [2022-12-13 08:43:57,482 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 3752 selfloop transitions, 414 changer transitions 0/4166 dead transitions. [2022-12-13 08:43:57,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 4166 transitions, 250823 flow [2022-12-13 08:43:57,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-13 08:43:57,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-13 08:43:57,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 182 transitions. [2022-12-13 08:43:57,483 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24561403508771928 [2022-12-13 08:43:57,484 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 311 predicate places. [2022-12-13 08:43:57,484 INFO L82 GeneralOperation]: Start removeDead. Operand has 332 places, 4166 transitions, 250823 flow [2022-12-13 08:43:57,608 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 332 places, 4166 transitions, 250823 flow [2022-12-13 08:43:57,670 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:43:57,670 INFO L89 Accepts]: Start accepts. Operand has 332 places, 4166 transitions, 250823 flow [2022-12-13 08:43:57,748 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:43:57,748 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:43:57,748 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 332 places, 4166 transitions, 250823 flow [2022-12-13 08:43:57,867 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 332 places, 4166 transitions, 250823 flow [2022-12-13 08:43:57,867 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:43:57,873 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:43:57,874 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 204 [2022-12-13 08:43:57,874 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 4166 transitions, 250823 flow [2022-12-13 08:43:57,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:43:57,874 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:43:57,874 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:43:57,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-13 08:43:58,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 08:43:58,079 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:43:58,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:43:58,080 INFO L85 PathProgramCache]: Analyzing trace with hash 2011384149, now seen corresponding path program 12 times [2022-12-13 08:43:58,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:43:58,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273959243] [2022-12-13 08:43:58,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:43:58,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:43:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:43:58,218 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:43:58,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:43:58,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273959243] [2022-12-13 08:43:58,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273959243] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:43:58,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336042247] [2022-12-13 08:43:58,219 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 08:43:58,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:43:58,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:43:58,220 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:43:58,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-13 08:43:58,352 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 08:43:58,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:43:58,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 08:43:58,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:43:58,423 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:43:58,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:43:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:43:58,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336042247] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:43:58,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:43:58,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-12-13 08:43:58,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767594755] [2022-12-13 08:43:58,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:43:58,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 08:43:58,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:43:58,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 08:43:58,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-12-13 08:43:58,646 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 08:43:58,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 4166 transitions, 250823 flow. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:43:58,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:43:58,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 08:43:58,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:44:12,335 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 08:44:26,336 INFO L130 PetriNetUnfolder]: 3697/7107 cut-off events. [2022-12-13 08:44:26,336 INFO L131 PetriNetUnfolder]: For 35738/35738 co-relation queries the response was YES. [2022-12-13 08:44:26,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218960 conditions, 7107 events. 3697/7107 cut-off events. For 35738/35738 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 54162 event pairs, 0 based on Foata normal form. 0/5695 useless extension candidates. Maximal degree in co-relation 138405. Up to 7006 conditions per place. [2022-12-13 08:44:26,407 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 3877 selfloop transitions, 543 changer transitions 0/4420 dead transitions. [2022-12-13 08:44:26,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 4420 transitions, 274876 flow [2022-12-13 08:44:26,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-13 08:44:26,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-13 08:44:26,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 161 transitions. [2022-12-13 08:44:26,408 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26480263157894735 [2022-12-13 08:44:26,408 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 340 predicate places. [2022-12-13 08:44:26,408 INFO L82 GeneralOperation]: Start removeDead. Operand has 361 places, 4420 transitions, 274876 flow [2022-12-13 08:44:26,556 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 361 places, 4420 transitions, 274876 flow [2022-12-13 08:44:26,623 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:44:26,623 INFO L89 Accepts]: Start accepts. Operand has 361 places, 4420 transitions, 274876 flow [2022-12-13 08:44:26,725 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:44:26,725 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:44:26,726 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 361 places, 4420 transitions, 274876 flow [2022-12-13 08:44:26,863 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 361 places, 4420 transitions, 274876 flow [2022-12-13 08:44:26,864 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:44:26,869 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:44:26,869 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 246 [2022-12-13 08:44:26,869 INFO L495 AbstractCegarLoop]: Abstraction has has 361 places, 4420 transitions, 274876 flow [2022-12-13 08:44:26,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:44:26,870 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:44:26,870 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:44:26,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-13 08:44:27,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:44:27,074 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:44:27,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:44:27,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1606755543, now seen corresponding path program 13 times [2022-12-13 08:44:27,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:44:27,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446265245] [2022-12-13 08:44:27,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:44:27,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:44:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:44:27,202 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:44:27,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:44:27,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446265245] [2022-12-13 08:44:27,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446265245] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:44:27,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309364172] [2022-12-13 08:44:27,202 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 08:44:27,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:44:27,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:44:27,204 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:44:27,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-13 08:44:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:44:27,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 08:44:27,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:44:27,403 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:44:27,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:44:27,584 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:44:27,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309364172] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:44:27,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:44:27,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-12-13 08:44:27,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217021738] [2022-12-13 08:44:27,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:44:27,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 08:44:27,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:44:27,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 08:44:27,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-12-13 08:44:27,586 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 08:44:27,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 4420 transitions, 274876 flow. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:44:27,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:44:27,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 08:44:27,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:44:36,568 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 08:44:54,881 INFO L130 PetriNetUnfolder]: 3669/7089 cut-off events. [2022-12-13 08:44:54,881 INFO L131 PetriNetUnfolder]: For 35727/35727 co-relation queries the response was YES. [2022-12-13 08:44:54,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225491 conditions, 7089 events. 3669/7089 cut-off events. For 35727/35727 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 54326 event pairs, 0 based on Foata normal form. 38/5705 useless extension candidates. Maximal degree in co-relation 143532. Up to 6988 conditions per place. [2022-12-13 08:44:54,955 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 3280 selfloop transitions, 1089 changer transitions 50/4419 dead transitions. [2022-12-13 08:44:54,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 4419 transitions, 283649 flow [2022-12-13 08:44:54,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-13 08:44:54,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2022-12-13 08:44:54,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 165 transitions. [2022-12-13 08:44:54,959 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20676691729323307 [2022-12-13 08:44:54,959 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 381 predicate places. [2022-12-13 08:44:54,959 INFO L82 GeneralOperation]: Start removeDead. Operand has 402 places, 4419 transitions, 283649 flow [2022-12-13 08:44:55,141 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 400 places, 4369 transitions, 280431 flow [2022-12-13 08:44:55,209 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:44:55,209 INFO L89 Accepts]: Start accepts. Operand has 400 places, 4369 transitions, 280431 flow [2022-12-13 08:44:55,327 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:44:55,327 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:44:55,328 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 400 places, 4369 transitions, 280431 flow [2022-12-13 08:44:55,469 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 400 places, 4369 transitions, 280431 flow [2022-12-13 08:44:55,469 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:44:55,474 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:44:55,475 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 267 [2022-12-13 08:44:55,475 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 4369 transitions, 280431 flow [2022-12-13 08:44:55,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:44:55,475 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:44:55,475 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:44:55,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-13 08:44:55,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-13 08:44:55,682 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:44:55,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:44:55,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1502137989, now seen corresponding path program 14 times [2022-12-13 08:44:55,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:44:55,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598578544] [2022-12-13 08:44:55,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:44:55,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:44:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:44:55,817 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:44:55,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:44:55,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598578544] [2022-12-13 08:44:55,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598578544] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:44:55,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29355845] [2022-12-13 08:44:55,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:44:55,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:44:55,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:44:55,819 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:44:55,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-13 08:44:55,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:44:55,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:44:55,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 08:44:55,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:44:56,014 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:44:56,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:44:56,196 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:44:56,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29355845] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:44:56,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:44:56,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-12-13 08:44:56,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840756942] [2022-12-13 08:44:56,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:44:56,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 08:44:56,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:44:56,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 08:44:56,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-12-13 08:44:56,197 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 08:44:56,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 4369 transitions, 280431 flow. Second operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:44:56,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:44:56,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 08:44:56,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:45:16,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:45:26,887 INFO L130 PetriNetUnfolder]: 3776/7256 cut-off events. [2022-12-13 08:45:26,887 INFO L131 PetriNetUnfolder]: For 36111/36111 co-relation queries the response was YES. [2022-12-13 08:45:26,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238088 conditions, 7256 events. 3776/7256 cut-off events. For 36111/36111 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 55557 event pairs, 0 based on Foata normal form. 0/5824 useless extension candidates. Maximal degree in co-relation 152923. Up to 7155 conditions per place. [2022-12-13 08:45:26,963 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 4202 selfloop transitions, 310 changer transitions 0/4512 dead transitions. [2022-12-13 08:45:26,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 4512 transitions, 298613 flow [2022-12-13 08:45:26,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-13 08:45:26,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-13 08:45:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 153 transitions. [2022-12-13 08:45:26,965 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2236842105263158 [2022-12-13 08:45:26,965 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 414 predicate places. [2022-12-13 08:45:26,965 INFO L82 GeneralOperation]: Start removeDead. Operand has 435 places, 4512 transitions, 298613 flow [2022-12-13 08:45:27,123 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 435 places, 4512 transitions, 298613 flow [2022-12-13 08:45:27,192 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:45:27,192 INFO L89 Accepts]: Start accepts. Operand has 435 places, 4512 transitions, 298613 flow [2022-12-13 08:45:27,316 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:45:27,316 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:45:27,316 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 435 places, 4512 transitions, 298613 flow [2022-12-13 08:45:27,464 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 435 places, 4512 transitions, 298613 flow [2022-12-13 08:45:27,465 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:45:27,470 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:45:27,470 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 278 [2022-12-13 08:45:27,470 INFO L495 AbstractCegarLoop]: Abstraction has has 435 places, 4512 transitions, 298613 flow [2022-12-13 08:45:27,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:45:27,470 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:45:27,471 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:45:27,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-13 08:45:27,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:45:27,676 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:45:27,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:45:27,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1246871057, now seen corresponding path program 15 times [2022-12-13 08:45:27,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:45:27,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420528640] [2022-12-13 08:45:27,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:45:27,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:45:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:45:27,790 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:45:27,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:45:27,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420528640] [2022-12-13 08:45:27,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420528640] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:45:27,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948752010] [2022-12-13 08:45:27,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 08:45:27,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:45:27,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:45:27,808 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:45:27,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-13 08:45:27,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 08:45:27,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:45:27,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 08:45:27,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:45:28,022 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:45:28,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:45:28,212 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:45:28,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948752010] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:45:28,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:45:28,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-12-13 08:45:28,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024224805] [2022-12-13 08:45:28,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:45:28,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 08:45:28,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:45:28,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 08:45:28,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-12-13 08:45:28,213 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 08:45:28,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 4512 transitions, 298613 flow. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:45:28,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:45:28,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 08:45:28,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:45:42,969 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 08:45:51,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:46:02,659 INFO L130 PetriNetUnfolder]: 4085/7864 cut-off events. [2022-12-13 08:46:02,660 INFO L131 PetriNetUnfolder]: For 35791/35791 co-relation queries the response was YES. [2022-12-13 08:46:02,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266050 conditions, 7864 events. 4085/7864 cut-off events. For 35791/35791 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 61456 event pairs, 0 based on Foata normal form. 0/6316 useless extension candidates. Maximal degree in co-relation 169172. Up to 7763 conditions per place. [2022-12-13 08:46:02,743 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 4414 selfloop transitions, 486 changer transitions 0/4900 dead transitions. [2022-12-13 08:46:02,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 4900 transitions, 334120 flow [2022-12-13 08:46:02,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-13 08:46:02,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-13 08:46:02,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 183 transitions. [2022-12-13 08:46:02,744 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2603129445234708 [2022-12-13 08:46:02,744 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 448 predicate places. [2022-12-13 08:46:02,744 INFO L82 GeneralOperation]: Start removeDead. Operand has 469 places, 4900 transitions, 334120 flow [2022-12-13 08:46:02,923 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 469 places, 4900 transitions, 334120 flow [2022-12-13 08:46:03,002 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:46:03,002 INFO L89 Accepts]: Start accepts. Operand has 469 places, 4900 transitions, 334120 flow [2022-12-13 08:46:03,145 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:46:03,145 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:46:03,145 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 469 places, 4900 transitions, 334120 flow [2022-12-13 08:46:03,316 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 469 places, 4900 transitions, 334120 flow [2022-12-13 08:46:03,316 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:46:03,321 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:46:03,322 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 320 [2022-12-13 08:46:03,322 INFO L495 AbstractCegarLoop]: Abstraction has has 469 places, 4900 transitions, 334120 flow [2022-12-13 08:46:03,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:46:03,322 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:46:03,322 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:46:03,334 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 08:46:03,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:46:03,528 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:46:03,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:46:03,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1110000613, now seen corresponding path program 16 times [2022-12-13 08:46:03,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:46:03,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120747338] [2022-12-13 08:46:03,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:46:03,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:46:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:46:03,650 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:46:03,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:46:03,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120747338] [2022-12-13 08:46:03,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120747338] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:46:03,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295881599] [2022-12-13 08:46:03,651 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 08:46:03,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:46:03,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:46:03,656 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:46:03,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-13 08:46:03,808 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 08:46:03,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:46:03,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 08:46:03,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:46:03,871 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:46:03,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:46:04,087 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:46:04,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295881599] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:46:04,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:46:04,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-12-13 08:46:04,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331156781] [2022-12-13 08:46:04,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:46:04,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 08:46:04,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:46:04,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 08:46:04,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-12-13 08:46:04,088 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 08:46:04,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 4900 transitions, 334120 flow. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:46:04,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:46:04,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 08:46:04,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:46:15,717 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 08:46:18,111 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 08:46:22,661 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 08:46:25,715 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 08:46:30,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:46:33,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:46:41,535 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 08:46:51,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:46:57,602 INFO L130 PetriNetUnfolder]: 4295/8346 cut-off events. [2022-12-13 08:46:57,602 INFO L131 PetriNetUnfolder]: For 35809/35809 co-relation queries the response was YES. [2022-12-13 08:46:57,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290809 conditions, 8346 events. 4295/8346 cut-off events. For 35809/35809 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 66831 event pairs, 0 based on Foata normal form. 42/6750 useless extension candidates. Maximal degree in co-relation 185928. Up to 8245 conditions per place. [2022-12-13 08:46:57,694 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 3901 selfloop transitions, 1275 changer transitions 54/5230 dead transitions. [2022-12-13 08:46:57,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 5230 transitions, 367092 flow [2022-12-13 08:46:57,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-13 08:46:57,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-12-13 08:46:57,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 215 transitions. [2022-12-13 08:46:57,695 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24076147816349383 [2022-12-13 08:46:57,695 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 494 predicate places. [2022-12-13 08:46:57,695 INFO L82 GeneralOperation]: Start removeDead. Operand has 515 places, 5230 transitions, 367092 flow [2022-12-13 08:46:57,894 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 513 places, 5176 transitions, 363291 flow [2022-12-13 08:46:57,985 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:46:57,985 INFO L89 Accepts]: Start accepts. Operand has 513 places, 5176 transitions, 363291 flow [2022-12-13 08:46:58,142 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:46:58,142 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:46:58,143 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 513 places, 5176 transitions, 363291 flow [2022-12-13 08:46:58,328 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 513 places, 5176 transitions, 363291 flow [2022-12-13 08:46:58,328 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:46:58,335 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:46:58,336 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 351 [2022-12-13 08:46:58,336 INFO L495 AbstractCegarLoop]: Abstraction has has 513 places, 5176 transitions, 363291 flow [2022-12-13 08:46:58,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:46:58,336 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:46:58,336 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:46:58,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-13 08:46:58,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:46:58,541 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:46:58,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:46:58,542 INFO L85 PathProgramCache]: Analyzing trace with hash -2137487507, now seen corresponding path program 17 times [2022-12-13 08:46:58,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:46:58,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4153016] [2022-12-13 08:46:58,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:46:58,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:46:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:46:58,676 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:46:58,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:46:58,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4153016] [2022-12-13 08:46:58,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4153016] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:46:58,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796978903] [2022-12-13 08:46:58,676 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 08:46:58,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:46:58,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:46:58,677 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:46:58,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-13 08:46:58,785 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 08:46:58,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:46:58,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 08:46:58,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:46:58,856 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:46:58,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:46:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:46:59,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796978903] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:46:59,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:46:59,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-12-13 08:46:59,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118690305] [2022-12-13 08:46:59,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:46:59,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:46:59,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:46:59,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:46:59,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-12-13 08:46:59,040 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 08:46:59,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 5176 transitions, 363291 flow. Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:46:59,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:46:59,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 08:46:59,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:47:09,175 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 08:47:11,209 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 08:47:13,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:47:16,097 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 08:47:19,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:47:22,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:47:46,560 INFO L130 PetriNetUnfolder]: 4401/8523 cut-off events. [2022-12-13 08:47:46,561 INFO L131 PetriNetUnfolder]: For 36176/36176 co-relation queries the response was YES. [2022-12-13 08:47:46,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305524 conditions, 8523 events. 4401/8523 cut-off events. For 36176/36176 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 68116 event pairs, 0 based on Foata normal form. 0/6875 useless extension candidates. Maximal degree in co-relation 197524. Up to 8422 conditions per place. [2022-12-13 08:47:46,653 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 4719 selfloop transitions, 617 changer transitions 0/5336 dead transitions. [2022-12-13 08:47:46,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 5336 transitions, 385172 flow [2022-12-13 08:47:46,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-13 08:47:46,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-13 08:47:46,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 176 transitions. [2022-12-13 08:47:46,662 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2503556187766714 [2022-12-13 08:47:46,663 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 528 predicate places. [2022-12-13 08:47:46,663 INFO L82 GeneralOperation]: Start removeDead. Operand has 549 places, 5336 transitions, 385172 flow [2022-12-13 08:47:46,917 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 549 places, 5336 transitions, 385172 flow [2022-12-13 08:47:47,001 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:47:47,002 INFO L89 Accepts]: Start accepts. Operand has 549 places, 5336 transitions, 385172 flow [2022-12-13 08:47:47,120 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:47:47,121 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:47:47,121 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 549 places, 5336 transitions, 385172 flow [2022-12-13 08:47:47,293 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 549 places, 5336 transitions, 385172 flow [2022-12-13 08:47:47,293 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:47:47,298 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:47:47,299 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 298 [2022-12-13 08:47:47,299 INFO L495 AbstractCegarLoop]: Abstraction has has 549 places, 5336 transitions, 385172 flow [2022-12-13 08:47:47,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:47:47,299 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:47:47,299 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:47:47,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-13 08:47:47,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-13 08:47:47,504 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:47:47,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:47:47,504 INFO L85 PathProgramCache]: Analyzing trace with hash -31663681, now seen corresponding path program 18 times [2022-12-13 08:47:47,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:47:47,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144956674] [2022-12-13 08:47:47,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:47:47,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:47:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:47:47,635 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:47:47,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:47:47,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144956674] [2022-12-13 08:47:47,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144956674] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:47:47,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89539539] [2022-12-13 08:47:47,636 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 08:47:47,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:47:47,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:47:47,648 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:47:47,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-13 08:47:47,769 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 08:47:47,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:47:47,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 08:47:47,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:47:49,885 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:47:49,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:47:50,107 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:47:50,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89539539] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:47:50,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:47:50,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-12-13 08:47:50,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513850618] [2022-12-13 08:47:50,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:47:50,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 08:47:50,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:47:50,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 08:47:50,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=273, Unknown=1, NotChecked=0, Total=342 [2022-12-13 08:47:50,108 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 08:47:50,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 5336 transitions, 385172 flow. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:47:50,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:47:50,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 08:47:50,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:48:21,847 INFO L130 PetriNetUnfolder]: 4690/9171 cut-off events. [2022-12-13 08:48:21,847 INFO L131 PetriNetUnfolder]: For 35820/35820 co-relation queries the response was YES. [2022-12-13 08:48:21,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338053 conditions, 9171 events. 4690/9171 cut-off events. For 35820/35820 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 75241 event pairs, 0 based on Foata normal form. 72/7466 useless extension candidates. Maximal degree in co-relation 220568. Up to 9070 conditions per place. [2022-12-13 08:48:21,961 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 4267 selfloop transitions, 1399 changer transitions 106/5772 dead transitions. [2022-12-13 08:48:21,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 5772 transitions, 428195 flow [2022-12-13 08:48:21,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-13 08:48:21,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-12-13 08:48:21,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 215 transitions. [2022-12-13 08:48:21,963 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25146198830409355 [2022-12-13 08:48:21,963 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 572 predicate places. [2022-12-13 08:48:21,963 INFO L82 GeneralOperation]: Start removeDead. Operand has 593 places, 5772 transitions, 428195 flow [2022-12-13 08:48:22,184 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 593 places, 5666 transitions, 420321 flow [2022-12-13 08:48:22,284 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:48:22,284 INFO L89 Accepts]: Start accepts. Operand has 593 places, 5666 transitions, 420321 flow [2022-12-13 08:48:22,468 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:48:22,468 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:48:22,468 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 593 places, 5666 transitions, 420321 flow [2022-12-13 08:48:22,682 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 593 places, 5666 transitions, 420321 flow [2022-12-13 08:48:22,682 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:48:22,689 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:48:22,690 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 406 [2022-12-13 08:48:22,690 INFO L495 AbstractCegarLoop]: Abstraction has has 593 places, 5666 transitions, 420321 flow [2022-12-13 08:48:22,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:48:22,690 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:48:22,690 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:48:22,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-12-13 08:48:22,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-13 08:48:22,891 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:48:22,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:48:22,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1059150575, now seen corresponding path program 19 times [2022-12-13 08:48:22,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:48:22,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074829548] [2022-12-13 08:48:22,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:48:22,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:48:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:48:23,017 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:48:23,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:48:23,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074829548] [2022-12-13 08:48:23,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074829548] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:48:23,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093957363] [2022-12-13 08:48:23,018 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 08:48:23,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:48:23,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:48:23,019 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:48:23,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-13 08:48:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:48:23,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 08:48:23,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:48:23,177 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:48:23,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:48:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:48:23,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093957363] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:48:23,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:48:23,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-12-13 08:48:23,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454312789] [2022-12-13 08:48:23,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:48:23,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:48:23,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:48:23,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:48:23,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-12-13 08:48:23,405 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 08:48:23,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 593 places, 5666 transitions, 420321 flow. Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:48:23,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:48:23,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 08:48:23,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:48:39,946 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 08:48:42,283 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 08:48:48,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:49:13,546 INFO L130 PetriNetUnfolder]: 4740/9195 cut-off events. [2022-12-13 08:49:13,547 INFO L131 PetriNetUnfolder]: For 36182/36182 co-relation queries the response was YES. [2022-12-13 08:49:13,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348123 conditions, 9195 events. 4740/9195 cut-off events. For 36182/36182 co-relation queries the response was YES. Maximal size of possible extension queue 669. Compared 74753 event pairs, 0 based on Foata normal form. 0/7448 useless extension candidates. Maximal degree in co-relation 228562. Up to 9094 conditions per place. [2022-12-13 08:49:13,646 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 5202 selfloop transitions, 571 changer transitions 0/5773 dead transitions. [2022-12-13 08:49:13,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 626 places, 5773 transitions, 439773 flow [2022-12-13 08:49:13,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-13 08:49:13,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-13 08:49:13,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 168 transitions. [2022-12-13 08:49:13,647 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24561403508771928 [2022-12-13 08:49:13,648 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 605 predicate places. [2022-12-13 08:49:13,648 INFO L82 GeneralOperation]: Start removeDead. Operand has 626 places, 5773 transitions, 439773 flow [2022-12-13 08:49:13,957 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 626 places, 5773 transitions, 439773 flow [2022-12-13 08:49:14,056 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:49:14,056 INFO L89 Accepts]: Start accepts. Operand has 626 places, 5773 transitions, 439773 flow [2022-12-13 08:49:14,233 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:49:14,234 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:49:14,234 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 626 places, 5773 transitions, 439773 flow [2022-12-13 08:49:14,440 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 626 places, 5773 transitions, 439773 flow [2022-12-13 08:49:14,440 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:49:14,447 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:49:14,448 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 392 [2022-12-13 08:49:14,448 INFO L495 AbstractCegarLoop]: Abstraction has has 626 places, 5773 transitions, 439773 flow [2022-12-13 08:49:14,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:49:14,448 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:49:14,448 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:49:14,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-12-13 08:49:14,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:49:14,654 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:49:14,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:49:14,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1619100017, now seen corresponding path program 20 times [2022-12-13 08:49:14,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:49:14,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035268427] [2022-12-13 08:49:14,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:49:14,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:49:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:49:14,755 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:49:14,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:49:14,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035268427] [2022-12-13 08:49:14,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035268427] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:49:14,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825613081] [2022-12-13 08:49:14,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:49:14,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:49:14,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:49:14,760 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:49:14,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-13 08:49:14,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:49:14,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:49:14,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 08:49:14,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:49:14,949 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:49:14,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:49:15,126 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:49:15,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825613081] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:49:15,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:49:15,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-12-13 08:49:15,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543909732] [2022-12-13 08:49:15,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:49:15,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:49:15,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:49:15,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:49:15,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-12-13 08:49:15,127 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 08:49:15,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 626 places, 5773 transitions, 439773 flow. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:49:15,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:49:15,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 08:49:15,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:49:23,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:49:24,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:49:27,160 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 08:49:58,112 INFO L130 PetriNetUnfolder]: 4807/9274 cut-off events. [2022-12-13 08:49:58,112 INFO L131 PetriNetUnfolder]: For 35776/35776 co-relation queries the response was YES. [2022-12-13 08:49:58,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360383 conditions, 9274 events. 4807/9274 cut-off events. For 35776/35776 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 75077 event pairs, 0 based on Foata normal form. 0/7515 useless extension candidates. Maximal degree in co-relation 238690. Up to 9173 conditions per place. [2022-12-13 08:49:58,213 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 5380 selfloop transitions, 429 changer transitions 0/5809 dead transitions. [2022-12-13 08:49:58,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 5809 transitions, 454076 flow [2022-12-13 08:49:58,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-13 08:49:58,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-13 08:49:58,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 155 transitions. [2022-12-13 08:49:58,214 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22660818713450293 [2022-12-13 08:49:58,214 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 640 predicate places. [2022-12-13 08:49:58,214 INFO L82 GeneralOperation]: Start removeDead. Operand has 661 places, 5809 transitions, 454076 flow [2022-12-13 08:49:58,438 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 661 places, 5809 transitions, 454076 flow [2022-12-13 08:49:58,540 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:49:58,540 INFO L89 Accepts]: Start accepts. Operand has 661 places, 5809 transitions, 454076 flow [2022-12-13 08:49:58,771 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:49:58,771 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:49:58,771 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 661 places, 5809 transitions, 454076 flow [2022-12-13 08:49:58,987 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 661 places, 5809 transitions, 454076 flow [2022-12-13 08:49:58,988 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:49:58,994 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:49:58,995 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 455 [2022-12-13 08:49:58,995 INFO L495 AbstractCegarLoop]: Abstraction has has 661 places, 5809 transitions, 454076 flow [2022-12-13 08:49:58,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:49:58,995 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:49:58,995 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:49:59,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-13 08:49:59,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-13 08:49:59,198 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:49:59,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:49:59,199 INFO L85 PathProgramCache]: Analyzing trace with hash -533595297, now seen corresponding path program 21 times [2022-12-13 08:49:59,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:49:59,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251375456] [2022-12-13 08:49:59,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:49:59,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:49:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:49:59,484 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:49:59,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:49:59,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251375456] [2022-12-13 08:49:59,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251375456] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:49:59,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647467751] [2022-12-13 08:49:59,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 08:49:59,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:49:59,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:49:59,485 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:49:59,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-13 08:49:59,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 08:49:59,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:49:59,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 08:49:59,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:49:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:49:59,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:49:59,887 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:49:59,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647467751] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:49:59,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:49:59,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-12-13 08:49:59,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379740109] [2022-12-13 08:49:59,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:49:59,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:49:59,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:49:59,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:49:59,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-12-13 08:49:59,889 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 08:49:59,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 661 places, 5809 transitions, 454076 flow. Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:49:59,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:49:59,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 08:49:59,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:50:03,734 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 08:50:19,179 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 08:50:21,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:50:22,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:50:41,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:50:47,399 INFO L130 PetriNetUnfolder]: 5213/10078 cut-off events. [2022-12-13 08:50:47,399 INFO L131 PetriNetUnfolder]: For 35875/35875 co-relation queries the response was YES. [2022-12-13 08:50:47,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401872 conditions, 10078 events. 5213/10078 cut-off events. For 35875/35875 co-relation queries the response was YES. Maximal size of possible extension queue 759. Compared 83434 event pairs, 0 based on Foata normal form. 0/8160 useless extension candidates. Maximal degree in co-relation 263308. Up to 9977 conditions per place. [2022-12-13 08:50:47,510 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 5916 selfloop transitions, 398 changer transitions 0/6314 dead transitions. [2022-12-13 08:50:47,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 6314 transitions, 506256 flow [2022-12-13 08:50:47,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-13 08:50:47,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-13 08:50:47,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 171 transitions. [2022-12-13 08:50:47,511 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2647058823529412 [2022-12-13 08:50:47,512 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 673 predicate places. [2022-12-13 08:50:47,512 INFO L82 GeneralOperation]: Start removeDead. Operand has 694 places, 6314 transitions, 506256 flow [2022-12-13 08:50:47,849 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 694 places, 6314 transitions, 506256 flow [2022-12-13 08:50:47,960 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:50:47,960 INFO L89 Accepts]: Start accepts. Operand has 694 places, 6314 transitions, 506256 flow [2022-12-13 08:50:48,174 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:50:48,174 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:50:48,174 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 694 places, 6314 transitions, 506256 flow [2022-12-13 08:50:48,424 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 694 places, 6314 transitions, 506256 flow [2022-12-13 08:50:48,424 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:50:48,431 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:50:48,431 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 471 [2022-12-13 08:50:48,431 INFO L495 AbstractCegarLoop]: Abstraction has has 694 places, 6314 transitions, 506256 flow [2022-12-13 08:50:48,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:50:48,431 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:50:48,431 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:50:48,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-12-13 08:50:48,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-13 08:50:48,637 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:50:48,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:50:48,637 INFO L85 PathProgramCache]: Analyzing trace with hash 727672725, now seen corresponding path program 22 times [2022-12-13 08:50:48,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:50:48,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144511468] [2022-12-13 08:50:48,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:50:48,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:50:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:50:48,769 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:50:48,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:50:48,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144511468] [2022-12-13 08:50:48,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144511468] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:50:48,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308219296] [2022-12-13 08:50:48,769 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 08:50:48,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:50:48,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:50:48,770 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:50:48,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-13 08:50:48,876 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 08:50:48,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:50:48,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 08:50:48,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:50:48,950 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:50:48,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:50:49,142 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:50:49,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308219296] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:50:49,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:50:49,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-12-13 08:50:49,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80072210] [2022-12-13 08:50:49,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:50:49,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 08:50:49,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:50:49,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 08:50:49,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-12-13 08:50:49,143 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 08:50:49,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 694 places, 6314 transitions, 506256 flow. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:50:49,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:50:49,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 08:50:49,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:50:51,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:50:56,999 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 08:50:59,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:51:03,518 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 08:51:42,521 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 08:51:54,759 INFO L130 PetriNetUnfolder]: 5595/10830 cut-off events. [2022-12-13 08:51:54,759 INFO L131 PetriNetUnfolder]: For 36308/36308 co-relation queries the response was YES. [2022-12-13 08:51:54,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442828 conditions, 10830 events. 5595/10830 cut-off events. For 36308/36308 co-relation queries the response was YES. Maximal size of possible extension queue 832. Compared 91081 event pairs, 0 based on Foata normal form. 0/8749 useless extension candidates. Maximal degree in co-relation 288153. Up to 10729 conditions per place. [2022-12-13 08:51:54,890 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 6264 selfloop transitions, 528 changer transitions 0/6792 dead transitions. [2022-12-13 08:51:54,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 6792 transitions, 558215 flow [2022-12-13 08:51:54,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 08:51:54,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-13 08:51:54,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 156 transitions. [2022-12-13 08:51:54,894 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2932330827067669 [2022-12-13 08:51:54,895 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 700 predicate places. [2022-12-13 08:51:54,895 INFO L82 GeneralOperation]: Start removeDead. Operand has 721 places, 6792 transitions, 558215 flow [2022-12-13 08:51:55,205 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 721 places, 6792 transitions, 558215 flow [2022-12-13 08:51:55,465 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:51:55,465 INFO L89 Accepts]: Start accepts. Operand has 721 places, 6792 transitions, 558215 flow [2022-12-13 08:51:55,601 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:51:55,601 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:51:55,601 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 721 places, 6792 transitions, 558215 flow [2022-12-13 08:51:55,891 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 721 places, 6792 transitions, 558215 flow [2022-12-13 08:51:55,891 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:51:55,899 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:51:55,899 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 434 [2022-12-13 08:51:55,899 INFO L495 AbstractCegarLoop]: Abstraction has has 721 places, 6792 transitions, 558215 flow [2022-12-13 08:51:55,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:51:55,899 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:51:55,899 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:51:55,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-12-13 08:51:56,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-13 08:51:56,105 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:51:56,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:51:56,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1404500329, now seen corresponding path program 23 times [2022-12-13 08:51:56,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:51:56,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605582987] [2022-12-13 08:51:56,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:51:56,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:51:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:51:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:51:56,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:51:56,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605582987] [2022-12-13 08:51:56,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605582987] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:51:56,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27949604] [2022-12-13 08:51:56,228 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 08:51:56,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:51:56,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:51:56,229 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:51:56,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-13 08:51:56,345 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 08:51:56,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:51:56,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 08:51:56,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:51:56,404 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:51:56,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:51:56,612 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:51:56,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27949604] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:51:56,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:51:56,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-12-13 08:51:56,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797089630] [2022-12-13 08:51:56,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:51:56,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 08:51:56,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:51:56,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 08:51:56,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-12-13 08:51:56,613 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 08:51:56,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 721 places, 6792 transitions, 558215 flow. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:51:56,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:51:56,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 08:51:56,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:52:08,988 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 08:52:10,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:52:22,189 WARN L233 SmtUtils]: Spent 5.18s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 08:52:24,203 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 08:52:33,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:52:39,696 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 08:52:49,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:52:56,324 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 08:53:00,452 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 08:53:02,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:53:08,868 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 08:53:13,497 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 08:53:15,717 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 08:53:17,755 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 08:53:19,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:54:12,710 INFO L130 PetriNetUnfolder]: 5600/10903 cut-off events. [2022-12-13 08:54:12,710 INFO L131 PetriNetUnfolder]: For 35936/35936 co-relation queries the response was YES. [2022-12-13 08:54:12,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456736 conditions, 10903 events. 5600/10903 cut-off events. For 35936/35936 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 92289 event pairs, 0 based on Foata normal form. 23/8830 useless extension candidates. Maximal degree in co-relation 298138. Up to 10802 conditions per place. [2022-12-13 08:54:12,833 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 5288 selfloop transitions, 1540 changer transitions 29/6857 dead transitions. [2022-12-13 08:54:12,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 757 places, 6857 transitions, 577292 flow [2022-12-13 08:54:12,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-13 08:54:12,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-13 08:54:12,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 155 transitions. [2022-12-13 08:54:12,834 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22048364153627312 [2022-12-13 08:54:12,835 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 736 predicate places. [2022-12-13 08:54:12,835 INFO L82 GeneralOperation]: Start removeDead. Operand has 757 places, 6857 transitions, 577292 flow [2022-12-13 08:54:13,198 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 754 places, 6828 transitions, 574844 flow [2022-12-13 08:54:13,323 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:54:13,323 INFO L89 Accepts]: Start accepts. Operand has 754 places, 6828 transitions, 574844 flow [2022-12-13 08:54:13,591 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:54:13,591 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:54:13,591 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 754 places, 6828 transitions, 574844 flow [2022-12-13 08:54:13,894 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 754 places, 6828 transitions, 574844 flow [2022-12-13 08:54:13,895 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:54:13,902 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:54:13,902 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 579 [2022-12-13 08:54:13,903 INFO L495 AbstractCegarLoop]: Abstraction has has 754 places, 6828 transitions, 574844 flow [2022-12-13 08:54:13,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:54:13,903 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:54:13,903 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:54:13,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-12-13 08:54:14,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:54:14,107 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 08:54:14,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:54:14,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1455350367, now seen corresponding path program 24 times [2022-12-13 08:54:14,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:54:14,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626084360] [2022-12-13 08:54:14,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:54:14,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:54:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:54:14,224 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:54:14,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:54:14,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626084360] [2022-12-13 08:54:14,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626084360] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:54:14,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096726722] [2022-12-13 08:54:14,225 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 08:54:14,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:54:14,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:54:14,226 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:54:14,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-13 08:54:14,375 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-12-13 08:54:14,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:54:14,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 08:54:14,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:54:14,431 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:54:14,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:54:14,610 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:54:14,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096726722] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:54:14,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:54:14,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-12-13 08:54:14,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252048459] [2022-12-13 08:54:14,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:54:14,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:54:14,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:54:14,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:54:14,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-12-13 08:54:14,611 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 08:54:14,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 754 places, 6828 transitions, 574844 flow. Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:54:14,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:54:14,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 08:54:14,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:54:29,282 WARN L233 SmtUtils]: Spent 7.37s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 08:54:31,327 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 08:54:33,332 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 08:54:41,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:54:43,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:54:46,437 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 08:54:48,572 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 08:54:50,655 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 08:54:52,811 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 08:54:56,274 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 08:55:04,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:55:06,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2022-12-13 08:55:17,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-13 08:55:17,495 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 08:55:17,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-12-13 08:55:17,508 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 08:55:17,508 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 08:55:17,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:55:17,700 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (18states, 0/19 universal loopers) in iteration 42,while PetriNetUnfolder was constructing finite prefix that currently has 142381 conditions, 3350 events (1788/3349 cut-off events. For 34160/34160 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 27860 event pairs, 0 based on Foata normal form. 0/3396 useless extension candidates. Maximal degree in co-relation 79393. Up to 3253 conditions per place.). [2022-12-13 08:55:17,701 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 08:55:17,701 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 08:55:17,701 INFO L445 BasicCegarLoop]: Path program histogram: [24, 4, 3, 3, 2, 2, 1, 1, 1, 1] [2022-12-13 08:55:17,729 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 08:55:17,729 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 08:55:17,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:55:17 BasicIcfg [2022-12-13 08:55:17,732 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 08:55:17,732 INFO L158 Benchmark]: Toolchain (without parser) took 848704.86ms. Allocated memory was 176.2MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 152.4MB in the beginning and 1.1GB in the end (delta: -988.2MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-12-13 08:55:17,732 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 176.2MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 08:55:17,732 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.15ms. Allocated memory is still 176.2MB. Free memory was 152.4MB in the beginning and 141.0MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 08:55:17,732 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.27ms. Allocated memory is still 176.2MB. Free memory was 141.0MB in the beginning and 139.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 08:55:17,733 INFO L158 Benchmark]: Boogie Preprocessor took 28.02ms. Allocated memory is still 176.2MB. Free memory was 139.1MB in the beginning and 137.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 08:55:17,733 INFO L158 Benchmark]: RCFGBuilder took 369.67ms. Allocated memory is still 176.2MB. Free memory was 137.5MB in the beginning and 121.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-13 08:55:17,733 INFO L158 Benchmark]: TraceAbstraction took 848028.58ms. Allocated memory was 176.2MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 119.7MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-12-13 08:55:17,733 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 176.2MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 229.15ms. Allocated memory is still 176.2MB. Free memory was 152.4MB in the beginning and 141.0MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.27ms. Allocated memory is still 176.2MB. Free memory was 141.0MB in the beginning and 139.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.02ms. Allocated memory is still 176.2MB. Free memory was 139.1MB in the beginning and 137.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 369.67ms. Allocated memory is still 176.2MB. Free memory was 137.5MB in the beginning and 121.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 848028.58ms. Allocated memory was 176.2MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 119.7MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 149 PlacesBefore, 21 PlacesAfterwards, 157 TransitionsBefore, 17 TransitionsAfterwards, 2592 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 69 TrivialYvCompositions, 59 ConcurrentYvCompositions, 12 ChoiceCompositions, 140 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1612, independent: 1609, independent conditional: 1609, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1612, independent: 1609, independent conditional: 0, independent unconditional: 1609, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1612, independent: 1609, independent conditional: 0, independent unconditional: 1609, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1612, independent: 1609, independent conditional: 0, independent unconditional: 1609, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1538, independent: 1535, independent conditional: 0, independent unconditional: 1535, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1538, independent: 1535, independent conditional: 0, independent unconditional: 1535, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1612, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1538, unknown conditional: 0, unknown unconditional: 1538] , Statistics on independence cache: Total cache size (in pairs): 3041, Positive cache size: 3038, Positive conditional cache size: 0, Positive unconditional cache size: 3038, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, 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.7s, 23 PlacesBefore, 22 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 24 PlacesBefore, 24 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 27 PlacesBefore, 27 PlacesAfterwards, 40 TransitionsBefore, 40 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, 55 TransitionsBefore, 55 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 72 TransitionsBefore, 72 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 60 PlacesBefore, 57 PlacesAfterwards, 93 TransitionsBefore, 90 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 66 PlacesBefore, 66 PlacesAfterwards, 128 TransitionsBefore, 128 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, 62 PlacesBefore, 62 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 72 PlacesBefore, 72 PlacesAfterwards, 164 TransitionsBefore, 164 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 87 PlacesBefore, 86 PlacesAfterwards, 341 TransitionsBefore, 340 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, 99 PlacesBefore, 99 PlacesAfterwards, 528 TransitionsBefore, 528 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, 109 PlacesBefore, 109 PlacesAfterwards, 681 TransitionsBefore, 681 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, 124 PlacesBefore, 124 PlacesAfterwards, 964 TransitionsBefore, 964 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, 139 PlacesBefore, 139 PlacesAfterwards, 1145 TransitionsBefore, 1145 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, 151 PlacesBefore, 151 PlacesAfterwards, 1314 TransitionsBefore, 1314 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, 164 PlacesBefore, 164 PlacesAfterwards, 1468 TransitionsBefore, 1468 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, 177 PlacesBefore, 177 PlacesAfterwards, 1637 TransitionsBefore, 1637 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 187 PlacesBefore, 186 PlacesAfterwards, 1732 TransitionsBefore, 1731 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, 193 PlacesBefore, 193 PlacesAfterwards, 1794 TransitionsBefore, 1794 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, 205 PlacesBefore, 205 PlacesAfterwards, 1995 TransitionsBefore, 1995 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, 216 PlacesBefore, 216 PlacesAfterwards, 2076 TransitionsBefore, 2076 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, 3042 TransitionsBefore, 3042 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, 255 PlacesBefore, 255 PlacesAfterwards, 3253 TransitionsBefore, 3253 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, 294 PlacesBefore, 294 PlacesAfterwards, 3781 TransitionsBefore, 3781 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, 332 PlacesBefore, 332 PlacesAfterwards, 4166 TransitionsBefore, 4166 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, 361 PlacesBefore, 361 PlacesAfterwards, 4420 TransitionsBefore, 4420 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, 400 PlacesBefore, 400 PlacesAfterwards, 4369 TransitionsBefore, 4369 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, 435 PlacesBefore, 435 PlacesAfterwards, 4512 TransitionsBefore, 4512 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, 469 PlacesBefore, 469 PlacesAfterwards, 4900 TransitionsBefore, 4900 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, 513 PlacesBefore, 513 PlacesAfterwards, 5176 TransitionsBefore, 5176 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, 549 PlacesBefore, 549 PlacesAfterwards, 5336 TransitionsBefore, 5336 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, 5666 TransitionsBefore, 5666 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, 626 PlacesBefore, 626 PlacesAfterwards, 5773 TransitionsBefore, 5773 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, 661 PlacesBefore, 661 PlacesAfterwards, 5809 TransitionsBefore, 5809 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, 694 PlacesBefore, 694 PlacesAfterwards, 6314 TransitionsBefore, 6314 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, 721 PlacesBefore, 721 PlacesAfterwards, 6792 TransitionsBefore, 6792 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, 754 PlacesBefore, 754 PlacesAfterwards, 6828 TransitionsBefore, 6828 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: 91]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (18states, 0/19 universal loopers) in iteration 42,while PetriNetUnfolder was constructing finite prefix that currently has 142381 conditions, 3350 events (1788/3349 cut-off events. For 34160/34160 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 27860 event pairs, 0 based on Foata normal form. 0/3396 useless extension candidates. Maximal degree in co-relation 79393. Up to 3253 conditions per place.). - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (18states, 0/19 universal loopers) in iteration 42,while PetriNetUnfolder was constructing finite prefix that currently has 142381 conditions, 3350 events (1788/3349 cut-off events. For 34160/34160 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 27860 event pairs, 0 based on Foata normal form. 0/3396 useless extension candidates. Maximal degree in co-relation 79393. Up to 3253 conditions per place.). - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (18states, 0/19 universal loopers) in iteration 42,while PetriNetUnfolder was constructing finite prefix that currently has 142381 conditions, 3350 events (1788/3349 cut-off events. For 34160/34160 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 27860 event pairs, 0 based on Foata normal form. 0/3396 useless extension candidates. Maximal degree in co-relation 79393. Up to 3253 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 213 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: 847.9s, OverallIterations: 42, TraceHistogramMax: 3, PathProgramHistogramMax: 24, EmptinessCheckTime: 0.0s, AutomataDifference: 770.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 199 mSolverCounterUnknown, 3965 SdHoareTripleChecker+Valid, 178.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3965 mSDsluCounter, 379 SdHoareTripleChecker+Invalid, 175.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 674 IncrementalHoareTripleChecker+Unchecked, 273 mSDsCounter, 837 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20743 IncrementalHoareTripleChecker+Invalid, 22453 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 837 mSolverCounterUnsat, 106 mSDtfsCounter, 20743 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2333 GetRequests, 1256 SyntacticMatches, 59 SemanticMatches, 1018 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 7141 ImplicationChecksByTransitivity, 178.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=574844occurred in iteration=41, InterpolantAutomatonStates: 819, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 41.1s InterpolantComputationTime, 1341 NumberOfCodeBlocks, 1341 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 1845 ConstructedInterpolants, 152 QuantifiedInterpolants, 30910 SizeOfPredicates, 231 NumberOfNonLiveVariables, 7361 ConjunctsInSsa, 727 ConjunctsInUnsatCore, 115 InterpolantComputations, 6 PerfectInterpolantSequences, 94/761 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