/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 01:14:22,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 01:14:22,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 01:14:22,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 01:14:22,932 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 01:14:22,934 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 01:14:22,937 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 01:14:22,940 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 01:14:22,943 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 01:14:22,947 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 01:14:22,948 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 01:14:22,949 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 01:14:22,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 01:14:22,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 01:14:22,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 01:14:22,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 01:14:22,955 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 01:14:22,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 01:14:22,958 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 01:14:22,961 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 01:14:22,962 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 01:14:22,963 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 01:14:22,964 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 01:14:22,964 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 01:14:22,970 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 01:14:22,970 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 01:14:22,970 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 01:14:22,971 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 01:14:22,971 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 01:14:22,972 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 01:14:22,972 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 01:14:22,973 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 01:14:22,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 01:14:22,974 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 01:14:22,975 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 01:14:22,975 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 01:14:22,975 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 01:14:22,975 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 01:14:22,976 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 01:14:22,976 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 01:14:22,977 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 01:14:22,977 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 01:14:23,002 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 01:14:23,002 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 01:14:23,003 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 01:14:23,004 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 01:14:23,004 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 01:14:23,004 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 01:14:23,004 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 01:14:23,005 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 01:14:23,005 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 01:14:23,005 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 01:14:23,005 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 01:14:23,006 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 01:14:23,006 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 01:14:23,006 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 01:14:23,006 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 01:14:23,006 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 01:14:23,006 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 01:14:23,006 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 01:14:23,006 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 01:14:23,006 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 01:14:23,006 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 01:14:23,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:14:23,007 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 01:14:23,007 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 01:14:23,007 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 01:14:23,007 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 01:14:23,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 01:14:23,007 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 01:14:23,007 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 01:14:23,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 01:14:23,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 01:14:23,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 01:14:23,278 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 01:14:23,278 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 01:14:23,279 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 01:14:24,214 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 01:14:24,440 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 01:14:24,440 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 01:14:24,451 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d54a2f6df/15971dc37c104a1eb92530f7e531ded4/FLAG0432b1eb7 [2022-12-06 01:14:24,464 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d54a2f6df/15971dc37c104a1eb92530f7e531ded4 [2022-12-06 01:14:24,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 01:14:24,467 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 01:14:24,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 01:14:24,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 01:14:24,469 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 01:14:24,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:14:24" (1/1) ... [2022-12-06 01:14:24,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7987fed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:14:24, skipping insertion in model container [2022-12-06 01:14:24,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:14:24" (1/1) ... [2022-12-06 01:14:24,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 01:14:24,520 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 01:14:24,610 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-06 01:14:24,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:24,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:24,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:24,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:24,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:24,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:24,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:24,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:24,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:24,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:24,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:24,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:24,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:24,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:24,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:24,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:24,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:24,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:24,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:24,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:24,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:24,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:24,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:24,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:24,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:24,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:24,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:24,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:24,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:14:24,794 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 01:14:24,808 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-06 01:14:24,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:24,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:24,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:24,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:24,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:24,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:24,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:24,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:24,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:24,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:24,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:24,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:24,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:24,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:24,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:24,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:24,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:24,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:24,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:24,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:24,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:24,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:24,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:24,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:24,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:24,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:24,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:14:24,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:14:24,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:14:24,892 INFO L208 MainTranslator]: Completed translation [2022-12-06 01:14:24,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:14:24 WrapperNode [2022-12-06 01:14:24,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 01:14:24,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 01:14:24,893 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 01:14:24,894 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 01:14:24,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:14:24" (1/1) ... [2022-12-06 01:14:24,922 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:14:24" (1/1) ... [2022-12-06 01:14:24,946 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2022-12-06 01:14:24,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 01:14:24,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 01:14:24,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 01:14:24,947 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 01:14:24,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:14:24" (1/1) ... [2022-12-06 01:14:24,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:14:24" (1/1) ... [2022-12-06 01:14:24,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:14:24" (1/1) ... [2022-12-06 01:14:24,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:14:24" (1/1) ... [2022-12-06 01:14:24,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:14:24" (1/1) ... [2022-12-06 01:14:24,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:14:24" (1/1) ... [2022-12-06 01:14:24,972 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:14:24" (1/1) ... [2022-12-06 01:14:24,973 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:14:24" (1/1) ... [2022-12-06 01:14:24,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 01:14:24,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 01:14:24,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 01:14:24,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 01:14:24,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:14:24" (1/1) ... [2022-12-06 01:14:24,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:14:24,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:14:25,033 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 01:14:25,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 01:14:25,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 01:14:25,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 01:14:25,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 01:14:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 01:14:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 01:14:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 01:14:25,087 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 01:14:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 01:14:25,087 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 01:14:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 01:14:25,088 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 01:14:25,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 01:14:25,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 01:14:25,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 01:14:25,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 01:14:25,090 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 01:14:25,249 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 01:14:25,251 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 01:14:25,532 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 01:14:25,635 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 01:14:25,635 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 01:14:25,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:14:25 BoogieIcfgContainer [2022-12-06 01:14:25,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 01:14:25,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 01:14:25,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 01:14:25,640 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 01:14:25,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 01:14:24" (1/3) ... [2022-12-06 01:14:25,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118bdfeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:14:25, skipping insertion in model container [2022-12-06 01:14:25,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:14:24" (2/3) ... [2022-12-06 01:14:25,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118bdfeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:14:25, skipping insertion in model container [2022-12-06 01:14:25,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:14:25" (3/3) ... [2022-12-06 01:14:25,642 INFO L112 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 01:14:25,654 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 01:14:25,654 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 01:14:25,654 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 01:14:25,695 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 01:14:25,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow [2022-12-06 01:14:25,766 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2022-12-06 01:14:25,766 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:14:25,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 01:14:25,772 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 105 transitions, 225 flow [2022-12-06 01:14:25,775 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 102 transitions, 213 flow [2022-12-06 01:14:25,777 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:25,800 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 102 transitions, 213 flow [2022-12-06 01:14:25,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 102 transitions, 213 flow [2022-12-06 01:14:25,839 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2022-12-06 01:14:25,839 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:14:25,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 01:14:25,842 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 102 transitions, 213 flow [2022-12-06 01:14:25,842 INFO L188 LiptonReduction]: Number of co-enabled transitions 1818 [2022-12-06 01:14:30,099 INFO L203 LiptonReduction]: Total number of compositions: 80 [2022-12-06 01:14:30,109 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 01:14:30,113 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;@37bfce9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 01:14:30,113 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 01:14:30,115 INFO L130 PetriNetUnfolder]: 0/4 cut-off events. [2022-12-06 01:14:30,115 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:14:30,115 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:30,115 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 01:14:30,116 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:14:30,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:30,119 INFO L85 PathProgramCache]: Analyzing trace with hash 464649, now seen corresponding path program 1 times [2022-12-06 01:14:30,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:30,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060088306] [2022-12-06 01:14:30,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:30,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:30,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:30,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:30,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060088306] [2022-12-06 01:14:30,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060088306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:30,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:30,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:14:30,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226389566] [2022-12-06 01:14:30,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:30,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:14:30,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:30,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:14:30,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:14:30,468 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-06 01:14:30,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:30,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:30,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-06 01:14:30,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:30,722 INFO L130 PetriNetUnfolder]: 882/1394 cut-off events. [2022-12-06 01:14:30,722 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-06 01:14:30,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2768 conditions, 1394 events. 882/1394 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6629 event pairs, 234 based on Foata normal form. 0/1238 useless extension candidates. Maximal degree in co-relation 2757. Up to 1078 conditions per place. [2022-12-06 01:14:30,733 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 29 selfloop transitions, 2 changer transitions 8/41 dead transitions. [2022-12-06 01:14:30,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 175 flow [2022-12-06 01:14:30,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:14:30,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:14:30,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-06 01:14:30,742 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6172839506172839 [2022-12-06 01:14:30,745 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2022-12-06 01:14:30,746 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:30,746 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 41 transitions, 175 flow [2022-12-06 01:14:30,759 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 41 transitions, 175 flow [2022-12-06 01:14:30,759 INFO L188 LiptonReduction]: Number of co-enabled transitions 74 [2022-12-06 01:14:30,872 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 01:14:30,873 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-06 01:14:30,873 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 40 transitions, 173 flow [2022-12-06 01:14:30,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:30,873 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:30,873 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:30,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 01:14:30,874 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:14:30,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:30,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1017722405, now seen corresponding path program 1 times [2022-12-06 01:14:30,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:30,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905026162] [2022-12-06 01:14:30,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:30,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:31,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:31,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:31,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905026162] [2022-12-06 01:14:31,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905026162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:31,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:31,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:14:31,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374419525] [2022-12-06 01:14:31,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:31,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:14:31,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:31,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:14:31,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:14:31,659 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 01:14:31,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 40 transitions, 173 flow. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:31,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:31,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 01:14:31,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:31,938 INFO L130 PetriNetUnfolder]: 1506/2299 cut-off events. [2022-12-06 01:14:31,938 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-12-06 01:14:31,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6819 conditions, 2299 events. 1506/2299 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 11573 event pairs, 73 based on Foata normal form. 0/2087 useless extension candidates. Maximal degree in co-relation 6805. Up to 1868 conditions per place. [2022-12-06 01:14:31,946 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 54 selfloop transitions, 10 changer transitions 25/89 dead transitions. [2022-12-06 01:14:31,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 89 transitions, 555 flow [2022-12-06 01:14:31,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:14:31,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:14:31,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-06 01:14:31,947 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2022-12-06 01:14:31,947 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-12-06 01:14:31,948 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:31,948 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 89 transitions, 555 flow [2022-12-06 01:14:31,954 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 89 transitions, 555 flow [2022-12-06 01:14:31,954 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:31,955 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:14:31,956 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 01:14:31,956 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 89 transitions, 555 flow [2022-12-06 01:14:31,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:31,956 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:31,956 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:31,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 01:14:31,957 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:14:31,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:31,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1484622426, now seen corresponding path program 1 times [2022-12-06 01:14:31,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:31,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746750291] [2022-12-06 01:14:31,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:31,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:32,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:32,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746750291] [2022-12-06 01:14:32,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746750291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:32,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:32,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:14:32,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415534697] [2022-12-06 01:14:32,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:32,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:14:32,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:32,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:14:32,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:14:32,065 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 01:14:32,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 89 transitions, 555 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-06 01:14:32,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:32,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 01:14:32,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:32,313 INFO L130 PetriNetUnfolder]: 1465/2238 cut-off events. [2022-12-06 01:14:32,314 INFO L131 PetriNetUnfolder]: For 185/185 co-relation queries the response was YES. [2022-12-06 01:14:32,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8737 conditions, 2238 events. 1465/2238 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 10639 event pairs, 42 based on Foata normal form. 0/2040 useless extension candidates. Maximal degree in co-relation 8720. Up to 1815 conditions per place. [2022-12-06 01:14:32,323 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 81 selfloop transitions, 6 changer transitions 39/129 dead transitions. [2022-12-06 01:14:32,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 129 transitions, 1047 flow [2022-12-06 01:14:32,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:14:32,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:14:32,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 01:14:32,325 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2022-12-06 01:14:32,325 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2022-12-06 01:14:32,326 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:32,326 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 129 transitions, 1047 flow [2022-12-06 01:14:32,335 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 129 transitions, 1047 flow [2022-12-06 01:14:32,336 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:32,336 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:14:32,337 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 01:14:32,337 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 129 transitions, 1047 flow [2022-12-06 01:14:32,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-06 01:14:32,338 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:32,338 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:32,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 01:14:32,338 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:14:32,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:32,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1221346851, now seen corresponding path program 1 times [2022-12-06 01:14:32,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:32,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878574629] [2022-12-06 01:14:32,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:32,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:33,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:33,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878574629] [2022-12-06 01:14:33,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878574629] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:33,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:33,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:14:33,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68418650] [2022-12-06 01:14:33,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:33,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:14:33,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:33,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:14:33,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:14:33,134 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 01:14:33,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 129 transitions, 1047 flow. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:33,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:33,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 01:14:33,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:33,479 INFO L130 PetriNetUnfolder]: 1445/2211 cut-off events. [2022-12-06 01:14:33,480 INFO L131 PetriNetUnfolder]: For 185/185 co-relation queries the response was YES. [2022-12-06 01:14:33,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10845 conditions, 2211 events. 1445/2211 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 10474 event pairs, 33 based on Foata normal form. 0/2025 useless extension candidates. Maximal degree in co-relation 10825. Up to 1816 conditions per place. [2022-12-06 01:14:33,488 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 74 selfloop transitions, 17 changer transitions 48/139 dead transitions. [2022-12-06 01:14:33,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 139 transitions, 1389 flow [2022-12-06 01:14:33,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:14:33,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:14:33,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-12-06 01:14:33,490 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-06 01:14:33,491 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2022-12-06 01:14:33,491 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:33,491 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 139 transitions, 1389 flow [2022-12-06 01:14:33,500 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 139 transitions, 1389 flow [2022-12-06 01:14:33,500 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:33,502 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:14:33,508 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 01:14:33,508 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 139 transitions, 1389 flow [2022-12-06 01:14:33,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:33,508 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:33,508 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:33,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 01:14:33,509 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:14:33,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:33,509 INFO L85 PathProgramCache]: Analyzing trace with hash 794286993, now seen corresponding path program 1 times [2022-12-06 01:14:33,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:33,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953718076] [2022-12-06 01:14:33,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:33,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:33,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:34,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:34,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:34,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953718076] [2022-12-06 01:14:34,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953718076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:34,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:34,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:14:34,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525226604] [2022-12-06 01:14:34,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:34,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:14:34,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:34,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:14:34,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:14:34,155 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 01:14:34,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 139 transitions, 1389 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:34,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:34,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 01:14:34,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:34,515 INFO L130 PetriNetUnfolder]: 1720/2678 cut-off events. [2022-12-06 01:14:34,515 INFO L131 PetriNetUnfolder]: For 179/179 co-relation queries the response was YES. [2022-12-06 01:14:34,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15805 conditions, 2678 events. 1720/2678 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 13605 event pairs, 36 based on Foata normal form. 0/2470 useless extension candidates. Maximal degree in co-relation 15782. Up to 2246 conditions per place. [2022-12-06 01:14:34,526 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 89 selfloop transitions, 12 changer transitions 77/178 dead transitions. [2022-12-06 01:14:34,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 178 transitions, 2126 flow [2022-12-06 01:14:34,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:14:34,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:14:34,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-06 01:14:34,529 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.65625 [2022-12-06 01:14:34,531 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2022-12-06 01:14:34,532 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:34,532 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 178 transitions, 2126 flow [2022-12-06 01:14:34,544 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 178 transitions, 2126 flow [2022-12-06 01:14:34,544 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:34,545 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:14:34,548 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 01:14:34,548 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 178 transitions, 2126 flow [2022-12-06 01:14:34,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:34,548 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:34,548 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:34,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 01:14:34,548 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:14:34,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:34,549 INFO L85 PathProgramCache]: Analyzing trace with hash 981017942, now seen corresponding path program 1 times [2022-12-06 01:14:34,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:34,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467332110] [2022-12-06 01:14:34,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:34,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:35,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:35,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:35,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467332110] [2022-12-06 01:14:35,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467332110] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:35,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:35,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:14:35,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925182244] [2022-12-06 01:14:35,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:35,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:14:35,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:35,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:14:35,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 01:14:35,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 01:14:35,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 178 transitions, 2126 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:35,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:35,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 01:14:35,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:35,841 INFO L130 PetriNetUnfolder]: 2108/3264 cut-off events. [2022-12-06 01:14:35,842 INFO L131 PetriNetUnfolder]: For 236/236 co-relation queries the response was YES. [2022-12-06 01:14:35,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22566 conditions, 3264 events. 2108/3264 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 17309 event pairs, 19 based on Foata normal form. 0/3026 useless extension candidates. Maximal degree in co-relation 22540. Up to 2722 conditions per place. [2022-12-06 01:14:35,860 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 100 selfloop transitions, 33 changer transitions 102/235 dead transitions. [2022-12-06 01:14:35,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 235 transitions, 3264 flow [2022-12-06 01:14:35,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:14:35,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:14:35,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-12-06 01:14:35,861 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 01:14:35,863 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2022-12-06 01:14:35,863 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:35,864 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 235 transitions, 3264 flow [2022-12-06 01:14:35,883 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 235 transitions, 3264 flow [2022-12-06 01:14:35,883 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:35,886 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:14:35,887 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 01:14:35,888 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 235 transitions, 3264 flow [2022-12-06 01:14:35,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:35,888 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:35,888 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:35,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 01:14:35,889 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:14:35,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:35,889 INFO L85 PathProgramCache]: Analyzing trace with hash 981073742, now seen corresponding path program 2 times [2022-12-06 01:14:35,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:35,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618550735] [2022-12-06 01:14:35,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:35,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:35,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:35,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:35,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618550735] [2022-12-06 01:14:35,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618550735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:35,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:35,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:14:35,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777326327] [2022-12-06 01:14:35,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:35,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:14:35,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:36,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:14:36,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:14:36,000 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 01:14:36,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 235 transitions, 3264 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:36,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:36,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 01:14:36,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:36,588 INFO L130 PetriNetUnfolder]: 3184/4942 cut-off events. [2022-12-06 01:14:36,588 INFO L131 PetriNetUnfolder]: For 1249/1249 co-relation queries the response was YES. [2022-12-06 01:14:36,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38805 conditions, 4942 events. 3184/4942 cut-off events. For 1249/1249 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 28651 event pairs, 68 based on Foata normal form. 0/4603 useless extension candidates. Maximal degree in co-relation 38776. Up to 4176 conditions per place. [2022-12-06 01:14:36,606 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 87 selfloop transitions, 9 changer transitions 212/312 dead transitions. [2022-12-06 01:14:36,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 312 transitions, 4938 flow [2022-12-06 01:14:36,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:14:36,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:14:36,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-06 01:14:36,609 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.59375 [2022-12-06 01:14:36,609 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 18 predicate places. [2022-12-06 01:14:36,610 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:36,610 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 312 transitions, 4938 flow [2022-12-06 01:14:36,635 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 312 transitions, 4938 flow [2022-12-06 01:14:36,635 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:36,637 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:14:36,637 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 01:14:36,637 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 312 transitions, 4938 flow [2022-12-06 01:14:36,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:36,638 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:36,638 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:36,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 01:14:36,638 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:14:36,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:36,638 INFO L85 PathProgramCache]: Analyzing trace with hash 942206438, now seen corresponding path program 1 times [2022-12-06 01:14:36,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:36,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060546102] [2022-12-06 01:14:36,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:36,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:37,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:37,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060546102] [2022-12-06 01:14:37,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060546102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:37,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:37,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:14:37,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560761330] [2022-12-06 01:14:37,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:37,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:14:37,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:37,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:14:37,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:14:37,024 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 01:14:37,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 312 transitions, 4938 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:37,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:37,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 01:14:37,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:37,696 INFO L130 PetriNetUnfolder]: 3395/5251 cut-off events. [2022-12-06 01:14:37,696 INFO L131 PetriNetUnfolder]: For 1485/1485 co-relation queries the response was YES. [2022-12-06 01:14:37,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46482 conditions, 5251 events. 3395/5251 cut-off events. For 1485/1485 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 30627 event pairs, 95 based on Foata normal form. 0/4893 useless extension candidates. Maximal degree in co-relation 46450. Up to 4468 conditions per place. [2022-12-06 01:14:37,715 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 102 selfloop transitions, 11 changer transitions 267/380 dead transitions. [2022-12-06 01:14:37,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 380 transitions, 6777 flow [2022-12-06 01:14:37,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:14:37,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:14:37,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-06 01:14:37,717 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2022-12-06 01:14:37,718 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2022-12-06 01:14:37,718 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:37,719 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 380 transitions, 6777 flow [2022-12-06 01:14:37,744 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 380 transitions, 6777 flow [2022-12-06 01:14:37,744 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:37,748 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:14:37,749 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 01:14:37,749 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 380 transitions, 6777 flow [2022-12-06 01:14:37,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:37,749 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:37,750 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:37,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 01:14:37,750 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:14:37,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:37,750 INFO L85 PathProgramCache]: Analyzing trace with hash 348601324, now seen corresponding path program 1 times [2022-12-06 01:14:37,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:37,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405154925] [2022-12-06 01:14:37,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:37,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:37,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:37,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:37,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405154925] [2022-12-06 01:14:37,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405154925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:37,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:37,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:14:37,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838283248] [2022-12-06 01:14:37,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:37,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:14:37,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:37,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:14:37,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:14:37,876 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 01:14:37,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 380 transitions, 6777 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:37,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:37,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 01:14:37,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:38,783 INFO L130 PetriNetUnfolder]: 3709/5781 cut-off events. [2022-12-06 01:14:38,784 INFO L131 PetriNetUnfolder]: For 2728/2728 co-relation queries the response was YES. [2022-12-06 01:14:38,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56749 conditions, 5781 events. 3709/5781 cut-off events. For 2728/2728 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 34809 event pairs, 87 based on Foata normal form. 0/5389 useless extension candidates. Maximal degree in co-relation 56714. Up to 4998 conditions per place. [2022-12-06 01:14:38,811 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 94 selfloop transitions, 5 changer transitions 313/416 dead transitions. [2022-12-06 01:14:38,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 416 transitions, 8225 flow [2022-12-06 01:14:38,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:14:38,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:14:38,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-12-06 01:14:38,812 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-06 01:14:38,813 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2022-12-06 01:14:38,813 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:38,813 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 416 transitions, 8225 flow [2022-12-06 01:14:38,854 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 416 transitions, 8225 flow [2022-12-06 01:14:38,854 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:38,857 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:14:38,858 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-06 01:14:38,858 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 416 transitions, 8225 flow [2022-12-06 01:14:38,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:38,858 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:38,858 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:38,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 01:14:38,859 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:14:38,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:38,860 INFO L85 PathProgramCache]: Analyzing trace with hash 346782337, now seen corresponding path program 1 times [2022-12-06 01:14:38,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:38,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245085991] [2022-12-06 01:14:38,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:38,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:39,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:39,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:39,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245085991] [2022-12-06 01:14:39,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245085991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:39,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:39,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 01:14:39,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406308578] [2022-12-06 01:14:39,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:39,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 01:14:39,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:39,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 01:14:39,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 01:14:39,514 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 01:14:39,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 416 transitions, 8225 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-06 01:14:39,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:39,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 01:14:39,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:40,447 INFO L130 PetriNetUnfolder]: 4165/6456 cut-off events. [2022-12-06 01:14:40,447 INFO L131 PetriNetUnfolder]: For 4884/4884 co-relation queries the response was YES. [2022-12-06 01:14:40,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69980 conditions, 6456 events. 4165/6456 cut-off events. For 4884/4884 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 39238 event pairs, 34 based on Foata normal form. 0/6030 useless extension candidates. Maximal degree in co-relation 69942. Up to 5679 conditions per place. [2022-12-06 01:14:40,469 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 105 selfloop transitions, 12 changer transitions 462/579 dead transitions. [2022-12-06 01:14:40,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 579 transitions, 12630 flow [2022-12-06 01:14:40,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:14:40,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:14:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-12-06 01:14:40,470 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4652777777777778 [2022-12-06 01:14:40,471 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 30 predicate places. [2022-12-06 01:14:40,471 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:40,471 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 579 transitions, 12630 flow [2022-12-06 01:14:40,583 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 579 transitions, 12630 flow [2022-12-06 01:14:40,583 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:40,586 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:14:40,586 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-06 01:14:40,586 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 579 transitions, 12630 flow [2022-12-06 01:14:40,586 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-06 01:14:40,586 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:40,586 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:40,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 01:14:40,587 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:14:40,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:40,587 INFO L85 PathProgramCache]: Analyzing trace with hash 346782554, now seen corresponding path program 1 times [2022-12-06 01:14:40,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:40,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499405042] [2022-12-06 01:14:40,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:40,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:40,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:40,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:40,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499405042] [2022-12-06 01:14:40,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499405042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:40,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:40,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 01:14:40,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888944840] [2022-12-06 01:14:40,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:40,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 01:14:40,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:40,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 01:14:40,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 01:14:40,905 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 01:14:40,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 579 transitions, 12630 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-06 01:14:40,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:40,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 01:14:40,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:42,274 INFO L130 PetriNetUnfolder]: 5226/8139 cut-off events. [2022-12-06 01:14:42,274 INFO L131 PetriNetUnfolder]: For 5730/5730 co-relation queries the response was YES. [2022-12-06 01:14:42,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96633 conditions, 8139 events. 5226/8139 cut-off events. For 5730/5730 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 51458 event pairs, 4 based on Foata normal form. 0/7625 useless extension candidates. Maximal degree in co-relation 96592. Up to 7290 conditions per place. [2022-12-06 01:14:42,297 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 119 selfloop transitions, 23 changer transitions 657/799 dead transitions. [2022-12-06 01:14:42,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 799 transitions, 19068 flow [2022-12-06 01:14:42,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:14:42,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:14:42,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-12-06 01:14:42,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2022-12-06 01:14:42,299 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 35 predicate places. [2022-12-06 01:14:42,300 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:42,300 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 799 transitions, 19068 flow [2022-12-06 01:14:42,346 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 799 transitions, 19068 flow [2022-12-06 01:14:42,346 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:42,349 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:14:42,350 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 01:14:42,350 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 799 transitions, 19068 flow [2022-12-06 01:14:42,350 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-06 01:14:42,350 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:42,350 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:42,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 01:14:42,350 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:14:42,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:42,350 INFO L85 PathProgramCache]: Analyzing trace with hash 502689614, now seen corresponding path program 2 times [2022-12-06 01:14:42,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:42,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726055324] [2022-12-06 01:14:42,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:42,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:42,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:42,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:42,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726055324] [2022-12-06 01:14:42,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726055324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:42,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:42,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 01:14:42,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141453702] [2022-12-06 01:14:42,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:42,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 01:14:42,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:42,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 01:14:42,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 01:14:42,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 01:14:42,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 799 transitions, 19068 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-06 01:14:42,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:42,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 01:14:42,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:44,878 INFO L130 PetriNetUnfolder]: 5614/8827 cut-off events. [2022-12-06 01:14:44,878 INFO L131 PetriNetUnfolder]: For 5730/5730 co-relation queries the response was YES. [2022-12-06 01:14:44,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113717 conditions, 8827 events. 5614/8827 cut-off events. For 5730/5730 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 57285 event pairs, 14 based on Foata normal form. 0/8303 useless extension candidates. Maximal degree in co-relation 113673. Up to 7978 conditions per place. [2022-12-06 01:14:44,911 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 117 selfloop transitions, 16 changer transitions 794/927 dead transitions. [2022-12-06 01:14:44,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 927 transitions, 23994 flow [2022-12-06 01:14:44,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:14:44,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:14:44,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-12-06 01:14:44,913 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-06 01:14:44,913 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 39 predicate places. [2022-12-06 01:14:44,914 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:44,914 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 927 transitions, 23994 flow [2022-12-06 01:14:44,990 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 927 transitions, 23994 flow [2022-12-06 01:14:44,990 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:44,996 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:14:44,998 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 01:14:44,998 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 927 transitions, 23994 flow [2022-12-06 01:14:44,998 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-06 01:14:44,998 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:44,998 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:44,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 01:14:44,998 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 01:14:44,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:44,999 INFO L85 PathProgramCache]: Analyzing trace with hash -2134645507, now seen corresponding path program 1 times [2022-12-06 01:14:44,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:44,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463613801] [2022-12-06 01:14:44,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:44,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:45,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:45,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:45,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463613801] [2022-12-06 01:14:45,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463613801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:45,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:45,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 01:14:45,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064288109] [2022-12-06 01:14:45,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:45,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 01:14:45,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:45,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 01:14:45,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 01:14:45,679 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 01:14:45,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 927 transitions, 23994 flow. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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-06 01:14:45,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:45,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 01:14:45,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:47,520 INFO L130 PetriNetUnfolder]: 5736/9053 cut-off events. [2022-12-06 01:14:47,520 INFO L131 PetriNetUnfolder]: For 5730/5730 co-relation queries the response was YES. [2022-12-06 01:14:47,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125709 conditions, 9053 events. 5736/9053 cut-off events. For 5730/5730 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 59123 event pairs, 2 based on Foata normal form. 0/8521 useless extension candidates. Maximal degree in co-relation 125662. Up to 8204 conditions per place. [2022-12-06 01:14:47,551 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 0 selfloop transitions, 0 changer transitions 960/960 dead transitions. [2022-12-06 01:14:47,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 960 transitions, 26772 flow [2022-12-06 01:14:47,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:14:47,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:14:47,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-06 01:14:47,552 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2022-12-06 01:14:47,553 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 42 predicate places. [2022-12-06 01:14:47,553 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:47,553 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 960 transitions, 26772 flow [2022-12-06 01:14:47,750 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 960 transitions, 26772 flow [2022-12-06 01:14:47,750 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:47,753 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:14:47,753 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-06 01:14:47,753 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 960 transitions, 26772 flow [2022-12-06 01:14:47,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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-06 01:14:47,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 01:14:47,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 01:14:47,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 01:14:47,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 01:14:47,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 01:14:47,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 01:14:47,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 01:14:47,756 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:47,760 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 01:14:47,760 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 01:14:47,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 01:14:47 BasicIcfg [2022-12-06 01:14:47,763 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 01:14:47,763 INFO L158 Benchmark]: Toolchain (without parser) took 23296.22ms. Allocated memory was 173.0MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 147.1MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 307.7MB. Max. memory is 8.0GB. [2022-12-06 01:14:47,763 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 173.0MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 01:14:47,763 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.27ms. Allocated memory is still 173.0MB. Free memory was 147.1MB in the beginning and 120.7MB in the end (delta: 26.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 01:14:47,764 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.22ms. Allocated memory is still 173.0MB. Free memory was 120.7MB in the beginning and 118.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 01:14:47,764 INFO L158 Benchmark]: Boogie Preprocessor took 27.15ms. Allocated memory is still 173.0MB. Free memory was 118.2MB in the beginning and 116.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 01:14:47,764 INFO L158 Benchmark]: RCFGBuilder took 661.54ms. Allocated memory is still 173.0MB. Free memory was 116.1MB in the beginning and 81.5MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-06 01:14:47,764 INFO L158 Benchmark]: TraceAbstraction took 22124.94ms. Allocated memory was 173.0MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 81.0MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 241.7MB. Max. memory is 8.0GB. [2022-12-06 01:14:47,766 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.10ms. Allocated memory is still 173.0MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 425.27ms. Allocated memory is still 173.0MB. Free memory was 147.1MB in the beginning and 120.7MB in the end (delta: 26.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.22ms. Allocated memory is still 173.0MB. Free memory was 120.7MB in the beginning and 118.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.15ms. Allocated memory is still 173.0MB. Free memory was 118.2MB in the beginning and 116.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 661.54ms. Allocated memory is still 173.0MB. Free memory was 116.1MB in the beginning and 81.5MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 22124.94ms. Allocated memory was 173.0MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 81.0MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 241.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 110 PlacesBefore, 36 PlacesAfterwards, 102 TransitionsBefore, 27 TransitionsAfterwards, 1818 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 80 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1317, independent: 1265, independent conditional: 1265, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1317, independent: 1265, independent conditional: 0, independent unconditional: 1265, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1317, independent: 1265, independent conditional: 0, independent unconditional: 1265, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1317, independent: 1265, independent conditional: 0, independent unconditional: 1265, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1111, independent: 1079, independent conditional: 0, independent unconditional: 1079, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1111, independent: 1072, independent conditional: 0, independent unconditional: 1072, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 39, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 170, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1317, independent: 186, independent conditional: 0, independent unconditional: 186, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 1111, unknown conditional: 0, unknown unconditional: 1111] , Statistics on independence cache: Total cache size (in pairs): 1720, Positive cache size: 1688, Positive conditional cache size: 0, Positive unconditional cache size: 1688, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 36 PlacesBefore, 35 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 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, 40 PlacesBefore, 40 PlacesAfterwards, 129 TransitionsBefore, 129 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, 43 PlacesBefore, 43 PlacesAfterwards, 139 TransitionsBefore, 139 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, 46 PlacesBefore, 46 PlacesAfterwards, 178 TransitionsBefore, 178 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 235 TransitionsBefore, 235 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 312 TransitionsBefore, 312 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, 57 PlacesBefore, 57 PlacesAfterwards, 380 TransitionsBefore, 380 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, 61 PlacesBefore, 61 PlacesAfterwards, 416 TransitionsBefore, 416 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, 66 PlacesBefore, 66 PlacesAfterwards, 579 TransitionsBefore, 579 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, 799 TransitionsBefore, 799 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, 927 TransitionsBefore, 927 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, 78 PlacesBefore, 78 PlacesAfterwards, 960 TransitionsBefore, 960 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: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 18]: 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 7 procedures, 131 locations, 6 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: 22.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 594 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 594 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 188 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1239 IncrementalHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 188 mSolverCounterUnsat, 15 mSDtfsCounter, 1239 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26772occurred in iteration=13, InterpolantAutomatonStates: 59, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 2572 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 01:14:47,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...