/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/mix017_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 01:01:50,090 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 01:01:50,092 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 01:01:50,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 01:01:50,127 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 01:01:50,129 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 01:01:50,131 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 01:01:50,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 01:01:50,137 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 01:01:50,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 01:01:50,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 01:01:50,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 01:01:50,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 01:01:50,147 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 01:01:50,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 01:01:50,152 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 01:01:50,152 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 01:01:50,153 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 01:01:50,154 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 01:01:50,155 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 01:01:50,155 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 01:01:50,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 01:01:50,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 01:01:50,158 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 01:01:50,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 01:01:50,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 01:01:50,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 01:01:50,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 01:01:50,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 01:01:50,166 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 01:01:50,167 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 01:01:50,167 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 01:01:50,167 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 01:01:50,168 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 01:01:50,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 01:01:50,169 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 01:01:50,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 01:01:50,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 01:01:50,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 01:01:50,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 01:01:50,170 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 01:01:50,174 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:01:50,203 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 01:01:50,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 01:01:50,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 01:01:50,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 01:01:50,205 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 01:01:50,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 01:01:50,205 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 01:01:50,205 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 01:01:50,205 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 01:01:50,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 01:01:50,205 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 01:01:50,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 01:01:50,205 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 01:01:50,206 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 01:01:50,206 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 01:01:50,206 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 01:01:50,206 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 01:01:50,206 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 01:01:50,206 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 01:01:50,206 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 01:01:50,206 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 01:01:50,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:01:50,206 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 01:01:50,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 01:01:50,207 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 01:01:50,207 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 01:01:50,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 01:01:50,207 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 01:01:50,207 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:01:50,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 01:01:50,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 01:01:50,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 01:01:50,456 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 01:01:50,456 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 01:01:50,457 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_pso.opt_tso.opt.i [2022-12-06 01:01:51,606 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 01:01:51,829 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 01:01:51,830 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_pso.opt_tso.opt.i [2022-12-06 01:01:51,848 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07f986134/7b79bdeb72674772bca4d41045fc9110/FLAG39e0013d4 [2022-12-06 01:01:51,861 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07f986134/7b79bdeb72674772bca4d41045fc9110 [2022-12-06 01:01:51,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 01:01:51,864 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 01:01:51,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 01:01:51,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 01:01:51,868 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 01:01:51,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:01:51" (1/1) ... [2022-12-06 01:01:51,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@391d200c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:01:51, skipping insertion in model container [2022-12-06 01:01:51,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:01:51" (1/1) ... [2022-12-06 01:01:51,874 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 01:01:51,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 01:01:52,068 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/mix017_pso.opt_tso.opt.i[956,969] [2022-12-06 01:01:52,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:01:52,258 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 01:01:52,266 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/mix017_pso.opt_tso.opt.i[956,969] [2022-12-06 01:01:52,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:01:52,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:01:52,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:01:52,354 INFO L208 MainTranslator]: Completed translation [2022-12-06 01:01:52,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:01:52 WrapperNode [2022-12-06 01:01:52,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 01:01:52,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 01:01:52,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 01:01:52,356 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 01:01:52,361 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:01:52" (1/1) ... [2022-12-06 01:01:52,377 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:01:52" (1/1) ... [2022-12-06 01:01:52,396 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2022-12-06 01:01:52,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 01:01:52,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 01:01:52,397 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 01:01:52,397 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 01:01:52,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:01:52" (1/1) ... [2022-12-06 01:01:52,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:01:52" (1/1) ... [2022-12-06 01:01:52,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:01:52" (1/1) ... [2022-12-06 01:01:52,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:01:52" (1/1) ... [2022-12-06 01:01:52,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:01:52" (1/1) ... [2022-12-06 01:01:52,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:01:52" (1/1) ... [2022-12-06 01:01:52,433 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:01:52" (1/1) ... [2022-12-06 01:01:52,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:01:52" (1/1) ... [2022-12-06 01:01:52,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 01:01:52,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 01:01:52,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 01:01:52,449 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 01:01:52,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:01:52" (1/1) ... [2022-12-06 01:01:52,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:01:52,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:01:52,485 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:01:52,501 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:01:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 01:01:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 01:01:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 01:01:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 01:01:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 01:01:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 01:01:52,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 01:01:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 01:01:52,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 01:01:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 01:01:52,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 01:01:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 01:01:52,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 01:01:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 01:01:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 01:01:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 01:01:52,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 01:01:52,512 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:01:52,619 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 01:01:52,620 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 01:01:52,909 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 01:01:53,034 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 01:01:53,035 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 01:01:53,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:01:53 BoogieIcfgContainer [2022-12-06 01:01:53,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 01:01:53,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 01:01:53,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 01:01:53,040 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 01:01:53,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 01:01:51" (1/3) ... [2022-12-06 01:01:53,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d4b6f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:01:53, skipping insertion in model container [2022-12-06 01:01:53,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:01:52" (2/3) ... [2022-12-06 01:01:53,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d4b6f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:01:53, skipping insertion in model container [2022-12-06 01:01:53,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:01:53" (3/3) ... [2022-12-06 01:01:53,042 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_pso.opt_tso.opt.i [2022-12-06 01:01:53,055 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 01:01:53,055 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 01:01:53,055 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 01:01:53,105 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 01:01:53,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2022-12-06 01:01:53,197 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-06 01:01:53,197 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:01:53,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-06 01:01:53,202 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2022-12-06 01:01:53,204 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2022-12-06 01:01:53,206 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:01:53,216 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-06 01:01:53,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2022-12-06 01:01:53,257 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-06 01:01:53,259 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:01:53,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-06 01:01:53,267 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-06 01:01:53,267 INFO L188 LiptonReduction]: Number of co-enabled transitions 2718 [2022-12-06 01:01:57,549 INFO L203 LiptonReduction]: Total number of compositions: 98 [2022-12-06 01:01:57,560 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 01:01:57,564 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;@4a91ead3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 01:01:57,565 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 01:01:57,568 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-06 01:01:57,568 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:01:57,568 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:01:57,569 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:01:57,569 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:01:57,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:01:57,572 INFO L85 PathProgramCache]: Analyzing trace with hash -510420395, now seen corresponding path program 1 times [2022-12-06 01:01:57,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:01:57,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062269380] [2022-12-06 01:01:57,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:01:57,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:01:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:01:57,965 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:01:57,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:01:57,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062269380] [2022-12-06 01:01:57,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062269380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:01:57,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:01:57,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:01:57,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128138505] [2022-12-06 01:01:57,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:01:57,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:01:57,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:01:57,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:01:57,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:01:57,994 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-06 01:01:57,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:01:57,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:01:57,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-06 01:01:57,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:01:58,590 INFO L130 PetriNetUnfolder]: 3113/4511 cut-off events. [2022-12-06 01:01:58,590 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-06 01:01:58,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8905 conditions, 4511 events. 3113/4511 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 23841 event pairs, 593 based on Foata normal form. 0/4147 useless extension candidates. Maximal degree in co-relation 8893. Up to 3385 conditions per place. [2022-12-06 01:01:58,614 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 30 selfloop transitions, 2 changer transitions 4/39 dead transitions. [2022-12-06 01:01:58,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 162 flow [2022-12-06 01:01:58,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:01:58,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:01:58,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-06 01:01:58,623 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 01:01:58,626 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2022-12-06 01:01:58,627 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:01:58,627 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 39 transitions, 162 flow [2022-12-06 01:01:58,651 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 39 transitions, 162 flow [2022-12-06 01:01:58,651 INFO L188 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-06 01:01:58,884 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 01:01:58,886 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 260 [2022-12-06 01:01:58,886 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 156 flow [2022-12-06 01:01:58,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:01:58,886 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:01:58,886 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:01:58,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 01:01:58,887 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:01:58,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:01:58,889 INFO L85 PathProgramCache]: Analyzing trace with hash -887663660, now seen corresponding path program 1 times [2022-12-06 01:01:58,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:01:58,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7214721] [2022-12-06 01:01:58,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:01:58,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:01:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:01:59,106 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:01:59,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:01:59,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7214721] [2022-12-06 01:01:59,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7214721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:01:59,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:01:59,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:01:59,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342521580] [2022-12-06 01:01:59,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:01:59,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:01:59,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:01:59,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:01:59,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:01:59,109 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 01:01:59,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 156 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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:01:59,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:01:59,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 01:01:59,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:01:59,550 INFO L130 PetriNetUnfolder]: 3340/4665 cut-off events. [2022-12-06 01:01:59,550 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2022-12-06 01:01:59,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14100 conditions, 4665 events. 3340/4665 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 20717 event pairs, 168 based on Foata normal form. 0/4321 useless extension candidates. Maximal degree in co-relation 14085. Up to 3964 conditions per place. [2022-12-06 01:01:59,572 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 48 selfloop transitions, 8 changer transitions 12/68 dead transitions. [2022-12-06 01:01:59,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 68 transitions, 429 flow [2022-12-06 01:01:59,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:01:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:01:59,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-06 01:01:59,574 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6410256410256411 [2022-12-06 01:01:59,574 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2022-12-06 01:01:59,575 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:01:59,575 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 68 transitions, 429 flow [2022-12-06 01:01:59,594 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 68 transitions, 429 flow [2022-12-06 01:01:59,594 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:01:59,597 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:01:59,599 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 01:01:59,599 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 68 transitions, 429 flow [2022-12-06 01:01:59,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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:01:59,600 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:01:59,600 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:01:59,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 01:01:59,600 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:01:59,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:01:59,601 INFO L85 PathProgramCache]: Analyzing trace with hash -409405114, now seen corresponding path program 1 times [2022-12-06 01:01:59,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:01:59,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636488416] [2022-12-06 01:01:59,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:01:59,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:01:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:01:59,774 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:01:59,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:01:59,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636488416] [2022-12-06 01:01:59,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636488416] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:01:59,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:01:59,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:01:59,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302012828] [2022-12-06 01:01:59,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:01:59,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:01:59,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:01:59,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:01:59,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:01:59,780 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 01:01:59,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 68 transitions, 429 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:01:59,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:01:59,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 01:01:59,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:02:00,220 INFO L130 PetriNetUnfolder]: 3182/4451 cut-off events. [2022-12-06 01:02:00,221 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-12-06 01:02:00,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17910 conditions, 4451 events. 3182/4451 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 19445 event pairs, 206 based on Foata normal form. 0/4163 useless extension candidates. Maximal degree in co-relation 17892. Up to 3750 conditions per place. [2022-12-06 01:02:00,241 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 61 selfloop transitions, 3 changer transitions 21/85 dead transitions. [2022-12-06 01:02:00,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 85 transitions, 701 flow [2022-12-06 01:02:00,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:02:00,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:02:00,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 01:02:00,243 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4519230769230769 [2022-12-06 01:02:00,243 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-12-06 01:02:00,244 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:02:00,244 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 85 transitions, 701 flow [2022-12-06 01:02:00,260 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 85 transitions, 701 flow [2022-12-06 01:02:00,260 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:02:00,261 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:02:00,262 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 01:02:00,262 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 85 transitions, 701 flow [2022-12-06 01:02:00,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:02:00,262 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:02:00,262 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:02:00,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 01:02:00,263 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:02:00,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:02:00,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1653676597, now seen corresponding path program 1 times [2022-12-06 01:02:00,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:02:00,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564339288] [2022-12-06 01:02:00,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:02:00,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:02:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:02:00,388 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:02:00,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:02:00,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564339288] [2022-12-06 01:02:00,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564339288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:02:00,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:02:00,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:02:00,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439895707] [2022-12-06 01:02:00,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:02:00,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:02:00,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:02:00,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:02:00,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:02:00,390 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 01:02:00,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 85 transitions, 701 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:02:00,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:02:00,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 01:02:00,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:02:00,864 INFO L130 PetriNetUnfolder]: 2737/3954 cut-off events. [2022-12-06 01:02:00,864 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2022-12-06 01:02:00,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19877 conditions, 3954 events. 2737/3954 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 18026 event pairs, 126 based on Foata normal form. 180/3870 useless extension candidates. Maximal degree in co-relation 19856. Up to 3453 conditions per place. [2022-12-06 01:02:00,885 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 68 selfloop transitions, 15 changer transitions 101/184 dead transitions. [2022-12-06 01:02:00,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 184 transitions, 1864 flow [2022-12-06 01:02:00,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:02:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:02:00,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-12-06 01:02:00,888 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5769230769230769 [2022-12-06 01:02:00,889 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2022-12-06 01:02:00,890 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:02:00,890 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 184 transitions, 1864 flow [2022-12-06 01:02:00,910 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 184 transitions, 1864 flow [2022-12-06 01:02:00,910 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:02:00,913 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:02:00,919 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 01:02:00,919 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 184 transitions, 1864 flow [2022-12-06 01:02:00,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:02:00,920 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:02:00,920 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:02:00,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 01:02:00,920 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:02:00,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:02:00,920 INFO L85 PathProgramCache]: Analyzing trace with hash -2130695335, now seen corresponding path program 1 times [2022-12-06 01:02:00,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:02:00,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402209122] [2022-12-06 01:02:00,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:02:00,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:02:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:02:01,091 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:02:01,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:02:01,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402209122] [2022-12-06 01:02:01,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402209122] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:02:01,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:02:01,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:02:01,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706145800] [2022-12-06 01:02:01,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:02:01,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:02:01,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:02:01,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:02:01,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:02:01,092 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 01:02:01,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 184 transitions, 1864 flow. Second operand has 5 states, 5 states have (on average 3.0) 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:02:01,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:02:01,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 01:02:01,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:02:01,509 INFO L130 PetriNetUnfolder]: 2080/3089 cut-off events. [2022-12-06 01:02:01,510 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-12-06 01:02:01,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18642 conditions, 3089 events. 2080/3089 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 13968 event pairs, 59 based on Foata normal form. 132/3001 useless extension candidates. Maximal degree in co-relation 18618. Up to 2788 conditions per place. [2022-12-06 01:02:01,523 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 87 selfloop transitions, 25 changer transitions 182/294 dead transitions. [2022-12-06 01:02:01,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 294 transitions, 3558 flow [2022-12-06 01:02:01,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 01:02:01,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 01:02:01,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-12-06 01:02:01,524 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5879120879120879 [2022-12-06 01:02:01,525 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2022-12-06 01:02:01,525 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:02:01,525 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 294 transitions, 3558 flow [2022-12-06 01:02:01,541 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 294 transitions, 3558 flow [2022-12-06 01:02:01,541 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:02:01,543 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:02:01,544 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 01:02:01,544 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 294 transitions, 3558 flow [2022-12-06 01:02:01,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) 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:02:01,544 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:02:01,544 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:02:01,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 01:02:01,544 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:02:01,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:02:01,544 INFO L85 PathProgramCache]: Analyzing trace with hash -148374161, now seen corresponding path program 1 times [2022-12-06 01:02:01,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:02:01,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560923704] [2022-12-06 01:02:01,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:02:01,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:02:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:02:01,647 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:02:01,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:02:01,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560923704] [2022-12-06 01:02:01,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560923704] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:02:01,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:02:01,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:02:01,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572672206] [2022-12-06 01:02:01,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:02:01,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:02:01,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:02:01,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:02:01,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:02:01,648 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 01:02:01,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 294 transitions, 3558 flow. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:02:01,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:02:01,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 01:02:01,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:02:02,137 INFO L130 PetriNetUnfolder]: 2469/3769 cut-off events. [2022-12-06 01:02:02,137 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2022-12-06 01:02:02,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26512 conditions, 3769 events. 2469/3769 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 18853 event pairs, 36 based on Foata normal form. 0/3509 useless extension candidates. Maximal degree in co-relation 26485. Up to 3418 conditions per place. [2022-12-06 01:02:02,150 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 168 selfloop transitions, 12 changer transitions 436/616 dead transitions. [2022-12-06 01:02:02,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 616 transitions, 8684 flow [2022-12-06 01:02:02,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:02:02,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:02:02,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-06 01:02:02,151 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6057692307692307 [2022-12-06 01:02:02,152 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2022-12-06 01:02:02,152 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:02:02,152 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 616 transitions, 8684 flow [2022-12-06 01:02:02,170 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 616 transitions, 8684 flow [2022-12-06 01:02:02,171 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:02:02,172 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:02:02,173 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 01:02:02,173 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 616 transitions, 8684 flow [2022-12-06 01:02:02,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:02:02,173 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:02:02,173 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:02:02,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 01:02:02,173 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:02:02,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:02:02,174 INFO L85 PathProgramCache]: Analyzing trace with hash -992903363, now seen corresponding path program 2 times [2022-12-06 01:02:02,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:02:02,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345037573] [2022-12-06 01:02:02,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:02:02,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:02:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:02:02,294 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:02:02,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:02:02,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345037573] [2022-12-06 01:02:02,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345037573] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:02:02,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:02:02,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 01:02:02,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819855343] [2022-12-06 01:02:02,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:02:02,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:02:02,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:02:02,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:02:02,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 01:02:02,296 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 01:02:02,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 616 transitions, 8684 flow. Second operand has 6 states, 6 states have (on average 2.8333333333333335) 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:02:02,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:02:02,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 01:02:02,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:02:02,941 INFO L130 PetriNetUnfolder]: 2124/3239 cut-off events. [2022-12-06 01:02:02,941 INFO L131 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2022-12-06 01:02:02,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26042 conditions, 3239 events. 2124/3239 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 15771 event pairs, 18 based on Foata normal form. 84/3093 useless extension candidates. Maximal degree in co-relation 26012. Up to 3017 conditions per place. [2022-12-06 01:02:02,954 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 139 selfloop transitions, 43 changer transitions 543/725 dead transitions. [2022-12-06 01:02:02,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 725 transitions, 11666 flow [2022-12-06 01:02:02,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 01:02:02,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 01:02:02,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 133 transitions. [2022-12-06 01:02:02,955 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5683760683760684 [2022-12-06 01:02:02,956 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2022-12-06 01:02:02,956 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:02:02,956 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 725 transitions, 11666 flow [2022-12-06 01:02:02,979 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 725 transitions, 11666 flow [2022-12-06 01:02:02,979 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:02:02,981 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:02:02,981 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 01:02:02,981 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 725 transitions, 11666 flow [2022-12-06 01:02:02,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) 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:02:02,982 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:02:02,982 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:02:02,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 01:02:02,982 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:02:02,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:02:02,982 INFO L85 PathProgramCache]: Analyzing trace with hash 120876649, now seen corresponding path program 1 times [2022-12-06 01:02:02,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:02:02,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180547406] [2022-12-06 01:02:02,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:02:02,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:02:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:02:03,105 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:02:03,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:02:03,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180547406] [2022-12-06 01:02:03,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180547406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:02:03,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:02:03,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:02:03,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061761826] [2022-12-06 01:02:03,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:02:03,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:02:03,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:02:03,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:02:03,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:02:03,106 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 01:02:03,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 725 transitions, 11666 flow. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:02:03,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:02:03,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 01:02:03,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:02:03,819 INFO L130 PetriNetUnfolder]: 2595/4046 cut-off events. [2022-12-06 01:02:03,819 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2022-12-06 01:02:03,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36545 conditions, 4046 events. 2595/4046 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 21334 event pairs, 7 based on Foata normal form. 0/3752 useless extension candidates. Maximal degree in co-relation 36512. Up to 3803 conditions per place. [2022-12-06 01:02:03,832 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 231 selfloop transitions, 14 changer transitions 972/1217 dead transitions. [2022-12-06 01:02:03,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 1217 transitions, 22005 flow [2022-12-06 01:02:03,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:02:03,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:02:03,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-06 01:02:03,833 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5673076923076923 [2022-12-06 01:02:03,834 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places. [2022-12-06 01:02:03,834 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:02:03,834 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 1217 transitions, 22005 flow [2022-12-06 01:02:03,861 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 1217 transitions, 22005 flow [2022-12-06 01:02:03,861 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:02:03,863 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:02:03,864 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 01:02:03,864 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 1217 transitions, 22005 flow [2022-12-06 01:02:03,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:02:03,864 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:02:03,864 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:02:03,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 01:02:03,864 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:02:03,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:02:03,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1634537211, now seen corresponding path program 1 times [2022-12-06 01:02:03,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:02:03,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623135742] [2022-12-06 01:02:03,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:02:03,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:02:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:02:03,996 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:02:03,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:02:03,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623135742] [2022-12-06 01:02:03,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623135742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:02:03,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:02:03,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 01:02:03,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125175473] [2022-12-06 01:02:03,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:02:03,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 01:02:03,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:02:03,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 01:02:03,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 01:02:03,998 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 01:02:03,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 1217 transitions, 22005 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:02:03,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:02:03,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 01:02:03,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:02:04,890 INFO L130 PetriNetUnfolder]: 2526/3895 cut-off events. [2022-12-06 01:02:04,890 INFO L131 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2022-12-06 01:02:04,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39082 conditions, 3895 events. 2526/3895 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 20212 event pairs, 2 based on Foata normal form. 35/3645 useless extension candidates. Maximal degree in co-relation 39046. Up to 3700 conditions per place. [2022-12-06 01:02:04,902 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 48 selfloop transitions, 25 changer transitions 1136/1209 dead transitions. [2022-12-06 01:02:04,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 1209 transitions, 24279 flow [2022-12-06 01:02:04,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 01:02:04,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 01:02:04,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2022-12-06 01:02:04,903 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47202797202797203 [2022-12-06 01:02:04,904 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2022-12-06 01:02:04,904 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:02:04,904 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 1209 transitions, 24279 flow [2022-12-06 01:02:04,931 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 1209 transitions, 24279 flow [2022-12-06 01:02:04,931 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:02:04,933 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:02:04,934 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 01:02:04,934 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 1209 transitions, 24279 flow [2022-12-06 01:02:04,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:02:04,934 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:02:04,934 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:02:04,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 01:02:04,934 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:02:04,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:02:04,935 INFO L85 PathProgramCache]: Analyzing trace with hash -2100737850, now seen corresponding path program 1 times [2022-12-06 01:02:04,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:02:04,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057623544] [2022-12-06 01:02:04,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:02:04,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:02:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:02:05,048 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:02:05,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:02:05,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057623544] [2022-12-06 01:02:05,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057623544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:02:05,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:02:05,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:02:05,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423435827] [2022-12-06 01:02:05,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:02:05,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:02:05,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:02:05,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:02:05,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:02:05,050 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 01:02:05,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 1209 transitions, 24279 flow. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:02:05,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:02:05,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 01:02:05,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:02:06,074 INFO L130 PetriNetUnfolder]: 3001/4803 cut-off events. [2022-12-06 01:02:06,075 INFO L131 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2022-12-06 01:02:06,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52990 conditions, 4803 events. 3001/4803 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 27535 event pairs, 0 based on Foata normal form. 0/4440 useless extension candidates. Maximal degree in co-relation 52951. Up to 4604 conditions per place. [2022-12-06 01:02:06,090 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 33 selfloop transitions, 2 changer transitions 2016/2051 dead transitions. [2022-12-06 01:02:06,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 2051 transitions, 45272 flow [2022-12-06 01:02:06,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:02:06,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:02:06,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 01:02:06,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2022-12-06 01:02:06,093 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 39 predicate places. [2022-12-06 01:02:06,094 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:02:06,094 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 2051 transitions, 45272 flow [2022-12-06 01:02:06,153 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 2051 transitions, 45272 flow [2022-12-06 01:02:06,153 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:02:06,158 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:02:06,158 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-06 01:02:06,159 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 2051 transitions, 45272 flow [2022-12-06 01:02:06,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:02:06,159 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:02:06,159 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:02:06,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 01:02:06,159 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:02:06,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:02:06,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1028277452, now seen corresponding path program 2 times [2022-12-06 01:02:06,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:02:06,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135761182] [2022-12-06 01:02:06,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:02:06,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:02:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:02:07,017 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:02:07,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:02:07,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135761182] [2022-12-06 01:02:07,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135761182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:02:07,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:02:07,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 01:02:07,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689790791] [2022-12-06 01:02:07,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:02:07,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 01:02:07,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:02:07,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 01:02:07,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 01:02:07,019 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 01:02:07,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 2051 transitions, 45272 flow. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:02:07,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:02:07,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 01:02:07,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:02:09,022 INFO L130 PetriNetUnfolder]: 3583/5902 cut-off events. [2022-12-06 01:02:09,022 INFO L131 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2022-12-06 01:02:09,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70982 conditions, 5902 events. 3583/5902 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 37063 event pairs, 0 based on Foata normal form. 0/5440 useless extension candidates. Maximal degree in co-relation 70940. Up to 5696 conditions per place. [2022-12-06 01:02:09,041 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 0 selfloop transitions, 0 changer transitions 2905/2905 dead transitions. [2022-12-06 01:02:09,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 2905 transitions, 69870 flow [2022-12-06 01:02:09,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 01:02:09,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 01:02:09,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2022-12-06 01:02:09,043 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2932692307692308 [2022-12-06 01:02:09,043 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places. [2022-12-06 01:02:09,043 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:02:09,043 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 2905 transitions, 69870 flow [2022-12-06 01:02:09,115 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 2905 transitions, 69870 flow [2022-12-06 01:02:09,115 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:02:09,121 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:02:09,122 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 01:02:09,122 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 2905 transitions, 69870 flow [2022-12-06 01:02:09,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:02:09,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 01:02:09,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 01:02:09,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 01:02:09,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 01:02:09,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 01:02:09,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 01:02:09,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 01:02:09,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 01:02:09,125 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:02:09,128 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 01:02:09,128 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 01:02:09,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 01:02:09 BasicIcfg [2022-12-06 01:02:09,130 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 01:02:09,130 INFO L158 Benchmark]: Toolchain (without parser) took 17266.10ms. Allocated memory was 165.7MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 140.0MB in the beginning and 762.6MB in the end (delta: -622.6MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-12-06 01:02:09,130 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 165.7MB. Free memory was 143.1MB in the beginning and 143.0MB in the end (delta: 152.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 01:02:09,131 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.06ms. Allocated memory is still 165.7MB. Free memory was 139.6MB in the beginning and 111.4MB in the end (delta: 28.2MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 01:02:09,131 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.85ms. Allocated memory is still 165.7MB. Free memory was 111.4MB in the beginning and 108.7MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 01:02:09,131 INFO L158 Benchmark]: Boogie Preprocessor took 51.62ms. Allocated memory is still 165.7MB. Free memory was 108.7MB in the beginning and 106.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 01:02:09,131 INFO L158 Benchmark]: RCFGBuilder took 587.26ms. Allocated memory is still 165.7MB. Free memory was 106.6MB in the beginning and 119.5MB in the end (delta: -12.9MB). Peak memory consumption was 18.5MB. Max. memory is 8.0GB. [2022-12-06 01:02:09,131 INFO L158 Benchmark]: TraceAbstraction took 16092.23ms. Allocated memory was 165.7MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 118.4MB in the beginning and 762.6MB in the end (delta: -644.2MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-12-06 01:02:09,132 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.13ms. Allocated memory is still 165.7MB. Free memory was 143.1MB in the beginning and 143.0MB in the end (delta: 152.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 489.06ms. Allocated memory is still 165.7MB. Free memory was 139.6MB in the beginning and 111.4MB in the end (delta: 28.2MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.85ms. Allocated memory is still 165.7MB. Free memory was 111.4MB in the beginning and 108.7MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.62ms. Allocated memory is still 165.7MB. Free memory was 108.7MB in the beginning and 106.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 587.26ms. Allocated memory is still 165.7MB. Free memory was 106.6MB in the beginning and 119.5MB in the end (delta: -12.9MB). Peak memory consumption was 18.5MB. Max. memory is 8.0GB. * TraceAbstraction took 16092.23ms. Allocated memory was 165.7MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 118.4MB in the beginning and 762.6MB in the end (delta: -644.2MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 136 PlacesBefore, 42 PlacesAfterwards, 125 TransitionsBefore, 30 TransitionsAfterwards, 2718 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1976, independent: 1917, independent conditional: 1917, independent unconditional: 0, dependent: 59, dependent conditional: 59, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1976, independent: 1917, independent conditional: 0, independent unconditional: 1917, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1976, independent: 1917, independent conditional: 0, independent unconditional: 1917, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1976, independent: 1917, independent conditional: 0, independent unconditional: 1917, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1656, independent: 1614, independent conditional: 0, independent unconditional: 1614, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1656, independent: 1594, independent conditional: 0, independent unconditional: 1594, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 62, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 185, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 157, dependent conditional: 0, dependent unconditional: 157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1976, independent: 303, independent conditional: 0, independent unconditional: 303, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1656, unknown conditional: 0, unknown unconditional: 1656] , Statistics on independence cache: Total cache size (in pairs): 2463, Positive cache size: 2421, Positive conditional cache size: 0, Positive unconditional cache size: 2421, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, 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.2s, 42 PlacesBefore, 39 PlacesAfterwards, 39 TransitionsBefore, 36 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 68 TransitionsBefore, 68 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, 44 PlacesBefore, 44 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 184 TransitionsBefore, 184 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 294 TransitionsBefore, 294 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 616 TransitionsBefore, 616 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, 65 PlacesBefore, 65 PlacesAfterwards, 725 TransitionsBefore, 725 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, 68 PlacesBefore, 68 PlacesAfterwards, 1217 TransitionsBefore, 1217 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 78 PlacesBefore, 78 PlacesAfterwards, 1209 TransitionsBefore, 1209 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, 81 PlacesBefore, 81 PlacesAfterwards, 2051 TransitionsBefore, 2051 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, 87 PlacesBefore, 87 PlacesAfterwards, 2905 TransitionsBefore, 2905 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 163 locations, 7 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: 16.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 624 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 624 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1216 IncrementalHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 0 mSDtfsCounter, 1216 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69870occurred in iteration=11, InterpolantAutomatonStates: 62, 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.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 177 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 1105 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 01:02:09,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...