/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/safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 01:12:52,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 01:12:52,015 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 01:12:52,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 01:12:52,054 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 01:12:52,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 01:12:52,060 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 01:12:52,063 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 01:12:52,066 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 01:12:52,071 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 01:12:52,071 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 01:12:52,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 01:12:52,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 01:12:52,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 01:12:52,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 01:12:52,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 01:12:52,081 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 01:12:52,081 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 01:12:52,083 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 01:12:52,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 01:12:52,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 01:12:52,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 01:12:52,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 01:12:52,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 01:12:52,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 01:12:52,098 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 01:12:52,098 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 01:12:52,100 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 01:12:52,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 01:12:52,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 01:12:52,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 01:12:52,102 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 01:12:52,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 01:12:52,104 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 01:12:52,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 01:12:52,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 01:12:52,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 01:12:52,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 01:12:52,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 01:12:52,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 01:12:52,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 01:12:52,107 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:12:52,134 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 01:12:52,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 01:12:52,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 01:12:52,136 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 01:12:52,136 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 01:12:52,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 01:12:52,137 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 01:12:52,137 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 01:12:52,137 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 01:12:52,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 01:12:52,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 01:12:52,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 01:12:52,138 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 01:12:52,138 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 01:12:52,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 01:12:52,138 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 01:12:52,138 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 01:12:52,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 01:12:52,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 01:12:52,138 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 01:12:52,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 01:12:52,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:12:52,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 01:12:52,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 01:12:52,139 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 01:12:52,139 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 01:12:52,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 01:12:52,139 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 01:12:52,140 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:12:52,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 01:12:52,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 01:12:52,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 01:12:52,383 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 01:12:52,384 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 01:12:52,385 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-06 01:12:53,495 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 01:12:53,692 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 01:12:53,692 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-06 01:12:53,707 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/667595ebe/a69c67e94cb54d7d9d495bbc10965320/FLAG0f72d560d [2022-12-06 01:12:53,724 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/667595ebe/a69c67e94cb54d7d9d495bbc10965320 [2022-12-06 01:12:53,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 01:12:53,726 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 01:12:53,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 01:12:53,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 01:12:53,730 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 01:12:53,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:12:53" (1/1) ... [2022-12-06 01:12:53,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d3d85f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:12:53, skipping insertion in model container [2022-12-06 01:12:53,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:12:53" (1/1) ... [2022-12-06 01:12:53,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 01:12:53,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 01:12:53,928 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/safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-06 01:12:54,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:12:54,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:12:54,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:12:54,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:12:54,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:12:54,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:12:54,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:12:54,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:12:54,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:12:54,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:12:54,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:12:54,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:12:54,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:12:54,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:12:54,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:12:54,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:12:54,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:12:54,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:12:54,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:12:54,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:12:54,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:12:54,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:12:54,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:12:54,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:12:54,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:12:54,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:12:54,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:12:54,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:12:54,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:12:54,086 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 01:12:54,097 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/safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-06 01:12:54,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:12:54,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:12:54,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:12:54,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:12:54,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:12:54,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:12:54,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:12:54,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:12:54,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:12:54,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:12:54,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:12:54,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:12:54,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:12:54,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:12:54,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:12:54,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:12:54,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:12:54,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:12:54,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:12:54,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:12:54,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:12:54,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:12:54,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:12:54,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:12:54,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:12:54,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:12:54,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:12:54,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:12:54,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:12:54,166 INFO L208 MainTranslator]: Completed translation [2022-12-06 01:12:54,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:12:54 WrapperNode [2022-12-06 01:12:54,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 01:12:54,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 01:12:54,169 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 01:12:54,169 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 01:12:54,174 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:12:54" (1/1) ... [2022-12-06 01:12:54,199 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:12:54" (1/1) ... [2022-12-06 01:12:54,217 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2022-12-06 01:12:54,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 01:12:54,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 01:12:54,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 01:12:54,219 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 01:12:54,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:12:54" (1/1) ... [2022-12-06 01:12:54,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:12:54" (1/1) ... [2022-12-06 01:12:54,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:12:54" (1/1) ... [2022-12-06 01:12:54,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:12:54" (1/1) ... [2022-12-06 01:12:54,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:12:54" (1/1) ... [2022-12-06 01:12:54,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:12:54" (1/1) ... [2022-12-06 01:12:54,242 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:12:54" (1/1) ... [2022-12-06 01:12:54,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:12:54" (1/1) ... [2022-12-06 01:12:54,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 01:12:54,245 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 01:12:54,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 01:12:54,245 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 01:12:54,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:12:54" (1/1) ... [2022-12-06 01:12:54,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:12:54,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:12:54,274 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:12:54,294 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:12:54,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 01:12:54,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 01:12:54,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 01:12:54,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 01:12:54,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 01:12:54,317 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 01:12:54,317 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 01:12:54,317 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 01:12:54,317 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 01:12:54,318 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 01:12:54,318 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 01:12:54,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 01:12:54,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 01:12:54,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 01:12:54,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 01:12:54,320 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:12:54,422 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 01:12:54,424 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 01:12:54,563 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 01:12:54,568 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 01:12:54,568 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 01:12:54,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:12:54 BoogieIcfgContainer [2022-12-06 01:12:54,570 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 01:12:54,572 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 01:12:54,572 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 01:12:54,588 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 01:12:54,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 01:12:53" (1/3) ... [2022-12-06 01:12:54,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d5c475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:12:54, skipping insertion in model container [2022-12-06 01:12:54,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:12:54" (2/3) ... [2022-12-06 01:12:54,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d5c475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:12:54, skipping insertion in model container [2022-12-06 01:12:54,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:12:54" (3/3) ... [2022-12-06 01:12:54,590 INFO L112 eAbstractionObserver]: Analyzing ICFG safe009_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-06 01:12:54,604 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 01:12:54,605 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 01:12:54,605 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 01:12:54,649 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 01:12:54,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 83 transitions, 181 flow [2022-12-06 01:12:54,729 INFO L130 PetriNetUnfolder]: 2/80 cut-off events. [2022-12-06 01:12:54,729 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:12:54,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 80 events. 2/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2022-12-06 01:12:54,735 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 83 transitions, 181 flow [2022-12-06 01:12:54,737 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 68 transitions, 145 flow [2022-12-06 01:12:54,739 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:12:54,751 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 68 transitions, 145 flow [2022-12-06 01:12:54,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 68 transitions, 145 flow [2022-12-06 01:12:54,779 INFO L130 PetriNetUnfolder]: 1/68 cut-off events. [2022-12-06 01:12:54,779 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:12:54,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 68 events. 1/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 35 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-06 01:12:54,781 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 68 transitions, 145 flow [2022-12-06 01:12:54,782 INFO L188 LiptonReduction]: Number of co-enabled transitions 988 [2022-12-06 01:12:56,672 INFO L203 LiptonReduction]: Total number of compositions: 52 [2022-12-06 01:12:56,697 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 01:12:56,704 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;@2850250b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 01:12:56,704 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 01:12:56,710 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-06 01:12:56,711 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:12:56,711 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:12:56,712 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:12:56,712 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:12:56,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:12:56,716 INFO L85 PathProgramCache]: Analyzing trace with hash -2141580155, now seen corresponding path program 1 times [2022-12-06 01:12:56,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:12:56,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740228434] [2022-12-06 01:12:56,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:12:56,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:12:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:12:57,166 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:12:57,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:12:57,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740228434] [2022-12-06 01:12:57,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740228434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:12:57,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:12:57,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:12:57,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313573918] [2022-12-06 01:12:57,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:12:57,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:12:57,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:12:57,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:12:57,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:12:57,203 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 01:12:57,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 43 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:12:57,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:12:57,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 01:12:57,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:12:57,320 INFO L130 PetriNetUnfolder]: 283/491 cut-off events. [2022-12-06 01:12:57,320 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-06 01:12:57,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1013 conditions, 491 events. 283/491 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2222 event pairs, 113 based on Foata normal form. 19/510 useless extension candidates. Maximal degree in co-relation 1002. Up to 335 conditions per place. [2022-12-06 01:12:57,327 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 21 selfloop transitions, 5 changer transitions 0/27 dead transitions. [2022-12-06 01:12:57,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 27 transitions, 121 flow [2022-12-06 01:12:57,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:12:57,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:12:57,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 01:12:57,335 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-06 01:12:57,338 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2022-12-06 01:12:57,338 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:12:57,339 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 27 transitions, 121 flow [2022-12-06 01:12:57,344 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 27 transitions, 121 flow [2022-12-06 01:12:57,344 INFO L188 LiptonReduction]: Number of co-enabled transitions 34 [2022-12-06 01:12:57,477 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 01:12:57,479 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-06 01:12:57,480 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 26 transitions, 119 flow [2022-12-06 01:12:57,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:12:57,480 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:12:57,480 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:12:57,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 01:12:57,483 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:12:57,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:12:57,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1964476603, now seen corresponding path program 1 times [2022-12-06 01:12:57,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:12:57,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926482806] [2022-12-06 01:12:57,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:12:57,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:12:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:12:57,617 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:12:57,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:12:57,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926482806] [2022-12-06 01:12:57,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926482806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:12:57,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:12:57,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:12:57,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990149707] [2022-12-06 01:12:57,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:12:57,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:12:57,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:12:57,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:12:57,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:12:57,620 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 01:12:57,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 26 transitions, 119 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:12:57,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:12:57,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 01:12:57,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:12:57,708 INFO L130 PetriNetUnfolder]: 258/441 cut-off events. [2022-12-06 01:12:57,708 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-06 01:12:57,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1369 conditions, 441 events. 258/441 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1731 event pairs, 18 based on Foata normal form. 10/451 useless extension candidates. Maximal degree in co-relation 1355. Up to 307 conditions per place. [2022-12-06 01:12:57,713 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 31 selfloop transitions, 7 changer transitions 0/38 dead transitions. [2022-12-06 01:12:57,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 38 transitions, 249 flow [2022-12-06 01:12:57,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:12:57,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:12:57,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-06 01:12:57,715 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2022-12-06 01:12:57,716 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2022-12-06 01:12:57,717 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:12:57,717 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 38 transitions, 249 flow [2022-12-06 01:12:57,720 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 38 transitions, 249 flow [2022-12-06 01:12:57,720 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:12:57,788 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:12:57,789 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-06 01:12:57,790 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 38 transitions, 253 flow [2022-12-06 01:12:57,790 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:12:57,790 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:12:57,790 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:12:57,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 01:12:57,790 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:12:57,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:12:57,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1964475921, now seen corresponding path program 1 times [2022-12-06 01:12:57,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:12:57,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006275772] [2022-12-06 01:12:57,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:12:57,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:12:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:12:57,898 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:12:57,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:12:57,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006275772] [2022-12-06 01:12:57,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006275772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:12:57,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:12:57,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:12:57,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941076707] [2022-12-06 01:12:57,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:12:57,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:12:57,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:12:57,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:12:57,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:12:57,900 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-06 01:12:57,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 38 transitions, 253 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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:12:57,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:12:57,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-06 01:12:57,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:12:57,950 INFO L130 PetriNetUnfolder]: 210/381 cut-off events. [2022-12-06 01:12:57,950 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2022-12-06 01:12:57,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1543 conditions, 381 events. 210/381 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1549 event pairs, 14 based on Foata normal form. 16/397 useless extension candidates. Maximal degree in co-relation 1526. Up to 301 conditions per place. [2022-12-06 01:12:57,952 INFO L137 encePairwiseOnDemand]: 14/18 looper letters, 41 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2022-12-06 01:12:57,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 48 transitions, 407 flow [2022-12-06 01:12:57,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:12:57,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:12:57,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-12-06 01:12:57,954 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2022-12-06 01:12:57,954 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 6 predicate places. [2022-12-06 01:12:57,954 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:12:57,955 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 48 transitions, 407 flow [2022-12-06 01:12:57,957 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 48 transitions, 407 flow [2022-12-06 01:12:57,957 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:12:57,957 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:12:57,958 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-06 01:12:57,958 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 48 transitions, 407 flow [2022-12-06 01:12:57,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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:12:57,958 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:12:57,958 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:12:57,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 01:12:57,958 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:12:57,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:12:57,959 INFO L85 PathProgramCache]: Analyzing trace with hash -769233105, now seen corresponding path program 1 times [2022-12-06 01:12:57,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:12:57,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276089667] [2022-12-06 01:12:57,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:12:57,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:12:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:12:58,050 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:12:58,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:12:58,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276089667] [2022-12-06 01:12:58,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276089667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:12:58,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:12:58,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:12:58,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362585917] [2022-12-06 01:12:58,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:12:58,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:12:58,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:12:58,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:12:58,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:12:58,051 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 01:12:58,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 48 transitions, 407 flow. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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:12:58,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:12:58,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 01:12:58,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:12:58,139 INFO L130 PetriNetUnfolder]: 242/461 cut-off events. [2022-12-06 01:12:58,139 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-12-06 01:12:58,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2317 conditions, 461 events. 242/461 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2095 event pairs, 30 based on Foata normal form. 32/493 useless extension candidates. Maximal degree in co-relation 2297. Up to 373 conditions per place. [2022-12-06 01:12:58,142 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 30 selfloop transitions, 7 changer transitions 19/56 dead transitions. [2022-12-06 01:12:58,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 56 transitions, 581 flow [2022-12-06 01:12:58,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:12:58,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:12:58,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-06 01:12:58,144 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43529411764705883 [2022-12-06 01:12:58,145 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 10 predicate places. [2022-12-06 01:12:58,145 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:12:58,146 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 56 transitions, 581 flow [2022-12-06 01:12:58,149 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 56 transitions, 581 flow [2022-12-06 01:12:58,149 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:12:58,151 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:12:58,156 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 01:12:58,156 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 56 transitions, 581 flow [2022-12-06 01:12:58,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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:12:58,156 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:12:58,157 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:12:58,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 01:12:58,157 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:12:58,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:12:58,157 INFO L85 PathProgramCache]: Analyzing trace with hash -769212645, now seen corresponding path program 2 times [2022-12-06 01:12:58,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:12:58,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448679023] [2022-12-06 01:12:58,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:12:58,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:12:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:12:58,233 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:12:58,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:12:58,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448679023] [2022-12-06 01:12:58,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448679023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:12:58,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:12:58,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:12:58,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089502939] [2022-12-06 01:12:58,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:12:58,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:12:58,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:12:58,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:12:58,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:12:58,234 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 01:12:58,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 56 transitions, 581 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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:12:58,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:12:58,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 01:12:58,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:12:58,297 INFO L130 PetriNetUnfolder]: 230/445 cut-off events. [2022-12-06 01:12:58,297 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-12-06 01:12:58,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2683 conditions, 445 events. 230/445 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2040 event pairs, 24 based on Foata normal form. 8/453 useless extension candidates. Maximal degree in co-relation 2660. Up to 357 conditions per place. [2022-12-06 01:12:58,299 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 32 selfloop transitions, 9 changer transitions 25/66 dead transitions. [2022-12-06 01:12:58,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 66 transitions, 816 flow [2022-12-06 01:12:58,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:12:58,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:12:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-06 01:12:58,300 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45588235294117646 [2022-12-06 01:12:58,300 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 13 predicate places. [2022-12-06 01:12:58,300 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:12:58,301 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 66 transitions, 816 flow [2022-12-06 01:12:58,303 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 66 transitions, 816 flow [2022-12-06 01:12:58,303 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:12:58,304 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:12:58,304 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-06 01:12:58,304 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 66 transitions, 816 flow [2022-12-06 01:12:58,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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:12:58,304 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:12:58,305 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:12:58,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 01:12:58,305 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:12:58,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:12:58,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1923802118, now seen corresponding path program 1 times [2022-12-06 01:12:58,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:12:58,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16716437] [2022-12-06 01:12:58,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:12:58,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:12:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:12:58,370 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:12:58,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:12:58,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16716437] [2022-12-06 01:12:58,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16716437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:12:58,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:12:58,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:12:58,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878221167] [2022-12-06 01:12:58,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:12:58,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:12:58,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:12:58,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:12:58,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:12:58,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 01:12:58,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 66 transitions, 816 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:12:58,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:12:58,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 01:12:58,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:12:58,470 INFO L130 PetriNetUnfolder]: 199/440 cut-off events. [2022-12-06 01:12:58,470 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2022-12-06 01:12:58,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3090 conditions, 440 events. 199/440 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2343 event pairs, 0 based on Foata normal form. 32/472 useless extension candidates. Maximal degree in co-relation 3064. Up to 342 conditions per place. [2022-12-06 01:12:58,472 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 16 selfloop transitions, 4 changer transitions 92/112 dead transitions. [2022-12-06 01:12:58,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 112 transitions, 1601 flow [2022-12-06 01:12:58,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:12:58,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:12:58,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-06 01:12:58,473 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4823529411764706 [2022-12-06 01:12:58,473 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 17 predicate places. [2022-12-06 01:12:58,473 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:12:58,474 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 112 transitions, 1601 flow [2022-12-06 01:12:58,477 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 112 transitions, 1601 flow [2022-12-06 01:12:58,477 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:12:58,478 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:12:58,478 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 01:12:58,478 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 112 transitions, 1601 flow [2022-12-06 01:12:58,479 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:12:58,479 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:12:58,479 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:12:58,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 01:12:58,479 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:12:58,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:12:58,479 INFO L85 PathProgramCache]: Analyzing trace with hash -478968220, now seen corresponding path program 1 times [2022-12-06 01:12:58,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:12:58,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573705608] [2022-12-06 01:12:58,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:12:58,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:12:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:12:58,549 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:12:58,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:12:58,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573705608] [2022-12-06 01:12:58,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573705608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:12:58,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:12:58,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:12:58,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782568776] [2022-12-06 01:12:58,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:12:58,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:12:58,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:12:58,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:12:58,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:12:58,550 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 01:12:58,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 112 transitions, 1601 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:12:58,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:12:58,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 01:12:58,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:12:58,624 INFO L130 PetriNetUnfolder]: 197/438 cut-off events. [2022-12-06 01:12:58,625 INFO L131 PetriNetUnfolder]: For 199/199 co-relation queries the response was YES. [2022-12-06 01:12:58,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3469 conditions, 438 events. 197/438 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2265 event pairs, 1 based on Foata normal form. 2/440 useless extension candidates. Maximal degree in co-relation 3440. Up to 340 conditions per place. [2022-12-06 01:12:58,626 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 15 selfloop transitions, 4 changer transitions 217/237 dead transitions. [2022-12-06 01:12:58,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 237 transitions, 3816 flow [2022-12-06 01:12:58,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:12:58,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:12:58,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-12-06 01:12:58,627 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5411764705882353 [2022-12-06 01:12:58,628 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 21 predicate places. [2022-12-06 01:12:58,628 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:12:58,628 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 237 transitions, 3816 flow [2022-12-06 01:12:58,633 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 237 transitions, 3816 flow [2022-12-06 01:12:58,633 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:12:58,634 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:12:58,634 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 01:12:58,635 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 237 transitions, 3816 flow [2022-12-06 01:12:58,635 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:12:58,635 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:12:58,635 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:12:58,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 01:12:58,635 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:12:58,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:12:58,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1926374036, now seen corresponding path program 1 times [2022-12-06 01:12:58,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:12:58,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345436639] [2022-12-06 01:12:58,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:12:58,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:12:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:12:58,703 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:12:58,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:12:58,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345436639] [2022-12-06 01:12:58,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345436639] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:12:58,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:12:58,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:12:58,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147939503] [2022-12-06 01:12:58,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:12:58,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:12:58,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:12:58,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:12:58,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:12:58,704 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-06 01:12:58,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 237 transitions, 3816 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:12:58,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:12:58,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-06 01:12:58,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:12:58,785 INFO L130 PetriNetUnfolder]: 194/432 cut-off events. [2022-12-06 01:12:58,786 INFO L131 PetriNetUnfolder]: For 404/404 co-relation queries the response was YES. [2022-12-06 01:12:58,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3811 conditions, 432 events. 194/432 cut-off events. For 404/404 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2216 event pairs, 0 based on Foata normal form. 1/433 useless extension candidates. Maximal degree in co-relation 3779. Up to 335 conditions per place. [2022-12-06 01:12:58,787 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 12 selfloop transitions, 7 changer transitions 273/293 dead transitions. [2022-12-06 01:12:58,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 293 transitions, 5289 flow [2022-12-06 01:12:58,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:12:58,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:12:58,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 01:12:58,788 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-06 01:12:58,789 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 24 predicate places. [2022-12-06 01:12:58,789 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:12:58,789 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 293 transitions, 5289 flow [2022-12-06 01:12:58,795 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 293 transitions, 5289 flow [2022-12-06 01:12:58,796 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:12:58,796 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:12:58,797 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 01:12:58,797 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 293 transitions, 5289 flow [2022-12-06 01:12:58,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:12:58,797 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:12:58,797 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:12:58,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 01:12:58,797 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:12:58,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:12:58,798 INFO L85 PathProgramCache]: Analyzing trace with hash -390310201, now seen corresponding path program 1 times [2022-12-06 01:12:58,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:12:58,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984932971] [2022-12-06 01:12:58,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:12:58,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:12:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:12:58,868 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:12:58,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:12:58,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984932971] [2022-12-06 01:12:58,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984932971] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:12:58,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:12:58,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:12:58,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922405062] [2022-12-06 01:12:58,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:12:58,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:12:58,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:12:58,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:12:58,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:12:58,870 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-06 01:12:58,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 293 transitions, 5289 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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:12:58,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:12:58,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-06 01:12:58,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:12:58,982 INFO L130 PetriNetUnfolder]: 194/429 cut-off events. [2022-12-06 01:12:58,983 INFO L131 PetriNetUnfolder]: For 688/688 co-relation queries the response was YES. [2022-12-06 01:12:58,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4173 conditions, 429 events. 194/429 cut-off events. For 688/688 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2185 event pairs, 0 based on Foata normal form. 1/430 useless extension candidates. Maximal degree in co-relation 4138. Up to 333 conditions per place. [2022-12-06 01:12:58,985 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 0 selfloop transitions, 0 changer transitions 292/292 dead transitions. [2022-12-06 01:12:58,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 292 transitions, 5837 flow [2022-12-06 01:12:58,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:12:58,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:12:58,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-06 01:12:58,986 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 01:12:58,986 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 27 predicate places. [2022-12-06 01:12:58,986 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:12:58,986 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 292 transitions, 5837 flow [2022-12-06 01:12:58,992 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 292 transitions, 5837 flow [2022-12-06 01:12:58,992 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:12:58,993 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:12:58,994 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 01:12:58,994 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 292 transitions, 5837 flow [2022-12-06 01:12:58,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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:12:58,996 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 01:12:58,996 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 01:12:58,996 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 01:12:58,996 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 01:12:58,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 01:12:58,997 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:12:58,999 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 01:12:58,999 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 01:12:59,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 01:12:59 BasicIcfg [2022-12-06 01:12:59,001 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 01:12:59,001 INFO L158 Benchmark]: Toolchain (without parser) took 5274.73ms. Allocated memory was 212.9MB in the beginning and 315.6MB in the end (delta: 102.8MB). Free memory was 175.5MB in the beginning and 269.7MB in the end (delta: -94.2MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. [2022-12-06 01:12:59,001 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 212.9MB. Free memory is still 189.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 01:12:59,001 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.49ms. Allocated memory is still 212.9MB. Free memory was 174.9MB in the beginning and 151.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-06 01:12:59,002 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.48ms. Allocated memory is still 212.9MB. Free memory was 151.9MB in the beginning and 149.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 01:12:59,002 INFO L158 Benchmark]: Boogie Preprocessor took 25.95ms. Allocated memory is still 212.9MB. Free memory was 149.8MB in the beginning and 148.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 01:12:59,002 INFO L158 Benchmark]: RCFGBuilder took 324.75ms. Allocated memory is still 212.9MB. Free memory was 148.2MB in the beginning and 134.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 01:12:59,002 INFO L158 Benchmark]: TraceAbstraction took 4429.14ms. Allocated memory was 212.9MB in the beginning and 315.6MB in the end (delta: 102.8MB). Free memory was 134.0MB in the beginning and 269.7MB in the end (delta: -135.6MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 01:12:59,003 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 212.9MB. Free memory is still 189.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 439.49ms. Allocated memory is still 212.9MB. Free memory was 174.9MB in the beginning and 151.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.48ms. Allocated memory is still 212.9MB. Free memory was 151.9MB in the beginning and 149.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.95ms. Allocated memory is still 212.9MB. Free memory was 149.8MB in the beginning and 148.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 324.75ms. Allocated memory is still 212.9MB. Free memory was 148.2MB in the beginning and 134.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 4429.14ms. Allocated memory was 212.9MB in the beginning and 315.6MB in the end (delta: 102.8MB). Free memory was 134.0MB in the beginning and 269.7MB in the end (delta: -135.6MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 77 PlacesBefore, 26 PlacesAfterwards, 68 TransitionsBefore, 17 TransitionsAfterwards, 988 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 52 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 664, independent: 630, independent conditional: 630, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 664, independent: 630, independent conditional: 0, independent unconditional: 630, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 664, independent: 630, independent conditional: 0, independent unconditional: 630, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 664, independent: 630, independent conditional: 0, independent unconditional: 630, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 595, independent: 569, independent conditional: 0, independent unconditional: 569, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 595, independent: 560, independent conditional: 0, independent unconditional: 560, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 35, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 664, independent: 61, independent conditional: 0, independent unconditional: 61, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 595, unknown conditional: 0, unknown unconditional: 595] , Statistics on independence cache: Total cache size (in pairs): 874, Positive cache size: 848, Positive conditional cache size: 0, Positive unconditional cache size: 848, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, 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, 28 PlacesBefore, 27 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 34 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.1s, 30 PlacesBefore, 30 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 66 TransitionsBefore, 66 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, 112 TransitionsBefore, 112 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 237 TransitionsBefore, 237 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 293 TransitionsBefore, 293 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, 53 PlacesBefore, 53 PlacesAfterwards, 292 TransitionsBefore, 292 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 105 locations, 4 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: 4.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 151 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 151 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 374 IncrementalHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 5 mSDtfsCounter, 374 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5837occurred in iteration=9, InterpolantAutomatonStates: 38, 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.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 363 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 01:12:59,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...