/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/test-easy11.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 08:38:36,463 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 08:38:36,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 08:38:36,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 08:38:36,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 08:38:36,517 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 08:38:36,520 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 08:38:36,523 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 08:38:36,527 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 08:38:36,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 08:38:36,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 08:38:36,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 08:38:36,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 08:38:36,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 08:38:36,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 08:38:36,538 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 08:38:36,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 08:38:36,539 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 08:38:36,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 08:38:36,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 08:38:36,543 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 08:38:36,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 08:38:36,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 08:38:36,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 08:38:36,553 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 08:38:36,553 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 08:38:36,553 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 08:38:36,554 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 08:38:36,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 08:38:36,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 08:38:36,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 08:38:36,555 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 08:38:36,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 08:38:36,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 08:38:36,557 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 08:38:36,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 08:38:36,558 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 08:38:36,558 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 08:38:36,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 08:38:36,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 08:38:36,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 08:38:36,567 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:38:36,597 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 08:38:36,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 08:38:36,599 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 08:38:36,599 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 08:38:36,599 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 08:38:36,600 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 08:38:36,600 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 08:38:36,600 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 08:38:36,600 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 08:38:36,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 08:38:36,601 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 08:38:36,601 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 08:38:36,601 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 08:38:36,601 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 08:38:36,602 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 08:38:36,602 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 08:38:36,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 08:38:36,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 08:38:36,602 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 08:38:36,602 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 08:38:36,602 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 08:38:36,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 08:38:36,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 08:38:36,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 08:38:36,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 08:38:36,603 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 08:38:36,603 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 08:38:36,603 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 08:38:36,604 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:38:36,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 08:38:36,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 08:38:36,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 08:38:36,940 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 08:38:36,941 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 08:38:36,942 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy11.wvr.c [2022-12-13 08:38:38,062 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 08:38:38,233 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 08:38:38,233 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy11.wvr.c [2022-12-13 08:38:38,238 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13b3a407e/7adf06ebc0ae434c806e5e187163e130/FLAG050c0054c [2022-12-13 08:38:38,259 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13b3a407e/7adf06ebc0ae434c806e5e187163e130 [2022-12-13 08:38:38,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 08:38:38,266 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 08:38:38,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 08:38:38,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 08:38:38,270 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 08:38:38,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:38:38" (1/1) ... [2022-12-13 08:38:38,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25ed8a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:38:38, skipping insertion in model container [2022-12-13 08:38:38,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:38:38" (1/1) ... [2022-12-13 08:38:38,277 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 08:38:38,292 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 08:38:38,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:38:38,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:38:38,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:38:38,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:38:38,457 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/test-easy11.wvr.c[2005,2018] [2022-12-13 08:38:38,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 08:38:38,468 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 08:38:38,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:38:38,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:38:38,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 08:38:38,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 08:38:38,492 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/test-easy11.wvr.c[2005,2018] [2022-12-13 08:38:38,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 08:38:38,508 INFO L208 MainTranslator]: Completed translation [2022-12-13 08:38:38,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:38:38 WrapperNode [2022-12-13 08:38:38,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 08:38:38,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 08:38:38,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 08:38:38,509 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 08:38:38,515 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:38:38" (1/1) ... [2022-12-13 08:38:38,522 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:38:38" (1/1) ... [2022-12-13 08:38:38,541 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 53 [2022-12-13 08:38:38,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 08:38:38,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 08:38:38,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 08:38:38,542 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 08:38:38,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:38:38" (1/1) ... [2022-12-13 08:38:38,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:38:38" (1/1) ... [2022-12-13 08:38:38,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:38:38" (1/1) ... [2022-12-13 08:38:38,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:38:38" (1/1) ... [2022-12-13 08:38:38,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:38:38" (1/1) ... [2022-12-13 08:38:38,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:38:38" (1/1) ... [2022-12-13 08:38:38,571 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:38:38" (1/1) ... [2022-12-13 08:38:38,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:38:38" (1/1) ... [2022-12-13 08:38:38,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 08:38:38,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 08:38:38,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 08:38:38,574 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 08:38:38,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:38:38" (1/1) ... [2022-12-13 08:38:38,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 08:38:38,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:38:38,608 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:38:38,632 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:38:38,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 08:38:38,653 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 08:38:38,655 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 08:38:38,655 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 08:38:38,655 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 08:38:38,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 08:38:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 08:38:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 08:38:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 08:38:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 08:38:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 08:38:38,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 08:38:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 08:38:38,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 08:38:38,658 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:38:38,753 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 08:38:38,754 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 08:38:38,937 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 08:38:38,943 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 08:38:38,943 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 08:38:38,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:38:38 BoogieIcfgContainer [2022-12-13 08:38:38,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 08:38:38,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 08:38:38,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 08:38:38,949 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 08:38:38,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:38:38" (1/3) ... [2022-12-13 08:38:38,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285e0e0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:38:38, skipping insertion in model container [2022-12-13 08:38:38,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:38:38" (2/3) ... [2022-12-13 08:38:38,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285e0e0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:38:38, skipping insertion in model container [2022-12-13 08:38:38,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:38:38" (3/3) ... [2022-12-13 08:38:38,967 INFO L112 eAbstractionObserver]: Analyzing ICFG test-easy11.wvr.c [2022-12-13 08:38:38,982 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 08:38:38,983 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 08:38:38,983 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 08:38:39,036 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 08:38:39,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 80 transitions, 176 flow [2022-12-13 08:38:39,141 INFO L130 PetriNetUnfolder]: 6/78 cut-off events. [2022-12-13 08:38:39,141 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 08:38:39,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 78 events. 6/78 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2022-12-13 08:38:39,146 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 80 transitions, 176 flow [2022-12-13 08:38:39,148 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 70 transitions, 152 flow [2022-12-13 08:38:39,150 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:39,163 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 70 transitions, 152 flow [2022-12-13 08:38:39,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 70 transitions, 152 flow [2022-12-13 08:38:39,201 INFO L130 PetriNetUnfolder]: 6/70 cut-off events. [2022-12-13 08:38:39,202 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 08:38:39,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 70 events. 6/70 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2022-12-13 08:38:39,204 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 70 transitions, 152 flow [2022-12-13 08:38:39,204 INFO L226 LiptonReduction]: Number of co-enabled transitions 572 [2022-12-13 08:38:41,269 INFO L241 LiptonReduction]: Total number of compositions: 55 [2022-12-13 08:38:41,281 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 08:38:41,286 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;@7956ed1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 08:38:41,287 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 08:38:41,292 INFO L130 PetriNetUnfolder]: 2/14 cut-off events. [2022-12-13 08:38:41,292 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 08:38:41,292 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:41,292 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:41,293 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:38:41,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:41,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1773824805, now seen corresponding path program 1 times [2022-12-13 08:38:41,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:41,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502008630] [2022-12-13 08:38:41,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:41,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:41,833 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:38:41,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:41,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502008630] [2022-12-13 08:38:41,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502008630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:38:41,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:38:41,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:38:41,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342380992] [2022-12-13 08:38:41,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:38:41,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 08:38:41,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:41,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 08:38:41,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 08:38:41,866 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 08:38:41,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 42 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have 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:38:41,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:41,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 08:38:41,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:42,034 INFO L130 PetriNetUnfolder]: 42/82 cut-off events. [2022-12-13 08:38:42,034 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-13 08:38:42,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 82 events. 42/82 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 170 event pairs, 7 based on Foata normal form. 1/65 useless extension candidates. Maximal degree in co-relation 132. Up to 34 conditions per place. [2022-12-13 08:38:42,037 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 23 selfloop transitions, 8 changer transitions 5/36 dead transitions. [2022-12-13 08:38:42,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 36 transitions, 165 flow [2022-12-13 08:38:42,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 08:38:42,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 08:38:42,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2022-12-13 08:38:42,049 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2022-12-13 08:38:42,052 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 6 predicate places. [2022-12-13 08:38:42,052 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 36 transitions, 165 flow [2022-12-13 08:38:42,054 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 31 transitions, 139 flow [2022-12-13 08:38:42,056 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:42,057 INFO L89 Accepts]: Start accepts. Operand has 25 places, 31 transitions, 139 flow [2022-12-13 08:38:42,059 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:42,059 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:42,060 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 31 transitions, 139 flow [2022-12-13 08:38:42,070 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 31 transitions, 139 flow [2022-12-13 08:38:42,070 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:42,071 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:42,074 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 08:38:42,074 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 31 transitions, 139 flow [2022-12-13 08:38:42,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have 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:38:42,074 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:42,075 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:42,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 08:38:42,078 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:38:42,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:42,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1697445439, now seen corresponding path program 2 times [2022-12-13 08:38:42,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:42,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575262426] [2022-12-13 08:38:42,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:42,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:42,260 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:38:42,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:42,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575262426] [2022-12-13 08:38:42,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575262426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:38:42,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:38:42,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:38:42,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538467306] [2022-12-13 08:38:42,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:38:42,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 08:38:42,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:42,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 08:38:42,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 08:38:42,264 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 08:38:42,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 31 transitions, 139 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have 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:38:42,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:42,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 08:38:42,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:42,391 INFO L130 PetriNetUnfolder]: 47/91 cut-off events. [2022-12-13 08:38:42,391 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-13 08:38:42,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 91 events. 47/91 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 206 event pairs, 0 based on Foata normal form. 1/72 useless extension candidates. Maximal degree in co-relation 227. Up to 49 conditions per place. [2022-12-13 08:38:42,392 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 35 selfloop transitions, 10 changer transitions 5/50 dead transitions. [2022-12-13 08:38:42,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 50 transitions, 330 flow [2022-12-13 08:38:42,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 08:38:42,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 08:38:42,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-12-13 08:38:42,394 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 08:38:42,395 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 11 predicate places. [2022-12-13 08:38:42,395 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 50 transitions, 330 flow [2022-12-13 08:38:42,396 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 45 transitions, 294 flow [2022-12-13 08:38:42,397 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:42,397 INFO L89 Accepts]: Start accepts. Operand has 30 places, 45 transitions, 294 flow [2022-12-13 08:38:42,398 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:42,398 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:42,398 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 45 transitions, 294 flow [2022-12-13 08:38:42,399 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 45 transitions, 294 flow [2022-12-13 08:38:42,399 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:42,400 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:42,401 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 08:38:42,401 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 45 transitions, 294 flow [2022-12-13 08:38:42,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have 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:38:42,401 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:42,401 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:42,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 08:38:42,401 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:38:42,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:42,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1166573085, now seen corresponding path program 3 times [2022-12-13 08:38:42,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:42,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644704577] [2022-12-13 08:38:42,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:42,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:42,561 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:38:42,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:42,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644704577] [2022-12-13 08:38:42,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644704577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:38:42,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:38:42,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:38:42,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669862138] [2022-12-13 08:38:42,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:38:42,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 08:38:42,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:42,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 08:38:42,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 08:38:42,564 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 08:38:42,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 45 transitions, 294 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have 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:38:42,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:42,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 08:38:42,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:42,687 INFO L130 PetriNetUnfolder]: 53/101 cut-off events. [2022-12-13 08:38:42,687 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-13 08:38:42,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 101 events. 53/101 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 244 event pairs, 0 based on Foata normal form. 1/80 useless extension candidates. Maximal degree in co-relation 341. Up to 58 conditions per place. [2022-12-13 08:38:42,688 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 39 selfloop transitions, 13 changer transitions 5/57 dead transitions. [2022-12-13 08:38:42,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 57 transitions, 486 flow [2022-12-13 08:38:42,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 08:38:42,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 08:38:42,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-12-13 08:38:42,690 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 08:38:42,690 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 16 predicate places. [2022-12-13 08:38:42,690 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 57 transitions, 486 flow [2022-12-13 08:38:42,691 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 52 transitions, 440 flow [2022-12-13 08:38:42,692 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:42,692 INFO L89 Accepts]: Start accepts. Operand has 35 places, 52 transitions, 440 flow [2022-12-13 08:38:42,693 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:42,693 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:42,694 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 52 transitions, 440 flow [2022-12-13 08:38:42,695 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 52 transitions, 440 flow [2022-12-13 08:38:42,695 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:42,695 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:42,696 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 08:38:42,696 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 52 transitions, 440 flow [2022-12-13 08:38:42,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have 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:38:42,697 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:42,697 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:42,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 08:38:42,697 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:38:42,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:42,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1134456465, now seen corresponding path program 4 times [2022-12-13 08:38:42,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:42,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649743698] [2022-12-13 08:38:42,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:42,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:42,834 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:38:42,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:42,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649743698] [2022-12-13 08:38:42,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649743698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:38:42,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:38:42,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:38:42,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979489588] [2022-12-13 08:38:42,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:38:42,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 08:38:42,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:42,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 08:38:42,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 08:38:42,837 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 08:38:42,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 52 transitions, 440 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have 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:38:42,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:42,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 08:38:42,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:42,962 INFO L130 PetriNetUnfolder]: 58/110 cut-off events. [2022-12-13 08:38:42,962 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-13 08:38:42,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 110 events. 58/110 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 277 event pairs, 0 based on Foata normal form. 1/87 useless extension candidates. Maximal degree in co-relation 471. Up to 73 conditions per place. [2022-12-13 08:38:42,966 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 43 selfloop transitions, 13 changer transitions 5/61 dead transitions. [2022-12-13 08:38:42,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 61 transitions, 643 flow [2022-12-13 08:38:42,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 08:38:42,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 08:38:42,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-12-13 08:38:42,968 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-13 08:38:42,970 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 21 predicate places. [2022-12-13 08:38:42,970 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 61 transitions, 643 flow [2022-12-13 08:38:42,971 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 56 transitions, 587 flow [2022-12-13 08:38:42,974 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:42,974 INFO L89 Accepts]: Start accepts. Operand has 40 places, 56 transitions, 587 flow [2022-12-13 08:38:42,977 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:42,982 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:42,982 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 56 transitions, 587 flow [2022-12-13 08:38:42,983 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 56 transitions, 587 flow [2022-12-13 08:38:42,983 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:42,984 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:42,985 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 08:38:42,985 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 56 transitions, 587 flow [2022-12-13 08:38:42,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have 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:38:42,985 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:42,985 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:42,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 08:38:42,986 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:38:42,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:42,986 INFO L85 PathProgramCache]: Analyzing trace with hash 389753967, now seen corresponding path program 5 times [2022-12-13 08:38:42,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:42,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141779126] [2022-12-13 08:38:42,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:42,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:43,152 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:38:43,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:43,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141779126] [2022-12-13 08:38:43,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141779126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:38:43,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:38:43,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:38:43,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185052479] [2022-12-13 08:38:43,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:38:43,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 08:38:43,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:43,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 08:38:43,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 08:38:43,154 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 08:38:43,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 56 transitions, 587 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have 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:38:43,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:43,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 08:38:43,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:43,266 INFO L130 PetriNetUnfolder]: 68/126 cut-off events. [2022-12-13 08:38:43,266 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-13 08:38:43,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 126 events. 68/126 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 328 event pairs, 2 based on Foata normal form. 1/99 useless extension candidates. Maximal degree in co-relation 661. Up to 84 conditions per place. [2022-12-13 08:38:43,268 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 50 selfloop transitions, 15 changer transitions 5/70 dead transitions. [2022-12-13 08:38:43,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 70 transitions, 876 flow [2022-12-13 08:38:43,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 08:38:43,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 08:38:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-12-13 08:38:43,270 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 08:38:43,271 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 26 predicate places. [2022-12-13 08:38:43,272 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 70 transitions, 876 flow [2022-12-13 08:38:43,273 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 65 transitions, 810 flow [2022-12-13 08:38:43,275 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:43,275 INFO L89 Accepts]: Start accepts. Operand has 45 places, 65 transitions, 810 flow [2022-12-13 08:38:43,277 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:43,277 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:43,277 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 65 transitions, 810 flow [2022-12-13 08:38:43,279 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 65 transitions, 810 flow [2022-12-13 08:38:43,279 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:43,281 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:43,284 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 08:38:43,284 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 65 transitions, 810 flow [2022-12-13 08:38:43,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have 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:38:43,284 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:43,284 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:43,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 08:38:43,284 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:38:43,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:43,285 INFO L85 PathProgramCache]: Analyzing trace with hash 421870587, now seen corresponding path program 6 times [2022-12-13 08:38:43,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:43,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339616608] [2022-12-13 08:38:43,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:43,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:43,420 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:38:43,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:43,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339616608] [2022-12-13 08:38:43,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339616608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:38:43,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:38:43,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:38:43,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91762820] [2022-12-13 08:38:43,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:38:43,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 08:38:43,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:43,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 08:38:43,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 08:38:43,422 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 08:38:43,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 65 transitions, 810 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have 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:38:43,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:43,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 08:38:43,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:43,545 INFO L130 PetriNetUnfolder]: 67/127 cut-off events. [2022-12-13 08:38:43,545 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-13 08:38:43,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 127 events. 67/127 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 341 event pairs, 2 based on Foata normal form. 1/102 useless extension candidates. Maximal degree in co-relation 777. Up to 85 conditions per place. [2022-12-13 08:38:43,547 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 52 selfloop transitions, 15 changer transitions 5/72 dead transitions. [2022-12-13 08:38:43,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 72 transitions, 1044 flow [2022-12-13 08:38:43,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 08:38:43,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 08:38:43,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-12-13 08:38:43,549 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3904761904761905 [2022-12-13 08:38:43,551 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2022-12-13 08:38:43,552 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 72 transitions, 1044 flow [2022-12-13 08:38:43,554 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 67 transitions, 968 flow [2022-12-13 08:38:43,555 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:43,555 INFO L89 Accepts]: Start accepts. Operand has 50 places, 67 transitions, 968 flow [2022-12-13 08:38:43,556 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:43,556 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:43,556 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 67 transitions, 968 flow [2022-12-13 08:38:43,557 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 67 transitions, 968 flow [2022-12-13 08:38:43,557 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:43,558 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:43,559 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 08:38:43,559 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 67 transitions, 968 flow [2022-12-13 08:38:43,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have 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:38:43,559 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:43,559 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:43,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 08:38:43,560 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:38:43,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:43,560 INFO L85 PathProgramCache]: Analyzing trace with hash 453088204, now seen corresponding path program 1 times [2022-12-13 08:38:43,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:43,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762012486] [2022-12-13 08:38:43,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:43,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:43,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:43,606 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:38:43,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:43,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762012486] [2022-12-13 08:38:43,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762012486] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:38:43,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:38:43,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:38:43,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496698909] [2022-12-13 08:38:43,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:38:43,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 08:38:43,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:43,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 08:38:43,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 08:38:43,613 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 08:38:43,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 67 transitions, 968 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have 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:38:43,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:43,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 08:38:43,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:43,701 INFO L130 PetriNetUnfolder]: 104/195 cut-off events. [2022-12-13 08:38:43,701 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-13 08:38:43,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1595 conditions, 195 events. 104/195 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 635 event pairs, 0 based on Foata normal form. 4/157 useless extension candidates. Maximal degree in co-relation 1363. Up to 134 conditions per place. [2022-12-13 08:38:43,703 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 78 selfloop transitions, 23 changer transitions 7/108 dead transitions. [2022-12-13 08:38:43,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 108 transitions, 1779 flow [2022-12-13 08:38:43,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 08:38:43,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 08:38:43,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-12-13 08:38:43,706 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2022-12-13 08:38:43,706 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 36 predicate places. [2022-12-13 08:38:43,706 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 108 transitions, 1779 flow [2022-12-13 08:38:43,709 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 101 transitions, 1661 flow [2022-12-13 08:38:43,711 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:43,712 INFO L89 Accepts]: Start accepts. Operand has 56 places, 101 transitions, 1661 flow [2022-12-13 08:38:43,713 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:43,713 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:43,713 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 101 transitions, 1661 flow [2022-12-13 08:38:43,715 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 101 transitions, 1661 flow [2022-12-13 08:38:43,715 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:43,715 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:43,717 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 08:38:43,717 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 101 transitions, 1661 flow [2022-12-13 08:38:43,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have 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:38:43,717 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:43,718 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:43,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 08:38:43,718 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:38:43,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:43,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1435396409, now seen corresponding path program 1 times [2022-12-13 08:38:43,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:43,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152611063] [2022-12-13 08:38:43,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:43,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:43,756 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:38:43,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:43,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152611063] [2022-12-13 08:38:43,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152611063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:38:43,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:38:43,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:38:43,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032989429] [2022-12-13 08:38:43,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:38:43,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 08:38:43,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:43,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 08:38:43,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 08:38:43,758 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 08:38:43,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 101 transitions, 1661 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have 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:38:43,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:43,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 08:38:43,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:43,846 INFO L130 PetriNetUnfolder]: 114/219 cut-off events. [2022-12-13 08:38:43,846 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-13 08:38:43,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2009 conditions, 219 events. 114/219 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 745 event pairs, 0 based on Foata normal form. 4/173 useless extension candidates. Maximal degree in co-relation 1750. Up to 153 conditions per place. [2022-12-13 08:38:43,849 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 101 selfloop transitions, 22 changer transitions 4/127 dead transitions. [2022-12-13 08:38:43,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 127 transitions, 2349 flow [2022-12-13 08:38:43,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:38:43,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 08:38:43,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-12-13 08:38:43,850 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2022-12-13 08:38:43,852 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 41 predicate places. [2022-12-13 08:38:43,852 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 127 transitions, 2349 flow [2022-12-13 08:38:43,855 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 123 transitions, 2277 flow [2022-12-13 08:38:43,857 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:43,857 INFO L89 Accepts]: Start accepts. Operand has 60 places, 123 transitions, 2277 flow [2022-12-13 08:38:43,858 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:43,858 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:43,858 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 123 transitions, 2277 flow [2022-12-13 08:38:43,861 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 123 transitions, 2277 flow [2022-12-13 08:38:43,861 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:43,862 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:43,864 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 08:38:43,864 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 123 transitions, 2277 flow [2022-12-13 08:38:43,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have 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:38:43,864 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:43,864 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:43,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 08:38:43,865 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:38:43,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:43,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1998912419, now seen corresponding path program 2 times [2022-12-13 08:38:43,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:43,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142645436] [2022-12-13 08:38:43,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:43,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:43,903 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:38:43,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:43,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142645436] [2022-12-13 08:38:43,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142645436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:38:43,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:38:43,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:38:43,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306312720] [2022-12-13 08:38:43,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:38:43,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 08:38:43,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:43,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 08:38:43,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 08:38:43,905 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 08:38:43,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 123 transitions, 2277 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have 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:38:43,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:43,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 08:38:43,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:43,995 INFO L130 PetriNetUnfolder]: 112/215 cut-off events. [2022-12-13 08:38:43,995 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-13 08:38:43,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2190 conditions, 215 events. 112/215 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 713 event pairs, 0 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 1904. Up to 167 conditions per place. [2022-12-13 08:38:43,998 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 109 selfloop transitions, 15 changer transitions 0/124 dead transitions. [2022-12-13 08:38:43,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 124 transitions, 2546 flow [2022-12-13 08:38:43,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 08:38:43,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 08:38:43,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-12-13 08:38:43,999 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4533333333333333 [2022-12-13 08:38:44,000 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 44 predicate places. [2022-12-13 08:38:44,000 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 124 transitions, 2546 flow [2022-12-13 08:38:44,003 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 124 transitions, 2546 flow [2022-12-13 08:38:44,005 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:44,005 INFO L89 Accepts]: Start accepts. Operand has 64 places, 124 transitions, 2546 flow [2022-12-13 08:38:44,007 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:44,007 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:44,007 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 124 transitions, 2546 flow [2022-12-13 08:38:44,009 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 124 transitions, 2546 flow [2022-12-13 08:38:44,009 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:44,010 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:44,010 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 08:38:44,010 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 124 transitions, 2546 flow [2022-12-13 08:38:44,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have 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:38:44,011 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:44,011 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:44,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 08:38:44,011 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:38:44,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:44,011 INFO L85 PathProgramCache]: Analyzing trace with hash 808144982, now seen corresponding path program 2 times [2022-12-13 08:38:44,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:44,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985908966] [2022-12-13 08:38:44,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:44,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:44,043 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:38:44,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:44,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985908966] [2022-12-13 08:38:44,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985908966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:38:44,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:38:44,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:38:44,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462646555] [2022-12-13 08:38:44,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:38:44,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 08:38:44,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:44,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 08:38:44,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 08:38:44,045 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 08:38:44,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 124 transitions, 2546 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have 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:38:44,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:44,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 08:38:44,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:44,154 INFO L130 PetriNetUnfolder]: 122/247 cut-off events. [2022-12-13 08:38:44,155 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-12-13 08:38:44,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2763 conditions, 247 events. 122/247 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 929 event pairs, 0 based on Foata normal form. 4/199 useless extension candidates. Maximal degree in co-relation 2404. Up to 199 conditions per place. [2022-12-13 08:38:44,158 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 120 selfloop transitions, 24 changer transitions 4/148 dead transitions. [2022-12-13 08:38:44,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 148 transitions, 3337 flow [2022-12-13 08:38:44,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 08:38:44,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 08:38:44,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2022-12-13 08:38:44,160 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2022-12-13 08:38:44,160 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 51 predicate places. [2022-12-13 08:38:44,160 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 148 transitions, 3337 flow [2022-12-13 08:38:44,164 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 144 transitions, 3246 flow [2022-12-13 08:38:44,166 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:44,167 INFO L89 Accepts]: Start accepts. Operand has 71 places, 144 transitions, 3246 flow [2022-12-13 08:38:44,168 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:44,168 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:44,168 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 144 transitions, 3246 flow [2022-12-13 08:38:44,171 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 144 transitions, 3246 flow [2022-12-13 08:38:44,171 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:44,171 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:44,185 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 08:38:44,185 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 144 transitions, 3246 flow [2022-12-13 08:38:44,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have 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:38:44,185 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:44,185 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:44,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 08:38:44,186 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:38:44,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:44,186 INFO L85 PathProgramCache]: Analyzing trace with hash 631482004, now seen corresponding path program 3 times [2022-12-13 08:38:44,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:44,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576497679] [2022-12-13 08:38:44,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:44,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:44,216 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:38:44,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:44,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576497679] [2022-12-13 08:38:44,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576497679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:38:44,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:38:44,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:38:44,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932696948] [2022-12-13 08:38:44,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:38:44,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 08:38:44,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:44,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 08:38:44,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 08:38:44,218 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 08:38:44,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 144 transitions, 3246 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have 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:38:44,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:44,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 08:38:44,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:44,297 INFO L130 PetriNetUnfolder]: 115/226 cut-off events. [2022-12-13 08:38:44,297 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-13 08:38:44,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2755 conditions, 226 events. 115/226 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 773 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 2390. Up to 183 conditions per place. [2022-12-13 08:38:44,300 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 119 selfloop transitions, 14 changer transitions 0/133 dead transitions. [2022-12-13 08:38:44,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 133 transitions, 3261 flow [2022-12-13 08:38:44,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 08:38:44,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 08:38:44,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-12-13 08:38:44,301 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-13 08:38:44,301 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 55 predicate places. [2022-12-13 08:38:44,301 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 133 transitions, 3261 flow [2022-12-13 08:38:44,305 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 133 transitions, 3261 flow [2022-12-13 08:38:44,307 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:44,307 INFO L89 Accepts]: Start accepts. Operand has 75 places, 133 transitions, 3261 flow [2022-12-13 08:38:44,308 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:44,308 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:44,308 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 133 transitions, 3261 flow [2022-12-13 08:38:44,311 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 133 transitions, 3261 flow [2022-12-13 08:38:44,311 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:44,311 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:44,312 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 08:38:44,312 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 133 transitions, 3261 flow [2022-12-13 08:38:44,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have 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:38:44,312 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:44,312 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:44,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 08:38:44,312 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:38:44,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:44,313 INFO L85 PathProgramCache]: Analyzing trace with hash -175544549, now seen corresponding path program 3 times [2022-12-13 08:38:44,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:44,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569945174] [2022-12-13 08:38:44,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:44,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:44,343 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:38:44,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:44,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569945174] [2022-12-13 08:38:44,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569945174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:38:44,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:38:44,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:38:44,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844905460] [2022-12-13 08:38:44,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:38:44,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 08:38:44,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:44,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 08:38:44,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 08:38:44,344 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 08:38:44,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 133 transitions, 3261 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have 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:38:44,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:44,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 08:38:44,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:44,456 INFO L130 PetriNetUnfolder]: 147/294 cut-off events. [2022-12-13 08:38:44,456 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-12-13 08:38:44,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3872 conditions, 294 events. 147/294 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1143 event pairs, 0 based on Foata normal form. 2/234 useless extension candidates. Maximal degree in co-relation 3424. Up to 245 conditions per place. [2022-12-13 08:38:44,460 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 141 selfloop transitions, 33 changer transitions 2/176 dead transitions. [2022-12-13 08:38:44,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 176 transitions, 4663 flow [2022-12-13 08:38:44,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 08:38:44,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 08:38:44,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-12-13 08:38:44,461 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-13 08:38:44,461 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 62 predicate places. [2022-12-13 08:38:44,461 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 176 transitions, 4663 flow [2022-12-13 08:38:44,466 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 174 transitions, 4611 flow [2022-12-13 08:38:44,469 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:44,469 INFO L89 Accepts]: Start accepts. Operand has 82 places, 174 transitions, 4611 flow [2022-12-13 08:38:44,471 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:44,471 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:44,471 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 174 transitions, 4611 flow [2022-12-13 08:38:44,474 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 174 transitions, 4611 flow [2022-12-13 08:38:44,475 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:44,475 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:44,476 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 08:38:44,476 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 174 transitions, 4611 flow [2022-12-13 08:38:44,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have 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:38:44,476 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:44,476 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:44,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 08:38:44,476 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:38:44,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:44,477 INFO L85 PathProgramCache]: Analyzing trace with hash 624460027, now seen corresponding path program 4 times [2022-12-13 08:38:44,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:44,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589242135] [2022-12-13 08:38:44,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:44,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:44,514 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:38:44,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:44,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589242135] [2022-12-13 08:38:44,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589242135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:38:44,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:38:44,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:38:44,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317809477] [2022-12-13 08:38:44,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:38:44,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 08:38:44,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:44,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 08:38:44,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 08:38:44,516 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 08:38:44,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 174 transitions, 4611 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have 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:38:44,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:44,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 08:38:44,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:44,613 INFO L130 PetriNetUnfolder]: 142/279 cut-off events. [2022-12-13 08:38:44,613 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-12-13 08:38:44,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3955 conditions, 279 events. 142/279 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1054 event pairs, 0 based on Foata normal form. 2/223 useless extension candidates. Maximal degree in co-relation 3503. Up to 230 conditions per place. [2022-12-13 08:38:44,617 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 132 selfloop transitions, 29 changer transitions 4/165 dead transitions. [2022-12-13 08:38:44,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 165 transitions, 4701 flow [2022-12-13 08:38:44,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 08:38:44,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 08:38:44,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-12-13 08:38:44,618 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3904761904761905 [2022-12-13 08:38:44,618 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 68 predicate places. [2022-12-13 08:38:44,618 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 165 transitions, 4701 flow [2022-12-13 08:38:44,623 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 161 transitions, 4589 flow [2022-12-13 08:38:44,626 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:44,626 INFO L89 Accepts]: Start accepts. Operand has 88 places, 161 transitions, 4589 flow [2022-12-13 08:38:44,628 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:44,628 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:44,628 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 161 transitions, 4589 flow [2022-12-13 08:38:44,631 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 161 transitions, 4589 flow [2022-12-13 08:38:44,631 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:44,632 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:44,632 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 08:38:44,632 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 161 transitions, 4589 flow [2022-12-13 08:38:44,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have 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:38:44,633 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:44,633 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:44,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 08:38:44,633 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:38:44,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:44,633 INFO L85 PathProgramCache]: Analyzing trace with hash -802795976, now seen corresponding path program 4 times [2022-12-13 08:38:44,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:44,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274100590] [2022-12-13 08:38:44,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:44,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:44,671 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:38:44,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:44,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274100590] [2022-12-13 08:38:44,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274100590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:38:44,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:38:44,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:38:44,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568051326] [2022-12-13 08:38:44,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:38:44,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 08:38:44,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:44,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 08:38:44,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 08:38:44,673 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 08:38:44,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 161 transitions, 4589 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have 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:38:44,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:44,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 08:38:44,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:44,801 INFO L130 PetriNetUnfolder]: 122/245 cut-off events. [2022-12-13 08:38:44,801 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-13 08:38:44,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3722 conditions, 245 events. 122/245 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 900 event pairs, 0 based on Foata normal form. 8/205 useless extension candidates. Maximal degree in co-relation 3270. Up to 199 conditions per place. [2022-12-13 08:38:44,805 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 121 selfloop transitions, 22 changer transitions 8/151 dead transitions. [2022-12-13 08:38:44,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 151 transitions, 4605 flow [2022-12-13 08:38:44,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 08:38:44,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 08:38:44,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-12-13 08:38:44,806 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2022-12-13 08:38:44,807 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 73 predicate places. [2022-12-13 08:38:44,807 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 151 transitions, 4605 flow [2022-12-13 08:38:44,812 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 143 transitions, 4359 flow [2022-12-13 08:38:44,815 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:44,815 INFO L89 Accepts]: Start accepts. Operand has 92 places, 143 transitions, 4359 flow [2022-12-13 08:38:44,817 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:44,817 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:44,818 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 143 transitions, 4359 flow [2022-12-13 08:38:44,820 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 143 transitions, 4359 flow [2022-12-13 08:38:44,821 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:44,821 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:44,822 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 08:38:44,822 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 143 transitions, 4359 flow [2022-12-13 08:38:44,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have 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:38:44,822 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:44,822 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:44,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 08:38:44,823 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:38:44,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:44,823 INFO L85 PathProgramCache]: Analyzing trace with hash 685113919, now seen corresponding path program 5 times [2022-12-13 08:38:44,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:44,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760188058] [2022-12-13 08:38:44,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:44,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:44,858 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:38:44,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:44,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760188058] [2022-12-13 08:38:44,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760188058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 08:38:44,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 08:38:44,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 08:38:44,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829274901] [2022-12-13 08:38:44,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:38:44,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 08:38:44,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:44,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 08:38:44,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 08:38:44,860 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 08:38:44,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 143 transitions, 4359 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have 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:38:44,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:44,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 08:38:44,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:44,954 INFO L130 PetriNetUnfolder]: 114/221 cut-off events. [2022-12-13 08:38:44,954 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-13 08:38:44,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3580 conditions, 221 events. 114/221 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 735 event pairs, 0 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 3132. Up to 176 conditions per place. [2022-12-13 08:38:44,958 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 118 selfloop transitions, 16 changer transitions 0/134 dead transitions. [2022-12-13 08:38:44,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 134 transitions, 4351 flow [2022-12-13 08:38:44,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 08:38:44,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 08:38:44,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-12-13 08:38:44,959 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4266666666666667 [2022-12-13 08:38:44,960 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 74 predicate places. [2022-12-13 08:38:44,960 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 134 transitions, 4351 flow [2022-12-13 08:38:44,965 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 134 transitions, 4351 flow [2022-12-13 08:38:44,968 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:44,968 INFO L89 Accepts]: Start accepts. Operand has 94 places, 134 transitions, 4351 flow [2022-12-13 08:38:44,970 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:44,970 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:44,970 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 134 transitions, 4351 flow [2022-12-13 08:38:44,973 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 134 transitions, 4351 flow [2022-12-13 08:38:44,973 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:44,973 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:44,974 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 08:38:44,974 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 134 transitions, 4351 flow [2022-12-13 08:38:44,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have 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:38:44,974 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:44,974 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:44,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 08:38:44,974 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:38:44,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:44,975 INFO L85 PathProgramCache]: Analyzing trace with hash -947342334, now seen corresponding path program 5 times [2022-12-13 08:38:44,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:44,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003235830] [2022-12-13 08:38:44,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:44,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:45,005 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:38:45,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:45,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003235830] [2022-12-13 08:38:45,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003235830] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:38:45,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6223135] [2022-12-13 08:38:45,006 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 08:38:45,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:38:45,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:38:45,024 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:38:45,044 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:38:45,097 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:38:45,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:38:45,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 08:38:45,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:38:45,164 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:38:45,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:38:45,199 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:38:45,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6223135] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 08:38:45,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 08:38:45,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 7 [2022-12-13 08:38:45,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310417666] [2022-12-13 08:38:45,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 08:38:45,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 08:38:45,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:45,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 08:38:45,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 08:38:45,201 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 08:38:45,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 134 transitions, 4351 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have 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:38:45,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:45,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 08:38:45,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:45,324 INFO L130 PetriNetUnfolder]: 108/205 cut-off events. [2022-12-13 08:38:45,324 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-13 08:38:45,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3527 conditions, 205 events. 108/205 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 642 event pairs, 0 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 3087. Up to 166 conditions per place. [2022-12-13 08:38:45,327 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 102 selfloop transitions, 21 changer transitions 0/123 dead transitions. [2022-12-13 08:38:45,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 123 transitions, 4236 flow [2022-12-13 08:38:45,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 08:38:45,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 08:38:45,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-13 08:38:45,328 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48 [2022-12-13 08:38:45,328 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 76 predicate places. [2022-12-13 08:38:45,328 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 123 transitions, 4236 flow [2022-12-13 08:38:45,332 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 123 transitions, 4236 flow [2022-12-13 08:38:45,334 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:45,334 INFO L89 Accepts]: Start accepts. Operand has 96 places, 123 transitions, 4236 flow [2022-12-13 08:38:45,336 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:45,336 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:45,336 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 123 transitions, 4236 flow [2022-12-13 08:38:45,339 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 123 transitions, 4236 flow [2022-12-13 08:38:45,339 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:45,339 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:45,340 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 08:38:45,340 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 123 transitions, 4236 flow [2022-12-13 08:38:45,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have 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:38:45,340 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:45,340 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:45,356 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:38:45,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 08:38:45,547 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:38:45,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:45,547 INFO L85 PathProgramCache]: Analyzing trace with hash -267278290, now seen corresponding path program 1 times [2022-12-13 08:38:45,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:45,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952883660] [2022-12-13 08:38:45,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:45,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:45,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:45,692 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:38:45,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:45,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952883660] [2022-12-13 08:38:45,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952883660] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:38:45,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547346811] [2022-12-13 08:38:45,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:45,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:38:45,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:38:45,695 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:38:45,708 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:38:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:45,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 08:38:45,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:38:45,900 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:38:45,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:38:46,178 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:38:46,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547346811] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:38:46,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:38:46,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-12-13 08:38:46,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133857257] [2022-12-13 08:38:46,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:38:46,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:38:46,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:46,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:38:46,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-12-13 08:38:46,181 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 08:38:46,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 123 transitions, 4236 flow. Second operand has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:38:46,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:46,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 08:38:46,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:46,507 INFO L130 PetriNetUnfolder]: 113/211 cut-off events. [2022-12-13 08:38:46,508 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-13 08:38:46,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3841 conditions, 211 events. 113/211 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 662 event pairs, 0 based on Foata normal form. 1/176 useless extension candidates. Maximal degree in co-relation 3394. Up to 172 conditions per place. [2022-12-13 08:38:46,510 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 67 selfloop transitions, 22 changer transitions 37/126 dead transitions. [2022-12-13 08:38:46,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 126 transitions, 4590 flow [2022-12-13 08:38:46,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 08:38:46,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 08:38:46,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 59 transitions. [2022-12-13 08:38:46,511 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3575757575757576 [2022-12-13 08:38:46,511 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 86 predicate places. [2022-12-13 08:38:46,511 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 126 transitions, 4590 flow [2022-12-13 08:38:46,514 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 89 transitions, 3231 flow [2022-12-13 08:38:46,517 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:46,517 INFO L89 Accepts]: Start accepts. Operand has 96 places, 89 transitions, 3231 flow [2022-12-13 08:38:46,519 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:46,519 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:46,519 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 89 transitions, 3231 flow [2022-12-13 08:38:46,521 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 89 transitions, 3231 flow [2022-12-13 08:38:46,521 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:46,521 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:46,522 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 08:38:46,522 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 89 transitions, 3231 flow [2022-12-13 08:38:46,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:38:46,522 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:46,523 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:46,533 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:38:46,728 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,SelfDestructingSolverStorable16 [2022-12-13 08:38:46,729 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:38:46,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:46,729 INFO L85 PathProgramCache]: Analyzing trace with hash 123174466, now seen corresponding path program 2 times [2022-12-13 08:38:46,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:46,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057589407] [2022-12-13 08:38:46,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:46,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:46,837 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:38:46,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:46,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057589407] [2022-12-13 08:38:46,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057589407] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:38:46,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404010468] [2022-12-13 08:38:46,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:38:46,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:38:46,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:38:46,839 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:38:46,866 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:38:46,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:38:46,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:38:46,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 08:38:46,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:38:47,005 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:38:47,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:38:47,197 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:38:47,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404010468] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:38:47,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:38:47,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-12-13 08:38:47,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255469243] [2022-12-13 08:38:47,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:38:47,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:38:47,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:47,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:38:47,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-12-13 08:38:47,199 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 08:38:47,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 89 transitions, 3231 flow. Second operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:38:47,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:47,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 08:38:47,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:47,472 INFO L130 PetriNetUnfolder]: 87/170 cut-off events. [2022-12-13 08:38:47,472 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-13 08:38:47,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3268 conditions, 170 events. 87/170 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 491 event pairs, 0 based on Foata normal form. 2/148 useless extension candidates. Maximal degree in co-relation 2856. Up to 144 conditions per place. [2022-12-13 08:38:47,474 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 67 selfloop transitions, 26 changer transitions 15/108 dead transitions. [2022-12-13 08:38:47,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 108 transitions, 4143 flow [2022-12-13 08:38:47,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 08:38:47,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 08:38:47,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 53 transitions. [2022-12-13 08:38:47,475 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3212121212121212 [2022-12-13 08:38:47,476 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 86 predicate places. [2022-12-13 08:38:47,476 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 108 transitions, 4143 flow [2022-12-13 08:38:47,480 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 93 transitions, 3561 flow [2022-12-13 08:38:47,482 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:47,482 INFO L89 Accepts]: Start accepts. Operand has 104 places, 93 transitions, 3561 flow [2022-12-13 08:38:47,483 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:47,484 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:47,484 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 93 transitions, 3561 flow [2022-12-13 08:38:47,486 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 93 transitions, 3561 flow [2022-12-13 08:38:47,486 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:47,486 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:47,489 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 08:38:47,489 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 93 transitions, 3561 flow [2022-12-13 08:38:47,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:38:47,489 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:47,489 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:47,495 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:38:47,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 08:38:47,695 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:38:47,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:47,695 INFO L85 PathProgramCache]: Analyzing trace with hash 91057846, now seen corresponding path program 3 times [2022-12-13 08:38:47,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:47,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065006330] [2022-12-13 08:38:47,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:47,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:47,832 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:38:47,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:47,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065006330] [2022-12-13 08:38:47,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065006330] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:38:47,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771074429] [2022-12-13 08:38:47,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 08:38:47,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:38:47,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:38:47,834 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:38:47,855 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:38:47,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 08:38:47,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:38:47,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 08:38:47,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:38:47,979 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:38:47,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:38:48,164 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:38:48,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771074429] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:38:48,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:38:48,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-12-13 08:38:48,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036925251] [2022-12-13 08:38:48,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:38:48,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:38:48,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:48,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:38:48,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-12-13 08:38:48,166 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 08:38:48,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 93 transitions, 3561 flow. Second operand has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:38:48,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:48,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 08:38:48,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:48,417 INFO L130 PetriNetUnfolder]: 82/166 cut-off events. [2022-12-13 08:38:48,417 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-13 08:38:48,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3360 conditions, 166 events. 82/166 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 493 event pairs, 0 based on Foata normal form. 1/149 useless extension candidates. Maximal degree in co-relation 2906. Up to 140 conditions per place. [2022-12-13 08:38:48,419 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 57 selfloop transitions, 16 changer transitions 33/106 dead transitions. [2022-12-13 08:38:48,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 106 transitions, 4282 flow [2022-12-13 08:38:48,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 08:38:48,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 08:38:48,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-12-13 08:38:48,420 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36 [2022-12-13 08:38:48,420 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 93 predicate places. [2022-12-13 08:38:48,420 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 106 transitions, 4282 flow [2022-12-13 08:38:48,422 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 73 transitions, 2950 flow [2022-12-13 08:38:48,425 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:48,425 INFO L89 Accepts]: Start accepts. Operand has 104 places, 73 transitions, 2950 flow [2022-12-13 08:38:48,426 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:48,426 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:48,427 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 73 transitions, 2950 flow [2022-12-13 08:38:48,428 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 73 transitions, 2950 flow [2022-12-13 08:38:48,428 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:48,429 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:48,429 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 08:38:48,429 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 73 transitions, 2950 flow [2022-12-13 08:38:48,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:38:48,430 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:48,430 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:48,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 08:38:48,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:38:48,635 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:38:48,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:48,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1271909994, now seen corresponding path program 4 times [2022-12-13 08:38:48,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:48,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117169393] [2022-12-13 08:38:48,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:48,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:48,762 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:38:48,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:48,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117169393] [2022-12-13 08:38:48,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117169393] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:38:48,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237676522] [2022-12-13 08:38:48,763 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 08:38:48,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:38:48,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:38:48,765 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:38:48,788 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:38:48,832 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 08:38:48,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:38:48,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 08:38:48,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:38:48,888 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:38:48,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:38:49,117 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:38:49,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237676522] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:38:49,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:38:49,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-13 08:38:49,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842095728] [2022-12-13 08:38:49,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:38:49,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 08:38:49,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:49,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 08:38:49,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-12-13 08:38:49,119 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 08:38:49,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 73 transitions, 2950 flow. Second operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have 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:38:49,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:49,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 08:38:49,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:49,549 INFO L130 PetriNetUnfolder]: 67/145 cut-off events. [2022-12-13 08:38:49,549 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-13 08:38:49,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3083 conditions, 145 events. 67/145 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 440 event pairs, 0 based on Foata normal form. 1/122 useless extension candidates. Maximal degree in co-relation 2735. Up to 137 conditions per place. [2022-12-13 08:38:49,551 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 55 selfloop transitions, 29 changer transitions 12/96 dead transitions. [2022-12-13 08:38:49,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 96 transitions, 4068 flow [2022-12-13 08:38:49,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 08:38:49,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 08:38:49,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 63 transitions. [2022-12-13 08:38:49,552 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28 [2022-12-13 08:38:49,552 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 98 predicate places. [2022-12-13 08:38:49,552 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 96 transitions, 4068 flow [2022-12-13 08:38:49,555 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 84 transitions, 3558 flow [2022-12-13 08:38:49,557 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:49,557 INFO L89 Accepts]: Start accepts. Operand has 115 places, 84 transitions, 3558 flow [2022-12-13 08:38:49,558 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:49,558 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:49,559 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 84 transitions, 3558 flow [2022-12-13 08:38:49,560 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 84 transitions, 3558 flow [2022-12-13 08:38:49,560 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:49,561 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:49,561 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 08:38:49,561 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 84 transitions, 3558 flow [2022-12-13 08:38:49,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have 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:38:49,561 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:49,562 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:49,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 08:38:49,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:38:49,768 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:38:49,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:49,768 INFO L85 PathProgramCache]: Analyzing trace with hash -411251526, now seen corresponding path program 5 times [2022-12-13 08:38:49,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:49,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228962043] [2022-12-13 08:38:49,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:49,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:49,894 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:38:49,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:49,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228962043] [2022-12-13 08:38:49,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228962043] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:38:49,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606322856] [2022-12-13 08:38:49,894 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 08:38:49,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:38:49,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:38:49,896 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:38:49,898 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:38:49,952 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:38:49,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:38:49,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 08:38:49,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:38:50,026 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:38:50,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:38:50,130 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:38:50,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606322856] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:38:50,130 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:38:50,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2022-12-13 08:38:50,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802404652] [2022-12-13 08:38:50,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:38:50,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 08:38:50,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:50,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 08:38:50,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-12-13 08:38:50,132 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 08:38:50,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 84 transitions, 3558 flow. Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:38:50,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:50,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 08:38:50,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:50,355 INFO L130 PetriNetUnfolder]: 60/135 cut-off events. [2022-12-13 08:38:50,355 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-13 08:38:50,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3009 conditions, 135 events. 60/135 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 394 event pairs, 0 based on Foata normal form. 2/119 useless extension candidates. Maximal degree in co-relation 2667. Up to 127 conditions per place. [2022-12-13 08:38:50,357 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 52 selfloop transitions, 20 changer transitions 18/90 dead transitions. [2022-12-13 08:38:50,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 90 transitions, 3996 flow [2022-12-13 08:38:50,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 08:38:50,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 08:38:50,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2022-12-13 08:38:50,358 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29444444444444445 [2022-12-13 08:38:50,358 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 106 predicate places. [2022-12-13 08:38:50,358 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 90 transitions, 3996 flow [2022-12-13 08:38:50,360 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 72 transitions, 3192 flow [2022-12-13 08:38:50,362 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:50,363 INFO L89 Accepts]: Start accepts. Operand has 125 places, 72 transitions, 3192 flow [2022-12-13 08:38:50,364 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:50,364 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:50,364 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 72 transitions, 3192 flow [2022-12-13 08:38:50,366 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 72 transitions, 3192 flow [2022-12-13 08:38:50,366 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:50,366 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:50,368 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 08:38:50,368 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 72 transitions, 3192 flow [2022-12-13 08:38:50,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:38:50,369 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:50,369 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:50,378 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:38:50,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:38:50,576 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:38:50,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:50,576 INFO L85 PathProgramCache]: Analyzing trace with hash -443368146, now seen corresponding path program 6 times [2022-12-13 08:38:50,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:50,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327619101] [2022-12-13 08:38:50,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:50,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:50,689 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:38:50,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:50,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327619101] [2022-12-13 08:38:50,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327619101] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:38:50,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258908109] [2022-12-13 08:38:50,690 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 08:38:50,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:38:50,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:38:50,691 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:38:50,694 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:38:50,751 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-13 08:38:50,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:38:50,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 08:38:50,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:38:50,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:38:50,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:38:51,013 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:38:51,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258908109] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:38:51,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:38:51,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-12-13 08:38:51,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227194855] [2022-12-13 08:38:51,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:38:51,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 08:38:51,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:51,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 08:38:51,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-12-13 08:38:51,015 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 08:38:51,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 72 transitions, 3192 flow. Second operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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:38:51,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:51,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 08:38:51,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:51,583 INFO L130 PetriNetUnfolder]: 64/149 cut-off events. [2022-12-13 08:38:51,584 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-13 08:38:51,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3470 conditions, 149 events. 64/149 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 483 event pairs, 0 based on Foata normal form. 2/133 useless extension candidates. Maximal degree in co-relation 3113. Up to 141 conditions per place. [2022-12-13 08:38:51,585 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 51 selfloop transitions, 19 changer transitions 28/98 dead transitions. [2022-12-13 08:38:51,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 98 transitions, 4553 flow [2022-12-13 08:38:51,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 08:38:51,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 08:38:51,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2022-12-13 08:38:51,587 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27450980392156865 [2022-12-13 08:38:51,587 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 121 predicate places. [2022-12-13 08:38:51,587 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 98 transitions, 4553 flow [2022-12-13 08:38:51,589 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 70 transitions, 3244 flow [2022-12-13 08:38:51,592 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:51,592 INFO L89 Accepts]: Start accepts. Operand has 133 places, 70 transitions, 3244 flow [2022-12-13 08:38:51,593 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:51,593 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:51,594 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 70 transitions, 3244 flow [2022-12-13 08:38:51,595 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 70 transitions, 3244 flow [2022-12-13 08:38:51,595 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:51,596 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:51,596 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 08:38:51,596 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 70 transitions, 3244 flow [2022-12-13 08:38:51,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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:38:51,597 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:51,597 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:51,603 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:38:51,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:38:51,803 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:38:51,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:51,803 INFO L85 PathProgramCache]: Analyzing trace with hash 585614902, now seen corresponding path program 7 times [2022-12-13 08:38:51,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:51,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150471140] [2022-12-13 08:38:51,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:51,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:51,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:38:51,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:51,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150471140] [2022-12-13 08:38:51,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150471140] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:38:51,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3230991] [2022-12-13 08:38:51,913 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 08:38:51,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:38:51,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:38:51,915 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:38:51,917 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:38:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:51,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 08:38:51,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:38:52,061 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:38:52,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:38:52,252 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:38:52,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3230991] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:38:52,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:38:52,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-12-13 08:38:52,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685692061] [2022-12-13 08:38:52,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:38:52,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:38:52,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:52,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:38:52,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-12-13 08:38:52,254 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 08:38:52,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 70 transitions, 3244 flow. Second operand has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:38:52,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:52,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 08:38:52,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:52,503 INFO L130 PetriNetUnfolder]: 53/115 cut-off events. [2022-12-13 08:38:52,503 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-13 08:38:52,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2797 conditions, 115 events. 53/115 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 309 event pairs, 0 based on Foata normal form. 1/102 useless extension candidates. Maximal degree in co-relation 2499. Up to 107 conditions per place. [2022-12-13 08:38:52,505 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 43 selfloop transitions, 15 changer transitions 17/75 dead transitions. [2022-12-13 08:38:52,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 75 transitions, 3624 flow [2022-12-13 08:38:52,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 08:38:52,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 08:38:52,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 42 transitions. [2022-12-13 08:38:52,506 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23333333333333334 [2022-12-13 08:38:52,506 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 124 predicate places. [2022-12-13 08:38:52,506 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 75 transitions, 3624 flow [2022-12-13 08:38:52,508 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 58 transitions, 2799 flow [2022-12-13 08:38:52,509 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:52,509 INFO L89 Accepts]: Start accepts. Operand has 131 places, 58 transitions, 2799 flow [2022-12-13 08:38:52,511 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:52,511 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:52,511 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 58 transitions, 2799 flow [2022-12-13 08:38:52,513 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 58 transitions, 2799 flow [2022-12-13 08:38:52,513 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:52,513 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:52,514 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 08:38:52,514 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 58 transitions, 2799 flow [2022-12-13 08:38:52,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:38:52,514 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:52,514 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:52,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 08:38:52,720 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,SelfDestructingSolverStorable22 [2022-12-13 08:38:52,720 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:38:52,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:52,721 INFO L85 PathProgramCache]: Analyzing trace with hash -242926946, now seen corresponding path program 8 times [2022-12-13 08:38:52,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:52,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306291969] [2022-12-13 08:38:52,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:52,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:52,872 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:38:52,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:52,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306291969] [2022-12-13 08:38:52,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306291969] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:38:52,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280287334] [2022-12-13 08:38:52,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:38:52,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:38:52,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:38:52,874 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:38:52,899 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:38:52,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:38:52,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:38:52,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 08:38:52,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:38:53,033 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:38:53,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:38:53,213 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:38:53,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280287334] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:38:53,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:38:53,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-12-13 08:38:53,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050672096] [2022-12-13 08:38:53,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:38:53,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:38:53,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:53,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:38:53,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-12-13 08:38:53,215 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 08:38:53,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 58 transitions, 2799 flow. Second operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:38:53,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:53,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 08:38:53,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:53,434 INFO L130 PetriNetUnfolder]: 42/100 cut-off events. [2022-12-13 08:38:53,434 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 08:38:53,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2537 conditions, 100 events. 42/100 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 260 event pairs, 0 based on Foata normal form. 1/87 useless extension candidates. Maximal degree in co-relation 2279. Up to 92 conditions per place. [2022-12-13 08:38:53,435 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 37 selfloop transitions, 10 changer transitions 20/67 dead transitions. [2022-12-13 08:38:53,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 67 transitions, 3371 flow [2022-12-13 08:38:53,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 08:38:53,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 08:38:53,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 36 transitions. [2022-12-13 08:38:53,436 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24 [2022-12-13 08:38:53,437 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 120 predicate places. [2022-12-13 08:38:53,437 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 67 transitions, 3371 flow [2022-12-13 08:38:53,438 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 47 transitions, 2365 flow [2022-12-13 08:38:53,440 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:38:53,440 INFO L89 Accepts]: Start accepts. Operand has 133 places, 47 transitions, 2365 flow [2022-12-13 08:38:53,441 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:38:53,442 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:53,442 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 47 transitions, 2365 flow [2022-12-13 08:38:53,443 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 47 transitions, 2365 flow [2022-12-13 08:38:53,443 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:53,444 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:53,445 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 08:38:53,445 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 47 transitions, 2365 flow [2022-12-13 08:38:53,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:38:53,445 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:38:53,445 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:38:53,451 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:38:53,650 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,SelfDestructingSolverStorable23 [2022-12-13 08:38:53,651 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:38:53,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:38:53,651 INFO L85 PathProgramCache]: Analyzing trace with hash 557077630, now seen corresponding path program 9 times [2022-12-13 08:38:53,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:38:53,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491258944] [2022-12-13 08:38:53,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:38:53,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:38:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:38:53,749 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:38:53,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:38:53,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491258944] [2022-12-13 08:38:53,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491258944] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:38:53,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277290324] [2022-12-13 08:38:53,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 08:38:53,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:38:53,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:38:53,752 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:38:53,763 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:38:53,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 08:38:53,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:38:53,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 08:38:53,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:38:53,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:38:53,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:38:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:38:54,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277290324] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:38:54,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:38:54,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-12-13 08:38:54,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93809961] [2022-12-13 08:38:54,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:38:54,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 08:38:54,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:38:54,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 08:38:54,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-12-13 08:38:54,085 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 08:38:54,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 47 transitions, 2365 flow. Second operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:38:54,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:38:54,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 08:38:54,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:38:54,328 INFO L130 PetriNetUnfolder]: 29/69 cut-off events. [2022-12-13 08:38:54,329 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 08:38:54,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1830 conditions, 69 events. 29/69 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 148 event pairs, 0 based on Foata normal form. 1/62 useless extension candidates. Maximal degree in co-relation 1668. Up to 61 conditions per place. [2022-12-13 08:38:54,330 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 0 selfloop transitions, 0 changer transitions 46/46 dead transitions. [2022-12-13 08:38:54,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 46 transitions, 2407 flow [2022-12-13 08:38:54,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 08:38:54,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 08:38:54,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2022-12-13 08:38:54,330 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1925925925925926 [2022-12-13 08:38:54,331 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 120 predicate places. [2022-12-13 08:38:54,331 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 46 transitions, 2407 flow [2022-12-13 08:38:54,331 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 0 places, 0 transitions, 0 flow [2022-12-13 08:38:54,332 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:38:54,332 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 08:38:54,332 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 08:38:54,332 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:38:54,333 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:38:54,333 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-13 08:38:54,333 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 08:38:54,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:38:54,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 08:38:54,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 08:38:54,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 08:38:54,344 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:38:54,541 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,SelfDestructingSolverStorable24 [2022-12-13 08:38:54,542 INFO L445 BasicCegarLoop]: Path program histogram: [9, 6, 5, 5] [2022-12-13 08:38:54,545 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 08:38:54,545 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 08:38:54,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:38:54 BasicIcfg [2022-12-13 08:38:54,547 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 08:38:54,548 INFO L158 Benchmark]: Toolchain (without parser) took 16281.41ms. Allocated memory was 179.3MB in the beginning and 330.3MB in the end (delta: 151.0MB). Free memory was 140.8MB in the beginning and 288.7MB in the end (delta: -147.9MB). Peak memory consumption was 4.7MB. Max. memory is 8.0GB. [2022-12-13 08:38:54,548 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 179.3MB. Free memory is still 155.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 08:38:54,548 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.72ms. Allocated memory is still 179.3MB. Free memory was 140.3MB in the beginning and 129.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-12-13 08:38:54,548 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.07ms. Allocated memory is still 179.3MB. Free memory was 129.3MB in the beginning and 127.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 08:38:54,548 INFO L158 Benchmark]: Boogie Preprocessor took 31.30ms. Allocated memory is still 179.3MB. Free memory was 127.7MB in the beginning and 126.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 08:38:54,548 INFO L158 Benchmark]: RCFGBuilder took 370.93ms. Allocated memory is still 179.3MB. Free memory was 126.7MB in the beginning and 113.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 08:38:54,549 INFO L158 Benchmark]: TraceAbstraction took 15600.19ms. Allocated memory was 179.3MB in the beginning and 330.3MB in the end (delta: 151.0MB). Free memory was 112.5MB in the beginning and 288.7MB in the end (delta: -176.2MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 08:38:54,550 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 179.3MB. Free memory is still 155.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.72ms. Allocated memory is still 179.3MB. Free memory was 140.3MB in the beginning and 129.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.07ms. Allocated memory is still 179.3MB. Free memory was 129.3MB in the beginning and 127.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.30ms. Allocated memory is still 179.3MB. Free memory was 127.7MB in the beginning and 126.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 370.93ms. Allocated memory is still 179.3MB. Free memory was 126.7MB in the beginning and 113.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 15600.19ms. Allocated memory was 179.3MB in the beginning and 330.3MB in the end (delta: 151.0MB). Free memory was 112.5MB in the beginning and 288.7MB in the end (delta: -176.2MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 71 PlacesBefore, 20 PlacesAfterwards, 70 TransitionsBefore, 15 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 30 TrivialYvCompositions, 21 ConcurrentYvCompositions, 4 ChoiceCompositions, 55 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 312, independent: 312, independent conditional: 312, 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: 312, independent: 312, independent conditional: 0, independent unconditional: 312, 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: 312, independent: 312, independent conditional: 0, independent unconditional: 312, 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: 312, independent: 312, independent conditional: 0, independent unconditional: 312, 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: 312, independent: 312, independent conditional: 0, independent unconditional: 312, 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: 312, independent: 303, independent conditional: 0, independent unconditional: 303, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 312, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 312, unknown conditional: 0, unknown unconditional: 312] , Statistics on independence cache: Total cache size (in pairs): 517, Positive cache size: 517, Positive conditional cache size: 0, Positive unconditional cache size: 517, 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, 25 PlacesBefore, 25 PlacesAfterwards, 31 TransitionsBefore, 31 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, 45 TransitionsBefore, 45 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, 35 PlacesBefore, 35 PlacesAfterwards, 52 TransitionsBefore, 52 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, 40 PlacesBefore, 40 PlacesAfterwards, 56 TransitionsBefore, 56 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, 65 TransitionsBefore, 65 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 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, 56 PlacesBefore, 56 PlacesAfterwards, 101 TransitionsBefore, 101 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, 60 PlacesBefore, 60 PlacesAfterwards, 123 TransitionsBefore, 123 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, 64 PlacesBefore, 64 PlacesAfterwards, 124 TransitionsBefore, 124 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, 71 PlacesBefore, 71 PlacesAfterwards, 144 TransitionsBefore, 144 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, 75 PlacesBefore, 75 PlacesAfterwards, 133 TransitionsBefore, 133 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, 82 PlacesBefore, 82 PlacesAfterwards, 174 TransitionsBefore, 174 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, 88 PlacesBefore, 88 PlacesAfterwards, 161 TransitionsBefore, 161 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, 92 PlacesBefore, 92 PlacesAfterwards, 143 TransitionsBefore, 143 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, 94 PlacesBefore, 94 PlacesAfterwards, 134 TransitionsBefore, 134 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, 96 PlacesBefore, 96 PlacesAfterwards, 123 TransitionsBefore, 123 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, 96 PlacesBefore, 96 PlacesAfterwards, 89 TransitionsBefore, 89 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, 104 PlacesBefore, 104 PlacesAfterwards, 93 TransitionsBefore, 93 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, 104 PlacesBefore, 104 PlacesAfterwards, 73 TransitionsBefore, 73 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, 115 PlacesBefore, 115 PlacesAfterwards, 84 TransitionsBefore, 84 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, 125 PlacesBefore, 125 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: 0.0s, 133 PlacesBefore, 133 PlacesAfterwards, 70 TransitionsBefore, 70 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, 131 PlacesBefore, 131 PlacesAfterwards, 58 TransitionsBefore, 58 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, 133 PlacesBefore, 133 PlacesAfterwards, 47 TransitionsBefore, 47 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, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 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 - PositiveResult [Line: 79]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 97 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: 15.5s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 737 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 737 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 188 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4590 IncrementalHoareTripleChecker+Invalid, 4778 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 188 mSolverCounterUnsat, 0 mSDtfsCounter, 4590 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 547 GetRequests, 222 SyntacticMatches, 29 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4611occurred in iteration=12, InterpolantAutomatonStates: 211, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 502 NumberOfCodeBlocks, 502 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 606 ConstructedInterpolants, 0 QuantifiedInterpolants, 3846 SizeOfPredicates, 37 NumberOfNonLiveVariables, 1197 ConjunctsInSsa, 165 ConjunctsInUnsatCore, 45 InterpolantComputations, 16 PerfectInterpolantSequences, 11/66 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 08:38:54,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...