/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:21:48,979 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:21:48,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:21:49,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:21:49,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:21:49,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:21:49,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:21:49,024 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:21:49,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:21:49,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:21:49,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:21:49,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:21:49,027 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:21:49,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:21:49,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:21:49,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:21:49,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:21:49,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:21:49,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:21:49,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:21:49,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:21:49,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:21:49,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:21:49,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:21:49,044 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:21:49,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:21:49,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:21:49,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:21:49,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:21:49,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:21:49,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:21:49,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:21:49,047 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:21:49,048 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:21:49,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:21:49,049 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:21:49,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:21:49,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:21:49,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:21:49,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:21:49,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:21:49,052 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:21:49,076 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:21:49,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:21:49,078 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:21:49,078 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:21:49,078 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:21:49,079 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:21:49,079 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:21:49,079 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:21:49,079 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:21:49,079 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:21:49,080 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:21:49,080 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:21:49,080 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:21:49,080 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:21:49,080 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:21:49,081 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:21:49,081 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:21:49,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:21:49,081 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:21:49,081 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:21:49,081 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:21:49,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:21:49,081 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:21:49,081 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:21:49,082 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:21:49,082 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:21:49,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:21:49,082 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:21:49,082 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 [2022-12-06 06:21:49,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:21:49,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:21:49,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:21:49,376 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:21:49,379 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:21:49,381 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.i [2022-12-06 06:21:50,478 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:21:50,735 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:21:50,735 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_tso.i [2022-12-06 06:21:50,751 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6081e7a5/b9b9d54e102b4833ab4e53c95871f534/FLAGdd0e6257f [2022-12-06 06:21:50,766 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6081e7a5/b9b9d54e102b4833ab4e53c95871f534 [2022-12-06 06:21:50,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:21:50,771 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:21:50,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:21:50,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:21:50,776 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:21:50,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:21:50" (1/1) ... [2022-12-06 06:21:50,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78f0d6d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:50, skipping insertion in model container [2022-12-06 06:21:50,778 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:21:50" (1/1) ... [2022-12-06 06:21:50,783 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:21:50,828 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:21:50,973 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/mix027_tso.i[944,957] [2022-12-06 06:21:51,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:21:51,171 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:21:51,180 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/mix027_tso.i[944,957] [2022-12-06 06:21:51,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:21:51,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:21:51,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:21:51,266 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:21:51,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:51 WrapperNode [2022-12-06 06:21:51,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:21:51,267 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:21:51,267 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:21:51,267 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:21:51,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:51" (1/1) ... [2022-12-06 06:21:51,296 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:51" (1/1) ... [2022-12-06 06:21:51,332 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2022-12-06 06:21:51,333 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:21:51,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:21:51,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:21:51,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:21:51,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:51" (1/1) ... [2022-12-06 06:21:51,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:51" (1/1) ... [2022-12-06 06:21:51,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:51" (1/1) ... [2022-12-06 06:21:51,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:51" (1/1) ... [2022-12-06 06:21:51,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:51" (1/1) ... [2022-12-06 06:21:51,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:51" (1/1) ... [2022-12-06 06:21:51,383 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:51" (1/1) ... [2022-12-06 06:21:51,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:51" (1/1) ... [2022-12-06 06:21:51,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:21:51,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:21:51,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:21:51,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:21:51,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:51" (1/1) ... [2022-12-06 06:21:51,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:21:51,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:21:51,430 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 06:21:51,440 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 06:21:51,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:21:51,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:21:51,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:21:51,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:21:51,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:21:51,460 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:21:51,460 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:21:51,460 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:21:51,460 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:21:51,461 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:21:51,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:21:51,461 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 06:21:51,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 06:21:51,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:21:51,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:21:51,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:21:51,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:21:51,462 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 06:21:51,575 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:21:51,577 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:21:52,050 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:21:52,186 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:21:52,186 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:21:52,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:21:52 BoogieIcfgContainer [2022-12-06 06:21:52,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:21:52,192 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:21:52,192 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:21:52,195 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:21:52,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:21:50" (1/3) ... [2022-12-06 06:21:52,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ecaf1df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:21:52, skipping insertion in model container [2022-12-06 06:21:52,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:21:51" (2/3) ... [2022-12-06 06:21:52,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ecaf1df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:21:52, skipping insertion in model container [2022-12-06 06:21:52,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:21:52" (3/3) ... [2022-12-06 06:21:52,197 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_tso.i [2022-12-06 06:21:52,211 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:21:52,212 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:21:52,212 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:21:52,260 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:21:52,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2022-12-06 06:21:52,358 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-06 06:21:52,359 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:21:52,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-06 06:21:52,366 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2022-12-06 06:21:52,371 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2022-12-06 06:21:52,373 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:21:52,390 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-06 06:21:52,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2022-12-06 06:21:52,429 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-06 06:21:52,430 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:21:52,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-06 06:21:52,441 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-06 06:21:52,441 INFO L188 LiptonReduction]: Number of co-enabled transitions 3150 [2022-12-06 06:21:58,062 INFO L203 LiptonReduction]: Total number of compositions: 96 [2022-12-06 06:21:58,073 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:21:58,078 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;@518a7cb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:21:58,078 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 06:21:58,081 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-06 06:21:58,081 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:21:58,081 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:21:58,082 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:21:58,082 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:21:58,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:21:58,085 INFO L85 PathProgramCache]: Analyzing trace with hash 517742367, now seen corresponding path program 1 times [2022-12-06 06:21:58,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:21:58,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980792863] [2022-12-06 06:21:58,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:21:58,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:21:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:21:58,472 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 06:21:58,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:21:58,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980792863] [2022-12-06 06:21:58,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980792863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:21:58,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:21:58,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:21:58,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757959989] [2022-12-06 06:21:58,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:21:58,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:21:58,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:21:58,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:21:58,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:21:58,508 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2022-12-06 06:21:58,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:21:58,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:21:58,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2022-12-06 06:21:58,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:21:59,484 INFO L130 PetriNetUnfolder]: 4863/6818 cut-off events. [2022-12-06 06:21:59,485 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-06 06:21:59,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13642 conditions, 6818 events. 4863/6818 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 35218 event pairs, 1800 based on Foata normal form. 0/6157 useless extension candidates. Maximal degree in co-relation 13630. Up to 5308 conditions per place. [2022-12-06 06:21:59,514 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 37 selfloop transitions, 2 changer transitions 8/52 dead transitions. [2022-12-06 06:21:59,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 52 transitions, 216 flow [2022-12-06 06:21:59,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:21:59,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:21:59,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-06 06:21:59,522 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2022-12-06 06:21:59,523 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 82 flow. Second operand 3 states and 67 transitions. [2022-12-06 06:21:59,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 52 transitions, 216 flow [2022-12-06 06:21:59,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 06:21:59,528 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 68 flow [2022-12-06 06:21:59,530 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2022-12-06 06:21:59,532 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2022-12-06 06:21:59,532 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:21:59,533 INFO L89 Accepts]: Start accepts. Operand has 43 places, 28 transitions, 68 flow [2022-12-06 06:21:59,535 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:21:59,535 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:21:59,535 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 28 transitions, 68 flow [2022-12-06 06:21:59,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 28 transitions, 68 flow [2022-12-06 06:21:59,550 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-06 06:21:59,551 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:21:59,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:21:59,551 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 68 flow [2022-12-06 06:21:59,551 INFO L188 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-06 06:21:59,601 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:21:59,607 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 06:21:59,608 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2022-12-06 06:21:59,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:21:59,608 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:21:59,608 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:21:59,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:21:59,612 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:21:59,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:21:59,613 INFO L85 PathProgramCache]: Analyzing trace with hash 721542979, now seen corresponding path program 1 times [2022-12-06 06:21:59,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:21:59,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285961309] [2022-12-06 06:21:59,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:21:59,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:21:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:21:59,982 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 06:21:59,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:21:59,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285961309] [2022-12-06 06:21:59,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285961309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:21:59,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:21:59,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:21:59,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431466670] [2022-12-06 06:21:59,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:21:59,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:21:59,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:21:59,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:21:59,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:21:59,984 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 06:21:59,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:21:59,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:21:59,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 06:21:59,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:01,319 INFO L130 PetriNetUnfolder]: 11242/15116 cut-off events. [2022-12-06 06:22:01,319 INFO L131 PetriNetUnfolder]: For 761/761 co-relation queries the response was YES. [2022-12-06 06:22:01,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31355 conditions, 15116 events. 11242/15116 cut-off events. For 761/761 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 71046 event pairs, 1639 based on Foata normal form. 200/15316 useless extension candidates. Maximal degree in co-relation 31345. Up to 12817 conditions per place. [2022-12-06 06:22:01,400 INFO L137 encePairwiseOnDemand]: 15/28 looper letters, 47 selfloop transitions, 14 changer transitions 0/61 dead transitions. [2022-12-06 06:22:01,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 61 transitions, 264 flow [2022-12-06 06:22:01,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:22:01,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:22:01,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-06 06:22:01,403 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-06 06:22:01,403 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 4 states and 63 transitions. [2022-12-06 06:22:01,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 61 transitions, 264 flow [2022-12-06 06:22:01,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 61 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:22:01,405 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 155 flow [2022-12-06 06:22:01,405 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2022-12-06 06:22:01,406 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -5 predicate places. [2022-12-06 06:22:01,406 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:01,406 INFO L89 Accepts]: Start accepts. Operand has 42 places, 40 transitions, 155 flow [2022-12-06 06:22:01,407 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:01,407 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:01,407 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 40 transitions, 155 flow [2022-12-06 06:22:01,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 40 transitions, 155 flow [2022-12-06 06:22:01,593 INFO L130 PetriNetUnfolder]: 1030/1608 cut-off events. [2022-12-06 06:22:01,593 INFO L131 PetriNetUnfolder]: For 182/182 co-relation queries the response was YES. [2022-12-06 06:22:01,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3607 conditions, 1608 events. 1030/1608 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 8471 event pairs, 598 based on Foata normal form. 0/1585 useless extension candidates. Maximal degree in co-relation 3598. Up to 1357 conditions per place. [2022-12-06 06:22:01,610 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 40 transitions, 155 flow [2022-12-06 06:22:01,611 INFO L188 LiptonReduction]: Number of co-enabled transitions 466 [2022-12-06 06:22:01,634 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:22:01,635 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 229 [2022-12-06 06:22:01,635 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 155 flow [2022-12-06 06:22:01,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:01,636 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:01,636 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:01,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:22:01,639 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:22:01,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:01,641 INFO L85 PathProgramCache]: Analyzing trace with hash 892996751, now seen corresponding path program 1 times [2022-12-06 06:22:01,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:01,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430163771] [2022-12-06 06:22:01,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:01,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:01,805 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 06:22:01,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:01,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430163771] [2022-12-06 06:22:01,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430163771] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:01,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:01,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:22:01,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931223455] [2022-12-06 06:22:01,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:01,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:22:01,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:01,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:22:01,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:22:01,807 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-06 06:22:01,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:01,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:01,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-06 06:22:01,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:02,638 INFO L130 PetriNetUnfolder]: 7027/9780 cut-off events. [2022-12-06 06:22:02,639 INFO L131 PetriNetUnfolder]: For 3901/4156 co-relation queries the response was YES. [2022-12-06 06:22:02,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26858 conditions, 9780 events. 7027/9780 cut-off events. For 3901/4156 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 50505 event pairs, 2279 based on Foata normal form. 276/9878 useless extension candidates. Maximal degree in co-relation 26846. Up to 5833 conditions per place. [2022-12-06 06:22:02,693 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 46 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2022-12-06 06:22:02,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 310 flow [2022-12-06 06:22:02,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:22:02,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:22:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-06 06:22:02,695 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-06 06:22:02,695 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 155 flow. Second operand 3 states and 48 transitions. [2022-12-06 06:22:02,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 310 flow [2022-12-06 06:22:02,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 56 transitions, 310 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:22:02,701 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 166 flow [2022-12-06 06:22:02,701 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2022-12-06 06:22:02,702 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2022-12-06 06:22:02,702 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:02,702 INFO L89 Accepts]: Start accepts. Operand has 45 places, 40 transitions, 166 flow [2022-12-06 06:22:02,704 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:02,704 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:02,704 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 40 transitions, 166 flow [2022-12-06 06:22:02,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 40 transitions, 166 flow [2022-12-06 06:22:02,813 INFO L130 PetriNetUnfolder]: 915/1422 cut-off events. [2022-12-06 06:22:02,813 INFO L131 PetriNetUnfolder]: For 334/334 co-relation queries the response was YES. [2022-12-06 06:22:02,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3409 conditions, 1422 events. 915/1422 cut-off events. For 334/334 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 7334 event pairs, 480 based on Foata normal form. 0/1396 useless extension candidates. Maximal degree in co-relation 3397. Up to 1195 conditions per place. [2022-12-06 06:22:02,824 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 40 transitions, 166 flow [2022-12-06 06:22:02,824 INFO L188 LiptonReduction]: Number of co-enabled transitions 464 [2022-12-06 06:22:02,831 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:22:02,832 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-06 06:22:02,832 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 166 flow [2022-12-06 06:22:02,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:02,832 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:02,833 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:02,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:22:02,833 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:22:02,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:02,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1918629794, now seen corresponding path program 1 times [2022-12-06 06:22:02,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:02,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90345228] [2022-12-06 06:22:02,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:02,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:03,085 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 06:22:03,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:03,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90345228] [2022-12-06 06:22:03,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90345228] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:03,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:03,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:22:03,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858036202] [2022-12-06 06:22:03,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:03,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:22:03,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:03,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:22:03,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:22:03,088 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-06 06:22:03,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:03,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:03,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-06 06:22:03,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:04,084 INFO L130 PetriNetUnfolder]: 8047/11437 cut-off events. [2022-12-06 06:22:04,085 INFO L131 PetriNetUnfolder]: For 6140/6249 co-relation queries the response was YES. [2022-12-06 06:22:04,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32542 conditions, 11437 events. 8047/11437 cut-off events. For 6140/6249 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 62376 event pairs, 2398 based on Foata normal form. 112/11063 useless extension candidates. Maximal degree in co-relation 32527. Up to 9009 conditions per place. [2022-12-06 06:22:04,154 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 51 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2022-12-06 06:22:04,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 63 transitions, 356 flow [2022-12-06 06:22:04,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:22:04,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:22:04,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-06 06:22:04,155 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2022-12-06 06:22:04,155 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 166 flow. Second operand 3 states and 54 transitions. [2022-12-06 06:22:04,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 63 transitions, 356 flow [2022-12-06 06:22:04,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 63 transitions, 344 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-06 06:22:04,173 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 186 flow [2022-12-06 06:22:04,173 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2022-12-06 06:22:04,173 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2022-12-06 06:22:04,174 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:04,174 INFO L89 Accepts]: Start accepts. Operand has 45 places, 43 transitions, 186 flow [2022-12-06 06:22:04,174 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:04,174 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:04,174 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 43 transitions, 186 flow [2022-12-06 06:22:04,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 43 transitions, 186 flow [2022-12-06 06:22:04,336 INFO L130 PetriNetUnfolder]: 1245/1934 cut-off events. [2022-12-06 06:22:04,337 INFO L131 PetriNetUnfolder]: For 487/487 co-relation queries the response was YES. [2022-12-06 06:22:04,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4682 conditions, 1934 events. 1245/1934 cut-off events. For 487/487 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 10212 event pairs, 623 based on Foata normal form. 0/1897 useless extension candidates. Maximal degree in co-relation 4670. Up to 1595 conditions per place. [2022-12-06 06:22:04,350 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 43 transitions, 186 flow [2022-12-06 06:22:04,350 INFO L188 LiptonReduction]: Number of co-enabled transitions 532 [2022-12-06 06:22:04,360 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:22:04,361 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 06:22:04,361 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 186 flow [2022-12-06 06:22:04,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:04,361 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:04,361 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:04,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:22:04,361 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:22:04,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:04,362 INFO L85 PathProgramCache]: Analyzing trace with hash -119435272, now seen corresponding path program 1 times [2022-12-06 06:22:04,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:04,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804500813] [2022-12-06 06:22:04,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:04,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:04,652 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 06:22:04,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:04,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804500813] [2022-12-06 06:22:04,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804500813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:04,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:04,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:22:04,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518584326] [2022-12-06 06:22:04,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:04,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:22:04,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:04,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:22:04,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:22:04,655 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-06 06:22:04,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 06:22:04,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:04,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-06 06:22:04,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:05,570 INFO L130 PetriNetUnfolder]: 8115/11567 cut-off events. [2022-12-06 06:22:05,571 INFO L131 PetriNetUnfolder]: For 6845/7046 co-relation queries the response was YES. [2022-12-06 06:22:05,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33755 conditions, 11567 events. 8115/11567 cut-off events. For 6845/7046 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 63743 event pairs, 1524 based on Foata normal form. 225/11366 useless extension candidates. Maximal degree in co-relation 33740. Up to 7926 conditions per place. [2022-12-06 06:22:05,628 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 66 selfloop transitions, 14 changer transitions 0/88 dead transitions. [2022-12-06 06:22:05,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 88 transitions, 515 flow [2022-12-06 06:22:05,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:22:05,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:22:05,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-06 06:22:05,630 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857 [2022-12-06 06:22:05,630 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 186 flow. Second operand 4 states and 74 transitions. [2022-12-06 06:22:05,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 88 transitions, 515 flow [2022-12-06 06:22:05,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 88 transitions, 511 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:22:05,636 INFO L231 Difference]: Finished difference. Result has 48 places, 51 transitions, 273 flow [2022-12-06 06:22:05,636 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=273, PETRI_PLACES=48, PETRI_TRANSITIONS=51} [2022-12-06 06:22:05,637 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 1 predicate places. [2022-12-06 06:22:05,637 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:05,637 INFO L89 Accepts]: Start accepts. Operand has 48 places, 51 transitions, 273 flow [2022-12-06 06:22:05,637 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:05,637 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:05,638 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 51 transitions, 273 flow [2022-12-06 06:22:05,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 51 transitions, 273 flow [2022-12-06 06:22:05,798 INFO L130 PetriNetUnfolder]: 1291/1974 cut-off events. [2022-12-06 06:22:05,798 INFO L131 PetriNetUnfolder]: For 1188/1246 co-relation queries the response was YES. [2022-12-06 06:22:05,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5762 conditions, 1974 events. 1291/1974 cut-off events. For 1188/1246 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 10327 event pairs, 511 based on Foata normal form. 58/1995 useless extension candidates. Maximal degree in co-relation 5748. Up to 1656 conditions per place. [2022-12-06 06:22:05,813 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 51 transitions, 273 flow [2022-12-06 06:22:05,814 INFO L188 LiptonReduction]: Number of co-enabled transitions 602 [2022-12-06 06:22:05,913 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [377] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [401] L827-->L834: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_147 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd4~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= 0 (mod v_~x$w_buff0_used~0_148 256))) .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff1_used~0_133 256) 0)) .cse3)) (.cse0 (and .cse2 .cse5))) (and (= v_~x$r_buff0_thd4~0_23 (ite .cse0 0 v_~x$r_buff0_thd4~0_24)) (= (ite .cse1 0 v_~x$w_buff0_used~0_148) v_~x$w_buff0_used~0_147) (= v_~x$r_buff1_thd4~0_21 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_132 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_22)) (= v_~x~0_99 (ite .cse1 v_~x$w_buff0~0_64 (ite .cse4 v_~x$w_buff1~0_63 v_~x~0_100))) (= v_~x$w_buff1_used~0_132 (ite (or .cse4 .cse0) 0 v_~x$w_buff1_used~0_133))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_63, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_100, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_22, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_148} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_63, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_99, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_21, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_147} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] [2022-12-06 06:22:05,975 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [377] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [393] L804-->L811: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_97 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_16 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_98 256) 0)) .cse5)) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_89 256) 0)) .cse0)) (.cse4 (and .cse1 .cse5))) (and (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_88 256) 0)) .cse0) (and .cse1 (not (= (mod v_~x$r_buff0_thd3~0_19 256) 0)))) 0 v_~x$r_buff1_thd3~0_16) v_~x$r_buff1_thd3~0_15) (= (ite .cse2 0 v_~x$w_buff0_used~0_98) v_~x$w_buff0_used~0_97) (= v_~x~0_61 (ite .cse2 v_~x$w_buff0~0_32 (ite .cse3 v_~x$w_buff1~0_33 v_~x~0_62))) (= v_~x$w_buff1_used~0_88 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_89)) (= v_~x$r_buff0_thd3~0_19 (ite .cse4 0 v_~x$r_buff0_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_33, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ~x~0=v_~x~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_33, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ~x~0=v_~x~0_61, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_97} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:22:06,099 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [377] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [393] L804-->L811: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_97 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_16 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_98 256) 0)) .cse5)) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_89 256) 0)) .cse0)) (.cse4 (and .cse1 .cse5))) (and (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_88 256) 0)) .cse0) (and .cse1 (not (= (mod v_~x$r_buff0_thd3~0_19 256) 0)))) 0 v_~x$r_buff1_thd3~0_16) v_~x$r_buff1_thd3~0_15) (= (ite .cse2 0 v_~x$w_buff0_used~0_98) v_~x$w_buff0_used~0_97) (= v_~x~0_61 (ite .cse2 v_~x$w_buff0~0_32 (ite .cse3 v_~x$w_buff1~0_33 v_~x~0_62))) (= v_~x$w_buff1_used~0_88 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_89)) (= v_~x$r_buff0_thd3~0_19 (ite .cse4 0 v_~x$r_buff0_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_33, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ~x~0=v_~x~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_33, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ~x~0=v_~x~0_61, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_97} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:22:06,155 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [377] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [518] $Ultimate##0-->L781: Formula: (and (= v_~x$r_buff0_thd2~0_98 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_19| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_19|) (= v_~x$r_buff1_thd3~0_67 v_~x$r_buff0_thd3~0_75) (= v_~x$r_buff0_thd0~0_253 v_~x$r_buff1_thd0~0_254) (= 2 v_~x$w_buff0~0_256) (= v_~x$w_buff0_used~0_398 v_~x$w_buff1_used~0_365) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_7| |v_P1Thread1of1ForFork2_~arg#1.offset_7|) (= v_~x$w_buff0~0_257 v_~x$w_buff1~0_238) (= v_~x$r_buff1_thd2~0_63 v_~x$r_buff0_thd2~0_99) (= |v_P1Thread1of1ForFork2_~arg#1.base_7| |v_P1Thread1of1ForFork2_#in~arg#1.base_7|) (= v_~x$w_buff0_used~0_397 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_19| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_397 256) 0)) (not (= (mod v_~x$w_buff1_used~0_365 256) 0)))) 1 0)) (= v_~x$r_buff1_thd4~0_69 v_~x$r_buff0_thd4~0_75) (= v_~x$r_buff1_thd1~0_69 v_~x$r_buff0_thd1~0_73) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_19| 0))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_257, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_253, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_75, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_75, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_99, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_398, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_256, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_253, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ~x$w_buff1~0=v_~x$w_buff1~0_238, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_63, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_365, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_69, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_75, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_75, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_98, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_254, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_397, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_19|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_19|, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_7|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork2_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork2_~arg#1.offset] [2022-12-06 06:22:06,259 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [377] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [401] L827-->L834: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_147 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd4~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= 0 (mod v_~x$w_buff0_used~0_148 256))) .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff1_used~0_133 256) 0)) .cse3)) (.cse0 (and .cse2 .cse5))) (and (= v_~x$r_buff0_thd4~0_23 (ite .cse0 0 v_~x$r_buff0_thd4~0_24)) (= (ite .cse1 0 v_~x$w_buff0_used~0_148) v_~x$w_buff0_used~0_147) (= v_~x$r_buff1_thd4~0_21 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_132 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_22)) (= v_~x~0_99 (ite .cse1 v_~x$w_buff0~0_64 (ite .cse4 v_~x$w_buff1~0_63 v_~x~0_100))) (= v_~x$w_buff1_used~0_132 (ite (or .cse4 .cse0) 0 v_~x$w_buff1_used~0_133))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_63, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_100, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_22, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_148} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_63, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_99, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_21, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_147} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] [2022-12-06 06:22:06,316 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [377] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [518] $Ultimate##0-->L781: Formula: (and (= v_~x$r_buff0_thd2~0_98 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_19| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_19|) (= v_~x$r_buff1_thd3~0_67 v_~x$r_buff0_thd3~0_75) (= v_~x$r_buff0_thd0~0_253 v_~x$r_buff1_thd0~0_254) (= 2 v_~x$w_buff0~0_256) (= v_~x$w_buff0_used~0_398 v_~x$w_buff1_used~0_365) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_7| |v_P1Thread1of1ForFork2_~arg#1.offset_7|) (= v_~x$w_buff0~0_257 v_~x$w_buff1~0_238) (= v_~x$r_buff1_thd2~0_63 v_~x$r_buff0_thd2~0_99) (= |v_P1Thread1of1ForFork2_~arg#1.base_7| |v_P1Thread1of1ForFork2_#in~arg#1.base_7|) (= v_~x$w_buff0_used~0_397 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_19| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_397 256) 0)) (not (= (mod v_~x$w_buff1_used~0_365 256) 0)))) 1 0)) (= v_~x$r_buff1_thd4~0_69 v_~x$r_buff0_thd4~0_75) (= v_~x$r_buff1_thd1~0_69 v_~x$r_buff0_thd1~0_73) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_19| 0))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_257, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_253, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_75, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_75, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_99, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_398, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_256, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_253, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ~x$w_buff1~0=v_~x$w_buff1~0_238, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_63, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_365, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_69, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_75, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_75, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_98, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_254, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_397, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_19|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_19|, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_7|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork2_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork2_~arg#1.offset] [2022-12-06 06:22:06,464 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:22:06,464 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 827 [2022-12-06 06:22:06,464 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 50 transitions, 298 flow [2022-12-06 06:22:06,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 06:22:06,465 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:06,465 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:06,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:22:06,465 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:22:06,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:06,465 INFO L85 PathProgramCache]: Analyzing trace with hash -651905242, now seen corresponding path program 1 times [2022-12-06 06:22:06,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:06,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128783668] [2022-12-06 06:22:06,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:06,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:06,845 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 06:22:06,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:06,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128783668] [2022-12-06 06:22:06,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128783668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:06,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:06,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:22:06,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77244679] [2022-12-06 06:22:06,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:06,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:22:06,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:06,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:22:06,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:22:06,848 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-06 06:22:06,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 50 transitions, 298 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:06,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:06,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-06 06:22:06,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:07,931 INFO L130 PetriNetUnfolder]: 8542/12098 cut-off events. [2022-12-06 06:22:07,931 INFO L131 PetriNetUnfolder]: For 16226/16267 co-relation queries the response was YES. [2022-12-06 06:22:07,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39353 conditions, 12098 events. 8542/12098 cut-off events. For 16226/16267 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 66525 event pairs, 1551 based on Foata normal form. 107/11586 useless extension candidates. Maximal degree in co-relation 39336. Up to 8952 conditions per place. [2022-12-06 06:22:07,987 INFO L137 encePairwiseOnDemand]: 21/36 looper letters, 65 selfloop transitions, 18 changer transitions 0/91 dead transitions. [2022-12-06 06:22:07,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 91 transitions, 623 flow [2022-12-06 06:22:07,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:22:07,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:22:07,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-12-06 06:22:07,988 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 06:22:07,988 INFO L175 Difference]: Start difference. First operand has 47 places, 50 transitions, 298 flow. Second operand 4 states and 80 transitions. [2022-12-06 06:22:07,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 91 transitions, 623 flow [2022-12-06 06:22:08,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 91 transitions, 558 flow, removed 29 selfloop flow, removed 2 redundant places. [2022-12-06 06:22:08,051 INFO L231 Difference]: Finished difference. Result has 49 places, 57 transitions, 341 flow [2022-12-06 06:22:08,051 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=341, PETRI_PLACES=49, PETRI_TRANSITIONS=57} [2022-12-06 06:22:08,053 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2022-12-06 06:22:08,053 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:08,053 INFO L89 Accepts]: Start accepts. Operand has 49 places, 57 transitions, 341 flow [2022-12-06 06:22:08,054 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:08,054 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:08,054 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 57 transitions, 341 flow [2022-12-06 06:22:08,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 57 transitions, 341 flow [2022-12-06 06:22:08,216 INFO L130 PetriNetUnfolder]: 1320/2034 cut-off events. [2022-12-06 06:22:08,216 INFO L131 PetriNetUnfolder]: For 1734/1734 co-relation queries the response was YES. [2022-12-06 06:22:08,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5934 conditions, 2034 events. 1320/2034 cut-off events. For 1734/1734 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 10730 event pairs, 483 based on Foata normal form. 0/1987 useless extension candidates. Maximal degree in co-relation 5919. Up to 1660 conditions per place. [2022-12-06 06:22:08,232 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 57 transitions, 341 flow [2022-12-06 06:22:08,232 INFO L188 LiptonReduction]: Number of co-enabled transitions 656 [2022-12-06 06:22:08,242 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:22:08,242 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 06:22:08,242 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 57 transitions, 341 flow [2022-12-06 06:22:08,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:08,243 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:08,243 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:08,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:22:08,243 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:22:08,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:08,243 INFO L85 PathProgramCache]: Analyzing trace with hash 706920050, now seen corresponding path program 1 times [2022-12-06 06:22:08,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:08,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394171127] [2022-12-06 06:22:08,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:08,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:08,615 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 06:22:08,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:08,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394171127] [2022-12-06 06:22:08,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394171127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:08,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:08,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:22:08,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723404540] [2022-12-06 06:22:08,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:08,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:22:08,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:08,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:22:08,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:22:08,618 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-06 06:22:08,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 57 transitions, 341 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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 06:22:08,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:08,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-06 06:22:08,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:09,699 INFO L130 PetriNetUnfolder]: 8247/11765 cut-off events. [2022-12-06 06:22:09,700 INFO L131 PetriNetUnfolder]: For 17258/17297 co-relation queries the response was YES. [2022-12-06 06:22:09,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38521 conditions, 11765 events. 8247/11765 cut-off events. For 17258/17297 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 64919 event pairs, 1480 based on Foata normal form. 89/11375 useless extension candidates. Maximal degree in co-relation 38503. Up to 8448 conditions per place. [2022-12-06 06:22:09,781 INFO L137 encePairwiseOnDemand]: 31/36 looper letters, 63 selfloop transitions, 7 changer transitions 0/78 dead transitions. [2022-12-06 06:22:09,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 78 transitions, 562 flow [2022-12-06 06:22:09,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:22:09,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:22:09,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-06 06:22:09,783 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 06:22:09,783 INFO L175 Difference]: Start difference. First operand has 49 places, 57 transitions, 341 flow. Second operand 3 states and 60 transitions. [2022-12-06 06:22:09,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 78 transitions, 562 flow [2022-12-06 06:22:09,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 78 transitions, 526 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-06 06:22:09,791 INFO L231 Difference]: Finished difference. Result has 49 places, 57 transitions, 328 flow [2022-12-06 06:22:09,791 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=49, PETRI_TRANSITIONS=57} [2022-12-06 06:22:09,792 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2022-12-06 06:22:09,792 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:09,792 INFO L89 Accepts]: Start accepts. Operand has 49 places, 57 transitions, 328 flow [2022-12-06 06:22:09,792 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:09,793 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:09,793 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 57 transitions, 328 flow [2022-12-06 06:22:09,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 57 transitions, 328 flow [2022-12-06 06:22:09,979 INFO L130 PetriNetUnfolder]: 1278/1974 cut-off events. [2022-12-06 06:22:09,979 INFO L131 PetriNetUnfolder]: For 1484/1484 co-relation queries the response was YES. [2022-12-06 06:22:09,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5824 conditions, 1974 events. 1278/1974 cut-off events. For 1484/1484 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 10429 event pairs, 465 based on Foata normal form. 0/1927 useless extension candidates. Maximal degree in co-relation 5809. Up to 1604 conditions per place. [2022-12-06 06:22:09,995 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 57 transitions, 328 flow [2022-12-06 06:22:09,996 INFO L188 LiptonReduction]: Number of co-enabled transitions 656 [2022-12-06 06:22:10,005 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:22:10,005 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 213 [2022-12-06 06:22:10,006 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 57 transitions, 328 flow [2022-12-06 06:22:10,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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 06:22:10,006 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:10,006 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:10,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:22:10,006 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:22:10,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:10,007 INFO L85 PathProgramCache]: Analyzing trace with hash -123131123, now seen corresponding path program 1 times [2022-12-06 06:22:10,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:10,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454094657] [2022-12-06 06:22:10,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:10,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:10,409 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 06:22:10,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:10,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454094657] [2022-12-06 06:22:10,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454094657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:10,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:10,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:22:10,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165924218] [2022-12-06 06:22:10,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:10,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:22:10,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:10,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:22:10,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:22:10,411 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-06 06:22:10,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 57 transitions, 328 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 06:22:10,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:10,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-06 06:22:10,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:11,487 INFO L130 PetriNetUnfolder]: 8944/12645 cut-off events. [2022-12-06 06:22:11,488 INFO L131 PetriNetUnfolder]: For 17403/17693 co-relation queries the response was YES. [2022-12-06 06:22:11,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42077 conditions, 12645 events. 8944/12645 cut-off events. For 17403/17693 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 69190 event pairs, 1613 based on Foata normal form. 112/12325 useless extension candidates. Maximal degree in co-relation 42059. Up to 9017 conditions per place. [2022-12-06 06:22:11,565 INFO L137 encePairwiseOnDemand]: 26/36 looper letters, 74 selfloop transitions, 17 changer transitions 0/99 dead transitions. [2022-12-06 06:22:11,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 99 transitions, 681 flow [2022-12-06 06:22:11,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:22:11,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:22:11,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-12-06 06:22:11,567 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-06 06:22:11,567 INFO L175 Difference]: Start difference. First operand has 49 places, 57 transitions, 328 flow. Second operand 4 states and 78 transitions. [2022-12-06 06:22:11,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 99 transitions, 681 flow [2022-12-06 06:22:11,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 99 transitions, 667 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:22:11,574 INFO L231 Difference]: Finished difference. Result has 51 places, 67 transitions, 439 flow [2022-12-06 06:22:11,574 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=439, PETRI_PLACES=51, PETRI_TRANSITIONS=67} [2022-12-06 06:22:11,574 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2022-12-06 06:22:11,575 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:11,575 INFO L89 Accepts]: Start accepts. Operand has 51 places, 67 transitions, 439 flow [2022-12-06 06:22:11,575 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:11,575 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:11,575 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 67 transitions, 439 flow [2022-12-06 06:22:11,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 67 transitions, 439 flow [2022-12-06 06:22:11,736 INFO L130 PetriNetUnfolder]: 1459/2209 cut-off events. [2022-12-06 06:22:11,736 INFO L131 PetriNetUnfolder]: For 2812/2858 co-relation queries the response was YES. [2022-12-06 06:22:11,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7765 conditions, 2209 events. 1459/2209 cut-off events. For 2812/2858 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 11491 event pairs, 453 based on Foata normal form. 1/2157 useless extension candidates. Maximal degree in co-relation 7749. Up to 1825 conditions per place. [2022-12-06 06:22:11,749 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 67 transitions, 439 flow [2022-12-06 06:22:11,750 INFO L188 LiptonReduction]: Number of co-enabled transitions 750 [2022-12-06 06:22:11,759 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:22:11,759 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 06:22:11,760 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 67 transitions, 439 flow [2022-12-06 06:22:11,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 06:22:11,760 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:11,760 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:11,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:22:11,760 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:22:11,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:11,760 INFO L85 PathProgramCache]: Analyzing trace with hash -115630673, now seen corresponding path program 2 times [2022-12-06 06:22:11,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:11,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464386703] [2022-12-06 06:22:11,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:11,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:12,158 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 06:22:12,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:12,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464386703] [2022-12-06 06:22:12,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464386703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:12,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:12,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:22:12,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020793855] [2022-12-06 06:22:12,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:12,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:22:12,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:12,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:22:12,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:22:12,160 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-06 06:22:12,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 67 transitions, 439 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 06:22:12,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:12,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-06 06:22:12,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:13,240 INFO L130 PetriNetUnfolder]: 9096/12793 cut-off events. [2022-12-06 06:22:13,241 INFO L131 PetriNetUnfolder]: For 27016/27317 co-relation queries the response was YES. [2022-12-06 06:22:13,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47860 conditions, 12793 events. 9096/12793 cut-off events. For 27016/27317 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 69195 event pairs, 1585 based on Foata normal form. 122/12409 useless extension candidates. Maximal degree in co-relation 47841. Up to 8684 conditions per place. [2022-12-06 06:22:13,327 INFO L137 encePairwiseOnDemand]: 21/36 looper letters, 92 selfloop transitions, 43 changer transitions 0/143 dead transitions. [2022-12-06 06:22:13,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 143 transitions, 1124 flow [2022-12-06 06:22:13,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:22:13,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:22:13,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2022-12-06 06:22:13,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-06 06:22:13,328 INFO L175 Difference]: Start difference. First operand has 51 places, 67 transitions, 439 flow. Second operand 5 states and 105 transitions. [2022-12-06 06:22:13,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 143 transitions, 1124 flow [2022-12-06 06:22:13,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 143 transitions, 1084 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 06:22:13,346 INFO L231 Difference]: Finished difference. Result has 55 places, 93 transitions, 790 flow [2022-12-06 06:22:13,346 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=790, PETRI_PLACES=55, PETRI_TRANSITIONS=93} [2022-12-06 06:22:13,347 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 8 predicate places. [2022-12-06 06:22:13,347 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:13,347 INFO L89 Accepts]: Start accepts. Operand has 55 places, 93 transitions, 790 flow [2022-12-06 06:22:13,347 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:13,348 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:13,348 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 93 transitions, 790 flow [2022-12-06 06:22:13,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 93 transitions, 790 flow [2022-12-06 06:22:13,526 INFO L130 PetriNetUnfolder]: 1444/2207 cut-off events. [2022-12-06 06:22:13,526 INFO L131 PetriNetUnfolder]: For 5078/5124 co-relation queries the response was YES. [2022-12-06 06:22:13,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9178 conditions, 2207 events. 1444/2207 cut-off events. For 5078/5124 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 11729 event pairs, 414 based on Foata normal form. 1/2155 useless extension candidates. Maximal degree in co-relation 9160. Up to 1813 conditions per place. [2022-12-06 06:22:13,545 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 93 transitions, 790 flow [2022-12-06 06:22:13,546 INFO L188 LiptonReduction]: Number of co-enabled transitions 930 [2022-12-06 06:22:13,563 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:22:13,564 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-06 06:22:13,564 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 93 transitions, 790 flow [2022-12-06 06:22:13,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 06:22:13,564 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:13,565 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:13,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:22:13,565 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:22:13,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:13,565 INFO L85 PathProgramCache]: Analyzing trace with hash 477896607, now seen corresponding path program 1 times [2022-12-06 06:22:13,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:13,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486121311] [2022-12-06 06:22:13,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:13,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:13,914 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 06:22:13,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:13,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486121311] [2022-12-06 06:22:13,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486121311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:13,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:13,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:22:13,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656589768] [2022-12-06 06:22:13,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:13,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:22:13,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:13,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:22:13,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:22:13,917 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-06 06:22:13,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 93 transitions, 790 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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 06:22:13,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:13,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-06 06:22:13,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:15,158 INFO L130 PetriNetUnfolder]: 10474/14732 cut-off events. [2022-12-06 06:22:15,158 INFO L131 PetriNetUnfolder]: For 52478/52816 co-relation queries the response was YES. [2022-12-06 06:22:15,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62146 conditions, 14732 events. 10474/14732 cut-off events. For 52478/52816 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 81527 event pairs, 2219 based on Foata normal form. 186/14306 useless extension candidates. Maximal degree in co-relation 62125. Up to 10005 conditions per place. [2022-12-06 06:22:15,266 INFO L137 encePairwiseOnDemand]: 24/36 looper letters, 107 selfloop transitions, 41 changer transitions 0/156 dead transitions. [2022-12-06 06:22:15,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 156 transitions, 1445 flow [2022-12-06 06:22:15,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:22:15,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:22:15,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2022-12-06 06:22:15,267 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 06:22:15,267 INFO L175 Difference]: Start difference. First operand has 55 places, 93 transitions, 790 flow. Second operand 5 states and 99 transitions. [2022-12-06 06:22:15,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 156 transitions, 1445 flow [2022-12-06 06:22:15,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 156 transitions, 1408 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 06:22:15,295 INFO L231 Difference]: Finished difference. Result has 60 places, 109 transitions, 1067 flow [2022-12-06 06:22:15,295 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1067, PETRI_PLACES=60, PETRI_TRANSITIONS=109} [2022-12-06 06:22:15,295 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 13 predicate places. [2022-12-06 06:22:15,295 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:15,296 INFO L89 Accepts]: Start accepts. Operand has 60 places, 109 transitions, 1067 flow [2022-12-06 06:22:15,296 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:15,296 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:15,296 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 109 transitions, 1067 flow [2022-12-06 06:22:15,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 109 transitions, 1067 flow [2022-12-06 06:22:15,555 INFO L130 PetriNetUnfolder]: 1644/2539 cut-off events. [2022-12-06 06:22:15,555 INFO L131 PetriNetUnfolder]: For 10605/10806 co-relation queries the response was YES. [2022-12-06 06:22:15,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11985 conditions, 2539 events. 1644/2539 cut-off events. For 10605/10806 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 13965 event pairs, 446 based on Foata normal form. 3/2486 useless extension candidates. Maximal degree in co-relation 11964. Up to 2075 conditions per place. [2022-12-06 06:22:15,576 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 109 transitions, 1067 flow [2022-12-06 06:22:15,576 INFO L188 LiptonReduction]: Number of co-enabled transitions 1086 [2022-12-06 06:22:16,480 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:22:16,481 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1186 [2022-12-06 06:22:16,481 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 111 transitions, 1109 flow [2022-12-06 06:22:16,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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 06:22:16,481 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:16,481 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:16,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:22:16,481 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:22:16,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:16,482 INFO L85 PathProgramCache]: Analyzing trace with hash 710386377, now seen corresponding path program 2 times [2022-12-06 06:22:16,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:16,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092166189] [2022-12-06 06:22:16,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:16,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:16,842 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 06:22:16,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:16,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092166189] [2022-12-06 06:22:16,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092166189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:16,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:16,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:22:16,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789970134] [2022-12-06 06:22:16,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:16,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:22:16,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:16,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:22:16,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:22:16,844 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2022-12-06 06:22:16,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 111 transitions, 1109 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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 06:22:16,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:16,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2022-12-06 06:22:16,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:18,387 INFO L130 PetriNetUnfolder]: 11822/16810 cut-off events. [2022-12-06 06:22:18,387 INFO L131 PetriNetUnfolder]: For 99407/99752 co-relation queries the response was YES. [2022-12-06 06:22:18,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79598 conditions, 16810 events. 11822/16810 cut-off events. For 99407/99752 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 97866 event pairs, 2447 based on Foata normal form. 189/16217 useless extension candidates. Maximal degree in co-relation 79574. Up to 10513 conditions per place. [2022-12-06 06:22:18,518 INFO L137 encePairwiseOnDemand]: 26/38 looper letters, 94 selfloop transitions, 63 changer transitions 2/167 dead transitions. [2022-12-06 06:22:18,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 167 transitions, 1733 flow [2022-12-06 06:22:18,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:22:18,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:22:18,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2022-12-06 06:22:18,519 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.531578947368421 [2022-12-06 06:22:18,519 INFO L175 Difference]: Start difference. First operand has 61 places, 111 transitions, 1109 flow. Second operand 5 states and 101 transitions. [2022-12-06 06:22:18,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 167 transitions, 1733 flow [2022-12-06 06:22:18,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 167 transitions, 1648 flow, removed 30 selfloop flow, removed 1 redundant places. [2022-12-06 06:22:18,646 INFO L231 Difference]: Finished difference. Result has 65 places, 115 transitions, 1270 flow [2022-12-06 06:22:18,647 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=982, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1270, PETRI_PLACES=65, PETRI_TRANSITIONS=115} [2022-12-06 06:22:18,647 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 18 predicate places. [2022-12-06 06:22:18,647 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:18,647 INFO L89 Accepts]: Start accepts. Operand has 65 places, 115 transitions, 1270 flow [2022-12-06 06:22:18,648 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:18,648 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:18,648 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 115 transitions, 1270 flow [2022-12-06 06:22:18,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 115 transitions, 1270 flow [2022-12-06 06:22:18,988 INFO L130 PetriNetUnfolder]: 1780/2770 cut-off events. [2022-12-06 06:22:18,988 INFO L131 PetriNetUnfolder]: For 15784/15976 co-relation queries the response was YES. [2022-12-06 06:22:18,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14267 conditions, 2770 events. 1780/2770 cut-off events. For 15784/15976 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 15796 event pairs, 527 based on Foata normal form. 1/2711 useless extension candidates. Maximal degree in co-relation 14244. Up to 2276 conditions per place. [2022-12-06 06:22:19,009 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 115 transitions, 1270 flow [2022-12-06 06:22:19,009 INFO L188 LiptonReduction]: Number of co-enabled transitions 1146 [2022-12-06 06:22:19,541 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:22:19,542 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 895 [2022-12-06 06:22:19,542 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 116 transitions, 1291 flow [2022-12-06 06:22:19,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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 06:22:19,542 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:19,542 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 06:22:19,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:22:19,542 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:22:19,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:19,543 INFO L85 PathProgramCache]: Analyzing trace with hash 532562572, now seen corresponding path program 1 times [2022-12-06 06:22:19,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:19,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689679765] [2022-12-06 06:22:19,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:19,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:19,896 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 06:22:19,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:19,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689679765] [2022-12-06 06:22:19,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689679765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:19,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:19,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:22:19,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142854146] [2022-12-06 06:22:19,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:19,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:22:19,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:19,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:22:19,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:22:19,899 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2022-12-06 06:22:19,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 116 transitions, 1291 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 06:22:19,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:19,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2022-12-06 06:22:19,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:21,575 INFO L130 PetriNetUnfolder]: 12666/17903 cut-off events. [2022-12-06 06:22:21,576 INFO L131 PetriNetUnfolder]: For 140697/141233 co-relation queries the response was YES. [2022-12-06 06:22:21,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90902 conditions, 17903 events. 12666/17903 cut-off events. For 140697/141233 co-relation queries the response was YES. Maximal size of possible extension queue 805. Compared 103705 event pairs, 6321 based on Foata normal form. 249/17420 useless extension candidates. Maximal degree in co-relation 90876. Up to 13384 conditions per place. [2022-12-06 06:22:21,717 INFO L137 encePairwiseOnDemand]: 30/37 looper letters, 111 selfloop transitions, 23 changer transitions 1/143 dead transitions. [2022-12-06 06:22:21,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 143 transitions, 1803 flow [2022-12-06 06:22:21,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:22:21,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:22:21,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-12-06 06:22:21,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43243243243243246 [2022-12-06 06:22:21,719 INFO L175 Difference]: Start difference. First operand has 65 places, 116 transitions, 1291 flow. Second operand 4 states and 64 transitions. [2022-12-06 06:22:21,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 143 transitions, 1803 flow [2022-12-06 06:22:21,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 143 transitions, 1684 flow, removed 19 selfloop flow, removed 3 redundant places. [2022-12-06 06:22:21,795 INFO L231 Difference]: Finished difference. Result has 66 places, 126 transitions, 1422 flow [2022-12-06 06:22:21,795 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1171, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1422, PETRI_PLACES=66, PETRI_TRANSITIONS=126} [2022-12-06 06:22:21,796 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 19 predicate places. [2022-12-06 06:22:21,796 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:21,796 INFO L89 Accepts]: Start accepts. Operand has 66 places, 126 transitions, 1422 flow [2022-12-06 06:22:21,797 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:21,797 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:21,797 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 126 transitions, 1422 flow [2022-12-06 06:22:21,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 126 transitions, 1422 flow [2022-12-06 06:22:22,167 INFO L130 PetriNetUnfolder]: 1971/3061 cut-off events. [2022-12-06 06:22:22,167 INFO L131 PetriNetUnfolder]: For 18373/18605 co-relation queries the response was YES. [2022-12-06 06:22:22,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15415 conditions, 3061 events. 1971/3061 cut-off events. For 18373/18605 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 17667 event pairs, 607 based on Foata normal form. 0/2992 useless extension candidates. Maximal degree in co-relation 15391. Up to 2521 conditions per place. [2022-12-06 06:22:22,194 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 126 transitions, 1422 flow [2022-12-06 06:22:22,195 INFO L188 LiptonReduction]: Number of co-enabled transitions 1218 [2022-12-06 06:22:22,227 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:22:22,228 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 432 [2022-12-06 06:22:22,228 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 126 transitions, 1422 flow [2022-12-06 06:22:22,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 06:22:22,228 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:22,228 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 06:22:22,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:22:22,228 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:22:22,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:22,228 INFO L85 PathProgramCache]: Analyzing trace with hash -125800027, now seen corresponding path program 1 times [2022-12-06 06:22:22,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:22,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916440400] [2022-12-06 06:22:22,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:22,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:22,316 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 06:22:22,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:22,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916440400] [2022-12-06 06:22:22,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916440400] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:22,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:22,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:22:22,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562479645] [2022-12-06 06:22:22,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:22,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:22:22,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:22,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:22:22,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:22:22,318 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 36 [2022-12-06 06:22:22,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 126 transitions, 1422 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:22,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:22,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 36 [2022-12-06 06:22:22,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:23,442 INFO L130 PetriNetUnfolder]: 7876/11202 cut-off events. [2022-12-06 06:22:23,443 INFO L131 PetriNetUnfolder]: For 96205/97264 co-relation queries the response was YES. [2022-12-06 06:22:23,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58001 conditions, 11202 events. 7876/11202 cut-off events. For 96205/97264 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 62942 event pairs, 1658 based on Foata normal form. 509/10928 useless extension candidates. Maximal degree in co-relation 57974. Up to 8166 conditions per place. [2022-12-06 06:22:23,540 INFO L137 encePairwiseOnDemand]: 30/36 looper letters, 183 selfloop transitions, 5 changer transitions 0/198 dead transitions. [2022-12-06 06:22:23,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 198 transitions, 2607 flow [2022-12-06 06:22:23,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:22:23,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:22:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-06 06:22:23,542 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-06 06:22:23,542 INFO L175 Difference]: Start difference. First operand has 65 places, 126 transitions, 1422 flow. Second operand 3 states and 72 transitions. [2022-12-06 06:22:23,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 198 transitions, 2607 flow [2022-12-06 06:22:23,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 198 transitions, 2513 flow, removed 29 selfloop flow, removed 2 redundant places. [2022-12-06 06:22:23,603 INFO L231 Difference]: Finished difference. Result has 66 places, 129 transitions, 1378 flow [2022-12-06 06:22:23,603 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1345, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1378, PETRI_PLACES=66, PETRI_TRANSITIONS=129} [2022-12-06 06:22:23,604 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 19 predicate places. [2022-12-06 06:22:23,604 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:23,604 INFO L89 Accepts]: Start accepts. Operand has 66 places, 129 transitions, 1378 flow [2022-12-06 06:22:23,605 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:23,605 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:23,605 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 129 transitions, 1378 flow [2022-12-06 06:22:23,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 129 transitions, 1378 flow [2022-12-06 06:22:24,082 INFO L130 PetriNetUnfolder]: 2447/4004 cut-off events. [2022-12-06 06:22:24,082 INFO L131 PetriNetUnfolder]: For 19141/19643 co-relation queries the response was YES. [2022-12-06 06:22:24,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18418 conditions, 4004 events. 2447/4004 cut-off events. For 19141/19643 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 26600 event pairs, 854 based on Foata normal form. 13/3697 useless extension candidates. Maximal degree in co-relation 18393. Up to 2816 conditions per place. [2022-12-06 06:22:24,116 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 129 transitions, 1378 flow [2022-12-06 06:22:24,116 INFO L188 LiptonReduction]: Number of co-enabled transitions 1374 [2022-12-06 06:22:24,126 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:22:24,126 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 522 [2022-12-06 06:22:24,126 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 129 transitions, 1378 flow [2022-12-06 06:22:24,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:24,127 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:24,127 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 06:22:24,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:22:24,127 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:22:24,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:24,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1032371571, now seen corresponding path program 2 times [2022-12-06 06:22:24,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:24,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557046231] [2022-12-06 06:22:24,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:24,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:24,221 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 06:22:24,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:24,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557046231] [2022-12-06 06:22:24,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557046231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:24,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:24,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:22:24,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690765638] [2022-12-06 06:22:24,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:24,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:22:24,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:24,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:22:24,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:22:24,222 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 36 [2022-12-06 06:22:24,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 129 transitions, 1378 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 06:22:24,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:24,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 36 [2022-12-06 06:22:24,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:24,869 INFO L130 PetriNetUnfolder]: 4219/6288 cut-off events. [2022-12-06 06:22:24,869 INFO L131 PetriNetUnfolder]: For 51483/51929 co-relation queries the response was YES. [2022-12-06 06:22:24,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33252 conditions, 6288 events. 4219/6288 cut-off events. For 51483/51929 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 34266 event pairs, 778 based on Foata normal form. 491/6500 useless extension candidates. Maximal degree in co-relation 33224. Up to 3747 conditions per place. [2022-12-06 06:22:24,908 INFO L137 encePairwiseOnDemand]: 30/36 looper letters, 223 selfloop transitions, 9 changer transitions 0/242 dead transitions. [2022-12-06 06:22:24,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 242 transitions, 3082 flow [2022-12-06 06:22:24,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:22:24,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:22:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-12-06 06:22:24,909 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6597222222222222 [2022-12-06 06:22:24,909 INFO L175 Difference]: Start difference. First operand has 66 places, 129 transitions, 1378 flow. Second operand 4 states and 95 transitions. [2022-12-06 06:22:24,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 242 transitions, 3082 flow [2022-12-06 06:22:24,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 242 transitions, 3077 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:22:24,944 INFO L231 Difference]: Finished difference. Result has 69 places, 128 transitions, 1358 flow [2022-12-06 06:22:24,944 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1306, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1358, PETRI_PLACES=69, PETRI_TRANSITIONS=128} [2022-12-06 06:22:24,944 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 22 predicate places. [2022-12-06 06:22:24,944 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:24,944 INFO L89 Accepts]: Start accepts. Operand has 69 places, 128 transitions, 1358 flow [2022-12-06 06:22:24,945 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:24,945 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:24,945 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 128 transitions, 1358 flow [2022-12-06 06:22:24,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 128 transitions, 1358 flow [2022-12-06 06:22:25,117 INFO L130 PetriNetUnfolder]: 1147/2049 cut-off events. [2022-12-06 06:22:25,118 INFO L131 PetriNetUnfolder]: For 10005/10429 co-relation queries the response was YES. [2022-12-06 06:22:25,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9748 conditions, 2049 events. 1147/2049 cut-off events. For 10005/10429 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 12543 event pairs, 312 based on Foata normal form. 64/1988 useless extension candidates. Maximal degree in co-relation 9721. Up to 1367 conditions per place. [2022-12-06 06:22:25,136 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 128 transitions, 1358 flow [2022-12-06 06:22:25,136 INFO L188 LiptonReduction]: Number of co-enabled transitions 1422 [2022-12-06 06:22:25,255 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:22:25,256 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 312 [2022-12-06 06:22:25,256 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 128 transitions, 1362 flow [2022-12-06 06:22:25,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 06:22:25,256 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:25,256 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] [2022-12-06 06:22:25,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:22:25,256 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:22:25,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:25,257 INFO L85 PathProgramCache]: Analyzing trace with hash -209281603, now seen corresponding path program 1 times [2022-12-06 06:22:25,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:25,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701892920] [2022-12-06 06:22:25,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:25,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:25,381 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 06:22:25,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:25,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701892920] [2022-12-06 06:22:25,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701892920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:25,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:25,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:22:25,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52406104] [2022-12-06 06:22:25,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:25,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:22:25,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:25,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:22:25,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:22:25,383 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 37 [2022-12-06 06:22:25,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 128 transitions, 1362 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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 06:22:25,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:25,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 37 [2022-12-06 06:22:25,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:26,034 INFO L130 PetriNetUnfolder]: 3396/5044 cut-off events. [2022-12-06 06:22:26,034 INFO L131 PetriNetUnfolder]: For 44200/44533 co-relation queries the response was YES. [2022-12-06 06:22:26,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27420 conditions, 5044 events. 3396/5044 cut-off events. For 44200/44533 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 26898 event pairs, 629 based on Foata normal form. 245/5088 useless extension candidates. Maximal degree in co-relation 27390. Up to 2978 conditions per place. [2022-12-06 06:22:26,060 INFO L137 encePairwiseOnDemand]: 30/37 looper letters, 235 selfloop transitions, 13 changer transitions 0/258 dead transitions. [2022-12-06 06:22:26,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 258 transitions, 3291 flow [2022-12-06 06:22:26,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:22:26,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:22:26,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2022-12-06 06:22:26,062 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6216216216216216 [2022-12-06 06:22:26,062 INFO L175 Difference]: Start difference. First operand has 69 places, 128 transitions, 1362 flow. Second operand 5 states and 115 transitions. [2022-12-06 06:22:26,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 258 transitions, 3291 flow [2022-12-06 06:22:26,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 258 transitions, 3273 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 06:22:26,089 INFO L231 Difference]: Finished difference. Result has 72 places, 130 transitions, 1388 flow [2022-12-06 06:22:26,089 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1320, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1388, PETRI_PLACES=72, PETRI_TRANSITIONS=130} [2022-12-06 06:22:26,089 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 25 predicate places. [2022-12-06 06:22:26,089 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:26,090 INFO L89 Accepts]: Start accepts. Operand has 72 places, 130 transitions, 1388 flow [2022-12-06 06:22:26,091 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:26,091 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:26,091 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 130 transitions, 1388 flow [2022-12-06 06:22:26,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 130 transitions, 1388 flow [2022-12-06 06:22:26,194 INFO L130 PetriNetUnfolder]: 806/1433 cut-off events. [2022-12-06 06:22:26,194 INFO L131 PetriNetUnfolder]: For 7567/7750 co-relation queries the response was YES. [2022-12-06 06:22:26,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6806 conditions, 1433 events. 806/1433 cut-off events. For 7567/7750 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 8057 event pairs, 168 based on Foata normal form. 67/1428 useless extension candidates. Maximal degree in co-relation 6778. Up to 938 conditions per place. [2022-12-06 06:22:26,206 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 130 transitions, 1388 flow [2022-12-06 06:22:26,206 INFO L188 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-06 06:22:28,007 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:22:28,007 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1918 [2022-12-06 06:22:28,007 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 130 transitions, 1446 flow [2022-12-06 06:22:28,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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 06:22:28,008 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:28,008 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, 1] [2022-12-06 06:22:28,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 06:22:28,008 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:22:28,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:28,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1701806, now seen corresponding path program 1 times [2022-12-06 06:22:28,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:28,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994759928] [2022-12-06 06:22:28,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:28,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:28,291 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 06:22:28,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:28,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994759928] [2022-12-06 06:22:28,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994759928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:28,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:28,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:22:28,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389420560] [2022-12-06 06:22:28,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:28,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:22:28,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:28,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:22:28,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:22:28,293 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 06:22:28,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 130 transitions, 1446 flow. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:28,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:28,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 06:22:28,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:29,349 INFO L130 PetriNetUnfolder]: 6113/8913 cut-off events. [2022-12-06 06:22:29,350 INFO L131 PetriNetUnfolder]: For 52885/52885 co-relation queries the response was YES. [2022-12-06 06:22:29,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45785 conditions, 8913 events. 6113/8913 cut-off events. For 52885/52885 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 47350 event pairs, 1156 based on Foata normal form. 14/8927 useless extension candidates. Maximal degree in co-relation 45754. Up to 5234 conditions per place. [2022-12-06 06:22:29,393 INFO L137 encePairwiseOnDemand]: 19/39 looper letters, 146 selfloop transitions, 75 changer transitions 108/329 dead transitions. [2022-12-06 06:22:29,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 329 transitions, 4044 flow [2022-12-06 06:22:29,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:22:29,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:22:29,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2022-12-06 06:22:29,395 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5341880341880342 [2022-12-06 06:22:29,395 INFO L175 Difference]: Start difference. First operand has 72 places, 130 transitions, 1446 flow. Second operand 6 states and 125 transitions. [2022-12-06 06:22:29,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 329 transitions, 4044 flow [2022-12-06 06:22:29,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 329 transitions, 3924 flow, removed 28 selfloop flow, removed 3 redundant places. [2022-12-06 06:22:29,499 INFO L231 Difference]: Finished difference. Result has 79 places, 154 transitions, 1943 flow [2022-12-06 06:22:29,499 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1357, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1943, PETRI_PLACES=79, PETRI_TRANSITIONS=154} [2022-12-06 06:22:29,499 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 32 predicate places. [2022-12-06 06:22:29,499 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:29,499 INFO L89 Accepts]: Start accepts. Operand has 79 places, 154 transitions, 1943 flow [2022-12-06 06:22:29,500 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:29,500 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:29,500 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 154 transitions, 1943 flow [2022-12-06 06:22:29,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 154 transitions, 1943 flow [2022-12-06 06:22:29,685 INFO L130 PetriNetUnfolder]: 1240/2312 cut-off events. [2022-12-06 06:22:29,685 INFO L131 PetriNetUnfolder]: For 12619/12916 co-relation queries the response was YES. [2022-12-06 06:22:29,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11403 conditions, 2312 events. 1240/2312 cut-off events. For 12619/12916 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 15179 event pairs, 202 based on Foata normal form. 143/2387 useless extension candidates. Maximal degree in co-relation 11370. Up to 1406 conditions per place. [2022-12-06 06:22:29,709 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 154 transitions, 1943 flow [2022-12-06 06:22:29,709 INFO L188 LiptonReduction]: Number of co-enabled transitions 1382 [2022-12-06 06:22:29,712 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:22:29,713 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-06 06:22:29,713 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 154 transitions, 1943 flow [2022-12-06 06:22:29,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:29,713 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:29,713 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, 1] [2022-12-06 06:22:29,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 06:22:29,713 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:22:29,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:29,713 INFO L85 PathProgramCache]: Analyzing trace with hash -763459344, now seen corresponding path program 1 times [2022-12-06 06:22:29,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:29,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299449248] [2022-12-06 06:22:29,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:29,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:29,842 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 06:22:29,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:29,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299449248] [2022-12-06 06:22:29,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299449248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:29,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:29,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:22:29,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492103561] [2022-12-06 06:22:29,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:29,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:22:29,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:29,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:22:29,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:22:29,844 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2022-12-06 06:22:29,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 154 transitions, 1943 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:29,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:29,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2022-12-06 06:22:29,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:30,809 INFO L130 PetriNetUnfolder]: 6471/9992 cut-off events. [2022-12-06 06:22:30,810 INFO L131 PetriNetUnfolder]: For 74669/74947 co-relation queries the response was YES. [2022-12-06 06:22:30,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55501 conditions, 9992 events. 6471/9992 cut-off events. For 74669/74947 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 61799 event pairs, 1654 based on Foata normal form. 14/9744 useless extension candidates. Maximal degree in co-relation 55465. Up to 5833 conditions per place. [2022-12-06 06:22:30,968 INFO L137 encePairwiseOnDemand]: 33/37 looper letters, 155 selfloop transitions, 8 changer transitions 50/220 dead transitions. [2022-12-06 06:22:30,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 220 transitions, 3023 flow [2022-12-06 06:22:30,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:22:30,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:22:30,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-06 06:22:30,974 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5765765765765766 [2022-12-06 06:22:30,975 INFO L175 Difference]: Start difference. First operand has 79 places, 154 transitions, 1943 flow. Second operand 3 states and 64 transitions. [2022-12-06 06:22:30,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 220 transitions, 3023 flow [2022-12-06 06:22:31,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 220 transitions, 3001 flow, removed 11 selfloop flow, removed 0 redundant places. [2022-12-06 06:22:31,121 INFO L231 Difference]: Finished difference. Result has 82 places, 126 transitions, 1474 flow [2022-12-06 06:22:31,121 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1888, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=82, PETRI_TRANSITIONS=126} [2022-12-06 06:22:31,121 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 35 predicate places. [2022-12-06 06:22:31,121 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:31,121 INFO L89 Accepts]: Start accepts. Operand has 82 places, 126 transitions, 1474 flow [2022-12-06 06:22:31,122 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:31,122 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:31,122 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 126 transitions, 1474 flow [2022-12-06 06:22:31,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 126 transitions, 1474 flow [2022-12-06 06:22:31,380 INFO L130 PetriNetUnfolder]: 1786/3447 cut-off events. [2022-12-06 06:22:31,381 INFO L131 PetriNetUnfolder]: For 18064/18515 co-relation queries the response was YES. [2022-12-06 06:22:31,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16281 conditions, 3447 events. 1786/3447 cut-off events. For 18064/18515 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 25392 event pairs, 327 based on Foata normal form. 189/3513 useless extension candidates. Maximal degree in co-relation 16246. Up to 2042 conditions per place. [2022-12-06 06:22:31,416 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 126 transitions, 1474 flow [2022-12-06 06:22:31,417 INFO L188 LiptonReduction]: Number of co-enabled transitions 1318 [2022-12-06 06:22:31,420 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:22:31,420 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 299 [2022-12-06 06:22:31,420 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 126 transitions, 1474 flow [2022-12-06 06:22:31,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:31,420 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:31,421 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, 1] [2022-12-06 06:22:31,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 06:22:31,421 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:22:31,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:31,421 INFO L85 PathProgramCache]: Analyzing trace with hash -951036310, now seen corresponding path program 2 times [2022-12-06 06:22:31,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:31,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444300285] [2022-12-06 06:22:31,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:31,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:31,553 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 06:22:31,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:31,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444300285] [2022-12-06 06:22:31,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444300285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:31,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:31,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:22:31,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967946099] [2022-12-06 06:22:31,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:31,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:22:31,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:31,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:22:31,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:22:31,555 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 35 [2022-12-06 06:22:31,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 126 transitions, 1474 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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 06:22:31,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:31,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 35 [2022-12-06 06:22:31,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:32,465 INFO L130 PetriNetUnfolder]: 5793/8796 cut-off events. [2022-12-06 06:22:32,465 INFO L131 PetriNetUnfolder]: For 83201/83670 co-relation queries the response was YES. [2022-12-06 06:22:32,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50526 conditions, 8796 events. 5793/8796 cut-off events. For 83201/83670 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 54567 event pairs, 741 based on Foata normal form. 144/8631 useless extension candidates. Maximal degree in co-relation 50488. Up to 5167 conditions per place. [2022-12-06 06:22:32,506 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 141 selfloop transitions, 17 changer transitions 75/241 dead transitions. [2022-12-06 06:22:32,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 241 transitions, 3290 flow [2022-12-06 06:22:32,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:22:32,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:22:32,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2022-12-06 06:22:32,508 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-06 06:22:32,508 INFO L175 Difference]: Start difference. First operand has 82 places, 126 transitions, 1474 flow. Second operand 6 states and 115 transitions. [2022-12-06 06:22:32,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 241 transitions, 3290 flow [2022-12-06 06:22:32,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 241 transitions, 3190 flow, removed 28 selfloop flow, removed 3 redundant places. [2022-12-06 06:22:32,769 INFO L231 Difference]: Finished difference. Result has 85 places, 89 transitions, 907 flow [2022-12-06 06:22:32,769 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1412, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=907, PETRI_PLACES=85, PETRI_TRANSITIONS=89} [2022-12-06 06:22:32,769 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 38 predicate places. [2022-12-06 06:22:32,769 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:32,769 INFO L89 Accepts]: Start accepts. Operand has 85 places, 89 transitions, 907 flow [2022-12-06 06:22:32,770 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:32,770 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:32,770 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 89 transitions, 907 flow [2022-12-06 06:22:32,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 89 transitions, 907 flow [2022-12-06 06:22:32,828 INFO L130 PetriNetUnfolder]: 394/813 cut-off events. [2022-12-06 06:22:32,828 INFO L131 PetriNetUnfolder]: For 3590/3640 co-relation queries the response was YES. [2022-12-06 06:22:32,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3706 conditions, 813 events. 394/813 cut-off events. For 3590/3640 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4720 event pairs, 75 based on Foata normal form. 1/782 useless extension candidates. Maximal degree in co-relation 3680. Up to 452 conditions per place. [2022-12-06 06:22:32,834 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 89 transitions, 907 flow [2022-12-06 06:22:32,834 INFO L188 LiptonReduction]: Number of co-enabled transitions 742 [2022-12-06 06:22:34,600 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 06:22:34,601 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1832 [2022-12-06 06:22:34,601 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 86 transitions, 941 flow [2022-12-06 06:22:34,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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 06:22:34,601 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:34,601 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, 1] [2022-12-06 06:22:34,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 06:22:34,602 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:22:34,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:34,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1015114228, now seen corresponding path program 1 times [2022-12-06 06:22:34,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:34,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791392606] [2022-12-06 06:22:34,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:34,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:34,712 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 06:22:34,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:34,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791392606] [2022-12-06 06:22:34,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791392606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:34,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:34,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:22:34,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139880531] [2022-12-06 06:22:34,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:34,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:22:34,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:34,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:22:34,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:22:34,714 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 36 [2022-12-06 06:22:34,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 86 transitions, 941 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:34,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:34,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 36 [2022-12-06 06:22:34,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:35,093 INFO L130 PetriNetUnfolder]: 2366/3647 cut-off events. [2022-12-06 06:22:35,094 INFO L131 PetriNetUnfolder]: For 25100/25109 co-relation queries the response was YES. [2022-12-06 06:22:35,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19952 conditions, 3647 events. 2366/3647 cut-off events. For 25100/25109 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 19192 event pairs, 422 based on Foata normal form. 4/3638 useless extension candidates. Maximal degree in co-relation 19920. Up to 1864 conditions per place. [2022-12-06 06:22:35,110 INFO L137 encePairwiseOnDemand]: 33/36 looper letters, 49 selfloop transitions, 1 changer transitions 96/149 dead transitions. [2022-12-06 06:22:35,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 149 transitions, 1876 flow [2022-12-06 06:22:35,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:22:35,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:22:35,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-06 06:22:35,112 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2022-12-06 06:22:35,112 INFO L175 Difference]: Start difference. First operand has 80 places, 86 transitions, 941 flow. Second operand 4 states and 70 transitions. [2022-12-06 06:22:35,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 149 transitions, 1876 flow [2022-12-06 06:22:35,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 149 transitions, 1705 flow, removed 55 selfloop flow, removed 7 redundant places. [2022-12-06 06:22:35,167 INFO L231 Difference]: Finished difference. Result has 78 places, 49 transitions, 396 flow [2022-12-06 06:22:35,167 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=396, PETRI_PLACES=78, PETRI_TRANSITIONS=49} [2022-12-06 06:22:35,168 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 31 predicate places. [2022-12-06 06:22:35,168 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:35,168 INFO L89 Accepts]: Start accepts. Operand has 78 places, 49 transitions, 396 flow [2022-12-06 06:22:35,168 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:35,168 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:35,169 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 49 transitions, 396 flow [2022-12-06 06:22:35,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 49 transitions, 396 flow [2022-12-06 06:22:35,196 INFO L130 PetriNetUnfolder]: 164/373 cut-off events. [2022-12-06 06:22:35,196 INFO L131 PetriNetUnfolder]: For 1286/1324 co-relation queries the response was YES. [2022-12-06 06:22:35,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1514 conditions, 373 events. 164/373 cut-off events. For 1286/1324 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1854 event pairs, 20 based on Foata normal form. 8/368 useless extension candidates. Maximal degree in co-relation 1485. Up to 165 conditions per place. [2022-12-06 06:22:35,199 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 49 transitions, 396 flow [2022-12-06 06:22:35,199 INFO L188 LiptonReduction]: Number of co-enabled transitions 322 [2022-12-06 06:22:35,269 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L801-->L804: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [386] L784-->L791: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_123 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_33 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_124 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_111 256) 0))))) (and (= v_~x~0_77 (ite .cse0 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_47 v_~x~0_78))) (= (ite .cse0 0 v_~x$w_buff0_used~0_124) v_~x$w_buff0_used~0_123) (= v_~x$r_buff0_thd2~0_32 (ite .cse2 0 v_~x$r_buff0_thd2~0_33)) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_110 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd2~0_32 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_18) v_~x$r_buff1_thd2~0_17) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_111) v_~x$w_buff1_used~0_110)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_111, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_33, ~x~0=v_~x~0_78, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_124} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_110, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_32, ~x~0=v_~x~0_77, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:22:35,322 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L801-->L804: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [462] $Ultimate##0-->L821: Formula: (and (= |v_P3Thread1of1ForFork1_#in~arg.offset_5| v_P3Thread1of1ForFork1_~arg.offset_5) (= v_~z~0_53 2) (= v_P3Thread1of1ForFork1_~arg.base_5 |v_P3Thread1of1ForFork1_#in~arg.base_5|)) InVars {P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_5|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_5|} OutVars{P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_5|, ~z~0=v_~z~0_53, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_5, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_5|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~z~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] [2022-12-06 06:22:35,743 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L754: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_25 |v_P0Thread1of1ForFork0_#in~arg.offset_25|) (= v_~x~0_546 1) (= v_P0Thread1of1ForFork0_~arg.base_25 |v_P0Thread1of1ForFork0_#in~arg.base_25|) (= v_~a~0_41 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_25|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_25|} OutVars{~a~0=v_~a~0_41, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_25|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_25|, ~x~0=v_~x~0_546, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_25, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_25} AuxVars[] AssignedVars[~a~0, ~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] and [518] $Ultimate##0-->L781: Formula: (and (= v_~x$r_buff0_thd2~0_98 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_19| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_19|) (= v_~x$r_buff1_thd3~0_67 v_~x$r_buff0_thd3~0_75) (= v_~x$r_buff0_thd0~0_253 v_~x$r_buff1_thd0~0_254) (= 2 v_~x$w_buff0~0_256) (= v_~x$w_buff0_used~0_398 v_~x$w_buff1_used~0_365) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_7| |v_P1Thread1of1ForFork2_~arg#1.offset_7|) (= v_~x$w_buff0~0_257 v_~x$w_buff1~0_238) (= v_~x$r_buff1_thd2~0_63 v_~x$r_buff0_thd2~0_99) (= |v_P1Thread1of1ForFork2_~arg#1.base_7| |v_P1Thread1of1ForFork2_#in~arg#1.base_7|) (= v_~x$w_buff0_used~0_397 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_19| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_397 256) 0)) (not (= (mod v_~x$w_buff1_used~0_365 256) 0)))) 1 0)) (= v_~x$r_buff1_thd4~0_69 v_~x$r_buff0_thd4~0_75) (= v_~x$r_buff1_thd1~0_69 v_~x$r_buff0_thd1~0_73) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_19| 0))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_257, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_253, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_75, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_75, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_99, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_398, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_256, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_253, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ~x$w_buff1~0=v_~x$w_buff1~0_238, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_63, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_365, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_69, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_75, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_75, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_98, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_254, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_397, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_19|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_19|, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_7|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork2_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork2_~arg#1.offset] [2022-12-06 06:22:35,858 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:22:35,859 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 691 [2022-12-06 06:22:35,859 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 48 transitions, 428 flow [2022-12-06 06:22:35,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:22:35,859 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:35,859 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 06:22:35,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 06:22:35,859 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:22:35,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:35,859 INFO L85 PathProgramCache]: Analyzing trace with hash -631073445, now seen corresponding path program 1 times [2022-12-06 06:22:35,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:35,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784669516] [2022-12-06 06:22:35,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:35,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:22:36,603 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 06:22:36,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:22:36,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784669516] [2022-12-06 06:22:36,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784669516] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:22:36,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:22:36,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:22:36,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808881275] [2022-12-06 06:22:36,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:22:36,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:22:36,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:22:36,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:22:36,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:22:36,604 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-06 06:22:36,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 48 transitions, 428 flow. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 06:22:36,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:22:36,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-06 06:22:36,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:22:36,972 INFO L130 PetriNetUnfolder]: 1033/1752 cut-off events. [2022-12-06 06:22:36,972 INFO L131 PetriNetUnfolder]: For 7927/7947 co-relation queries the response was YES. [2022-12-06 06:22:36,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8459 conditions, 1752 events. 1033/1752 cut-off events. For 7927/7947 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9212 event pairs, 95 based on Foata normal form. 12/1745 useless extension candidates. Maximal degree in co-relation 8428. Up to 852 conditions per place. [2022-12-06 06:22:36,980 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 67 selfloop transitions, 17 changer transitions 14/101 dead transitions. [2022-12-06 06:22:36,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 101 transitions, 921 flow [2022-12-06 06:22:36,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:22:36,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:22:36,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-12-06 06:22:36,981 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2022-12-06 06:22:36,981 INFO L175 Difference]: Start difference. First operand has 70 places, 48 transitions, 428 flow. Second operand 6 states and 76 transitions. [2022-12-06 06:22:36,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 101 transitions, 921 flow [2022-12-06 06:22:37,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 101 transitions, 810 flow, removed 33 selfloop flow, removed 15 redundant places. [2022-12-06 06:22:37,003 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 422 flow [2022-12-06 06:22:37,003 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=422, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2022-12-06 06:22:37,003 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 15 predicate places. [2022-12-06 06:22:37,003 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:22:37,003 INFO L89 Accepts]: Start accepts. Operand has 62 places, 52 transitions, 422 flow [2022-12-06 06:22:37,004 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:22:37,004 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:22:37,004 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 52 transitions, 422 flow [2022-12-06 06:22:37,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 52 transitions, 422 flow [2022-12-06 06:22:37,041 INFO L130 PetriNetUnfolder]: 259/598 cut-off events. [2022-12-06 06:22:37,041 INFO L131 PetriNetUnfolder]: For 1654/1730 co-relation queries the response was YES. [2022-12-06 06:22:37,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2248 conditions, 598 events. 259/598 cut-off events. For 1654/1730 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3741 event pairs, 30 based on Foata normal form. 24/595 useless extension candidates. Maximal degree in co-relation 2226. Up to 221 conditions per place. [2022-12-06 06:22:37,046 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 52 transitions, 422 flow [2022-12-06 06:22:37,046 INFO L188 LiptonReduction]: Number of co-enabled transitions 382 [2022-12-06 06:22:37,047 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [385] L781-->L784: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] and [558] $Ultimate##0-->L791: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_671 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_167 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd2~0_112 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_624 256) 0)))) (.cse2 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_672 256) 0)) .cse5))) (and (= v_~x~0_578 (ite .cse0 v_~x$w_buff0~0_427 (ite .cse1 v_~x$w_buff1~0_394 v_~x~0_579))) (= v_P2Thread1of1ForFork3_~arg.base_15 |v_P2Thread1of1ForFork3_#in~arg.base_15|) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_167) v_~x$r_buff0_thd2~0_166) (= |v_P2Thread1of1ForFork3_#in~arg.offset_15| v_P2Thread1of1ForFork3_~arg.offset_15) (= v_~z~0_138 1) (= v_~x$w_buff1_used~0_623 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_624)) (= (ite .cse0 0 v_~x$w_buff0_used~0_672) v_~x$w_buff0_used~0_671) (= v_~y~0_35 1) (= v_~x$r_buff1_thd2~0_111 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_623 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd2~0_166 256) 0)))) 0 v_~x$r_buff1_thd2~0_112))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_427, ~x$w_buff1~0=v_~x$w_buff1~0_394, P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_15|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_112, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_624, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_167, ~x~0=v_~x~0_579, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_672} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_427, ~x$w_buff1~0=v_~x$w_buff1~0_394, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_111, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_623, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_166, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_671, P2Thread1of1ForFork3_~arg.base=v_P2Thread1of1ForFork3_~arg.base_15, P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_15|, P2Thread1of1ForFork3_~arg.offset=v_P2Thread1of1ForFork3_~arg.offset_15, ~z~0=v_~z~0_138, ~y~0=v_~y~0_35, ~x~0=v_~x~0_578} AuxVars[] AssignedVars[P2Thread1of1ForFork3_~arg.base, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, P2Thread1of1ForFork3_~arg.offset, ~z~0, ~x$r_buff0_thd2~0, ~y~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:22:37,309 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:22:37,310 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 307 [2022-12-06 06:22:37,310 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 423 flow [2022-12-06 06:22:37,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 06:22:37,310 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:22:37,310 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 06:22:37,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 06:22:37,311 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:22:37,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:22:37,311 INFO L85 PathProgramCache]: Analyzing trace with hash -4652202, now seen corresponding path program 1 times [2022-12-06 06:22:37,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:22:37,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521216189] [2022-12-06 06:22:37,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:22:37,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:22:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:22:37,348 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:22:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:22:37,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:22:37,422 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:22:37,423 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 06:22:37,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 06:22:37,424 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 06:22:37,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 06:22:37,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 06:22:37,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 06:22:37,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 06:22:37,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 06:22:37,426 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:22:37,431 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:22:37,431 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:22:37,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:22:37 BasicIcfg [2022-12-06 06:22:37,504 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:22:37,504 INFO L158 Benchmark]: Toolchain (without parser) took 46733.16ms. Allocated memory was 190.8MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 159.7MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 722.9MB. Max. memory is 8.0GB. [2022-12-06 06:22:37,504 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 127.9MB. Free memory is still 105.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:22:37,504 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.82ms. Allocated memory is still 190.8MB. Free memory was 159.4MB in the beginning and 160.2MB in the end (delta: -823.1kB). Peak memory consumption was 25.6MB. Max. memory is 8.0GB. [2022-12-06 06:22:37,505 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.64ms. Allocated memory is still 190.8MB. Free memory was 160.2MB in the beginning and 157.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:22:37,505 INFO L158 Benchmark]: Boogie Preprocessor took 53.09ms. Allocated memory is still 190.8MB. Free memory was 157.1MB in the beginning and 154.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:22:37,505 INFO L158 Benchmark]: RCFGBuilder took 802.17ms. Allocated memory is still 190.8MB. Free memory was 154.9MB in the beginning and 139.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.5MB. Max. memory is 8.0GB. [2022-12-06 06:22:37,506 INFO L158 Benchmark]: TraceAbstraction took 45311.79ms. Allocated memory was 190.8MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 138.5MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 702.9MB. Max. memory is 8.0GB. [2022-12-06 06:22:37,507 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.19ms. Allocated memory is still 127.9MB. Free memory is still 105.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 492.82ms. Allocated memory is still 190.8MB. Free memory was 159.4MB in the beginning and 160.2MB in the end (delta: -823.1kB). Peak memory consumption was 25.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.64ms. Allocated memory is still 190.8MB. Free memory was 160.2MB in the beginning and 157.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.09ms. Allocated memory is still 190.8MB. Free memory was 157.1MB in the beginning and 154.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 802.17ms. Allocated memory is still 190.8MB. Free memory was 154.9MB in the beginning and 139.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.5MB. Max. memory is 8.0GB. * TraceAbstraction took 45311.79ms. Allocated memory was 190.8MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 138.5MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 702.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 137 PlacesBefore, 47 PlacesAfterwards, 126 TransitionsBefore, 35 TransitionsAfterwards, 3150 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2112, independent: 2038, independent conditional: 2038, independent unconditional: 0, dependent: 74, dependent conditional: 74, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2112, independent: 2038, independent conditional: 0, independent unconditional: 2038, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2112, independent: 2038, independent conditional: 0, independent unconditional: 2038, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2112, independent: 2038, independent conditional: 0, independent unconditional: 2038, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1800, independent: 1752, independent conditional: 0, independent unconditional: 1752, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1800, independent: 1723, independent conditional: 0, independent unconditional: 1723, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 77, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 269, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 239, dependent conditional: 0, dependent unconditional: 239, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2112, independent: 286, independent conditional: 0, independent unconditional: 286, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 1800, unknown conditional: 0, unknown unconditional: 1800] , Statistics on independence cache: Total cache size (in pairs): 2526, Positive cache size: 2478, Positive conditional cache size: 0, Positive unconditional cache size: 2478, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 39 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 191, independent: 161, independent conditional: 161, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 191, independent: 161, independent conditional: 16, independent unconditional: 145, dependent: 30, dependent conditional: 3, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 191, independent: 161, independent conditional: 16, independent unconditional: 145, dependent: 30, dependent conditional: 3, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 191, independent: 161, independent conditional: 16, independent unconditional: 145, dependent: 30, dependent conditional: 3, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 168, independent: 145, independent conditional: 15, independent unconditional: 130, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 168, independent: 139, independent conditional: 0, independent unconditional: 139, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 29, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 46, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 41, dependent conditional: 8, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 191, independent: 16, independent conditional: 1, independent unconditional: 15, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 168, unknown conditional: 17, unknown unconditional: 151] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 145, Positive conditional cache size: 15, Positive unconditional cache size: 130, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 466 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 133, independent: 123, independent conditional: 123, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 133, independent: 123, independent conditional: 29, independent unconditional: 94, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 133, independent: 123, independent conditional: 16, independent unconditional: 107, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 133, independent: 123, independent conditional: 16, independent unconditional: 107, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 21, independent conditional: 5, independent unconditional: 16, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 133, independent: 102, independent conditional: 11, independent unconditional: 91, dependent: 8, dependent conditional: 1, dependent unconditional: 7, unknown: 23, unknown conditional: 7, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 191, Positive cache size: 166, Positive conditional cache size: 20, Positive unconditional cache size: 146, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 464 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 97, independent: 87, independent conditional: 87, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 97, independent: 87, independent conditional: 9, independent unconditional: 78, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 97, independent: 87, independent conditional: 4, independent unconditional: 83, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 97, independent: 87, independent conditional: 4, independent unconditional: 83, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 97, independent: 86, independent conditional: 4, independent unconditional: 82, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 167, Positive conditional cache size: 20, Positive unconditional cache size: 147, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 532 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 106, independent: 99, independent conditional: 99, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 106, independent: 99, independent conditional: 30, independent unconditional: 69, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 106, independent: 99, independent conditional: 17, independent unconditional: 82, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 106, independent: 99, independent conditional: 17, independent unconditional: 82, dependent: 7, dependent conditional: 0, dependent unconditional: 7, 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: 106, independent: 99, independent conditional: 17, independent unconditional: 82, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 167, Positive conditional cache size: 20, Positive unconditional cache size: 147, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 48 PlacesBefore, 47 PlacesAfterwards, 51 TransitionsBefore, 50 TransitionsAfterwards, 602 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 635, independent: 606, independent conditional: 606, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 635, independent: 606, independent conditional: 307, independent unconditional: 299, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 643, independent: 606, independent conditional: 110, independent unconditional: 496, dependent: 37, dependent conditional: 8, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 643, independent: 606, independent conditional: 110, independent unconditional: 496, dependent: 37, dependent conditional: 8, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 15, independent conditional: 5, independent unconditional: 10, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 643, independent: 591, independent conditional: 105, independent unconditional: 486, dependent: 36, dependent conditional: 7, dependent unconditional: 29, unknown: 16, unknown conditional: 6, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 250, Positive cache size: 224, Positive conditional cache size: 25, Positive unconditional cache size: 199, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 197, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 656 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 407, independent: 387, independent conditional: 387, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 407, independent: 387, independent conditional: 168, independent unconditional: 219, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 407, independent: 387, independent conditional: 122, independent unconditional: 265, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 407, independent: 387, independent conditional: 122, independent unconditional: 265, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 407, independent: 385, independent conditional: 120, independent unconditional: 265, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 252, Positive cache size: 226, Positive conditional cache size: 27, Positive unconditional cache size: 199, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 46, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 656 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 397, independent: 377, independent conditional: 377, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 397, independent: 377, independent conditional: 158, independent unconditional: 219, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 397, independent: 377, independent conditional: 112, independent unconditional: 265, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 397, independent: 377, independent conditional: 112, independent unconditional: 265, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 397, independent: 374, independent conditional: 109, independent unconditional: 265, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 255, Positive cache size: 229, Positive conditional cache size: 30, Positive unconditional cache size: 199, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 46, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 750 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 487, independent: 462, independent conditional: 462, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 487, independent: 462, independent conditional: 192, independent unconditional: 270, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 487, independent: 462, independent conditional: 143, independent unconditional: 319, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 487, independent: 462, independent conditional: 143, independent unconditional: 319, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 3, independent unconditional: 1, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 487, independent: 458, independent conditional: 140, independent unconditional: 318, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 259, Positive cache size: 233, Positive conditional cache size: 33, Positive unconditional cache size: 200, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 49, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 930 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1321, independent: 1274, independent conditional: 1274, independent unconditional: 0, dependent: 47, dependent conditional: 47, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1321, independent: 1274, independent conditional: 664, independent unconditional: 610, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1321, independent: 1274, independent conditional: 562, independent unconditional: 712, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1321, independent: 1274, independent conditional: 562, independent unconditional: 712, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 6, independent unconditional: 7, 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: 13, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1321, independent: 1261, independent conditional: 556, independent unconditional: 705, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 13, unknown conditional: 6, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 272, Positive cache size: 246, Positive conditional cache size: 39, Positive unconditional cache size: 207, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 102, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 60 PlacesBefore, 61 PlacesAfterwards, 109 TransitionsBefore, 111 TransitionsAfterwards, 1086 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2312, independent: 2200, independent conditional: 2200, independent unconditional: 0, dependent: 112, dependent conditional: 112, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2312, independent: 2200, independent conditional: 1006, independent unconditional: 1194, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2312, independent: 2200, independent conditional: 804, independent unconditional: 1396, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2312, independent: 2200, independent conditional: 804, independent unconditional: 1396, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 1, independent unconditional: 3, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 2312, independent: 2196, independent conditional: 803, independent unconditional: 1393, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 284, Positive cache size: 258, Positive conditional cache size: 40, Positive unconditional cache size: 218, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 202, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 64 PlacesBefore, 65 PlacesAfterwards, 115 TransitionsBefore, 116 TransitionsAfterwards, 1146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2530, independent: 2407, independent conditional: 2407, independent unconditional: 0, dependent: 123, dependent conditional: 123, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2530, independent: 2407, independent conditional: 1150, independent unconditional: 1257, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2530, independent: 2407, independent conditional: 928, independent unconditional: 1479, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2530, independent: 2407, independent conditional: 928, independent unconditional: 1479, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2530, independent: 2405, independent conditional: 927, independent unconditional: 1478, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 290, Positive cache size: 264, Positive conditional cache size: 41, Positive unconditional cache size: 223, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 222, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 126 TransitionsBefore, 126 TransitionsAfterwards, 1218 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1448, independent: 1378, independent conditional: 1378, independent unconditional: 0, dependent: 70, dependent conditional: 70, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1448, independent: 1378, independent conditional: 650, independent unconditional: 728, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1448, independent: 1378, independent conditional: 525, independent unconditional: 853, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1448, independent: 1378, independent conditional: 525, independent unconditional: 853, dependent: 70, dependent conditional: 0, dependent unconditional: 70, 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: 1448, independent: 1378, independent conditional: 525, independent unconditional: 853, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 290, Positive cache size: 264, Positive conditional cache size: 41, Positive unconditional cache size: 223, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 125, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 66 PlacesBefore, 66 PlacesAfterwards, 129 TransitionsBefore, 129 TransitionsAfterwards, 1374 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 490, independent: 471, independent conditional: 471, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 490, independent: 471, independent conditional: 246, independent unconditional: 225, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 490, independent: 471, independent conditional: 178, independent unconditional: 293, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 490, independent: 471, independent conditional: 178, independent unconditional: 293, dependent: 19, dependent conditional: 0, dependent unconditional: 19, 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: 490, independent: 471, independent conditional: 178, independent unconditional: 293, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 290, Positive cache size: 264, Positive conditional cache size: 41, Positive unconditional cache size: 223, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 68, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 69 PlacesBefore, 69 PlacesAfterwards, 128 TransitionsBefore, 128 TransitionsAfterwards, 1422 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1028, independent: 990, independent conditional: 990, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1028, independent: 990, independent conditional: 566, independent unconditional: 424, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1028, independent: 990, independent conditional: 424, independent unconditional: 566, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1028, independent: 990, independent conditional: 424, independent unconditional: 566, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 9, independent unconditional: 8, 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: 17, independent: 17, independent conditional: 0, independent unconditional: 17, 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: 1028, independent: 973, independent conditional: 415, independent unconditional: 558, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 17, unknown conditional: 9, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 309, Positive cache size: 283, Positive conditional cache size: 50, Positive unconditional cache size: 233, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 142, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 72 PlacesBefore, 72 PlacesAfterwards, 130 TransitionsBefore, 130 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1052, independent: 1014, independent conditional: 1014, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1052, independent: 1014, independent conditional: 544, independent unconditional: 470, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1052, independent: 1014, independent conditional: 408, independent unconditional: 606, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1052, independent: 1014, independent conditional: 408, independent unconditional: 606, dependent: 38, dependent conditional: 0, dependent unconditional: 38, 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: 1052, independent: 1014, independent conditional: 408, independent unconditional: 606, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 318, Positive cache size: 292, Positive conditional cache size: 50, Positive unconditional cache size: 242, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 136, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 79 PlacesBefore, 79 PlacesAfterwards, 154 TransitionsBefore, 154 TransitionsAfterwards, 1382 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 65, independent: 60, independent conditional: 55, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 65, independent: 60, independent conditional: 50, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 65, independent: 60, independent conditional: 50, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, 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: 65, independent: 60, independent conditional: 50, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 318, Positive cache size: 292, Positive conditional cache size: 50, Positive unconditional cache size: 242, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 82 PlacesBefore, 82 PlacesAfterwards, 126 TransitionsBefore, 126 TransitionsAfterwards, 1318 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 40, independent: 35, independent conditional: 30, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 35, independent conditional: 25, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 35, independent conditional: 25, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, 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: 40, independent: 35, independent conditional: 25, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 318, Positive cache size: 292, Positive conditional cache size: 50, Positive unconditional cache size: 242, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 83 PlacesBefore, 80 PlacesAfterwards, 89 TransitionsBefore, 86 TransitionsAfterwards, 742 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 372, independent: 366, independent conditional: 366, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 372, independent: 366, independent conditional: 264, independent unconditional: 102, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 372, independent: 366, independent conditional: 236, independent unconditional: 130, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 372, independent: 366, independent conditional: 236, independent unconditional: 130, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 3, independent unconditional: 1, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 372, independent: 362, independent conditional: 233, independent unconditional: 129, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 439, Positive cache size: 413, Positive conditional cache size: 60, Positive unconditional cache size: 353, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 71 PlacesBefore, 70 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 322 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 93, independent: 93, independent conditional: 93, 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: 93, independent: 93, independent conditional: 60, independent unconditional: 33, 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: 93, independent: 93, independent conditional: 49, independent unconditional: 44, 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: 93, independent: 93, independent conditional: 49, independent unconditional: 44, 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: 4, independent: 4, independent conditional: 1, independent unconditional: 3, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 93, independent: 89, independent conditional: 48, independent unconditional: 41, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 514, Positive cache size: 488, Positive conditional cache size: 63, Positive unconditional cache size: 425, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 62 PlacesBefore, 62 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 382 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 6, independent unconditional: 4, 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: 10, independent: 10, independent conditional: 5, independent unconditional: 5, 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: 10, independent: 10, independent conditional: 5, independent unconditional: 5, 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: 5, independent: 5, independent conditional: 4, independent unconditional: 1, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 10, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 527, Positive cache size: 501, Positive conditional cache size: 67, Positive unconditional cache size: 434, Negative cache size: 26, Negative conditional cache size: 5, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L851] 0 pthread_t t737; [L852] FCALL, FORK 0 pthread_create(&t737, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t737, ((void *)0), P0, ((void *)0))=-3, t737={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L853] 0 pthread_t t738; [L854] FCALL, FORK 0 pthread_create(&t738, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t738, ((void *)0), P1, ((void *)0))=-2, t737={5:0}, t738={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L855] 0 pthread_t t739; [L856] FCALL, FORK 0 pthread_create(&t739, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t739, ((void *)0), P2, ((void *)0))=-1, t737={5:0}, t738={6:0}, t739={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L857] 0 pthread_t t740; [L858] FCALL, FORK 0 pthread_create(&t740, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t740, ((void *)0), P3, ((void *)0))=0, t737={5:0}, t738={6:0}, t739={7:0}, t740={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L800] 3 y = 1 [L803] 3 z = 1 [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L820] 4 z = 2 [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L826] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L750] 1 a = 1 [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L829] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L830] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L831] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L832] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L833] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 x$flush_delayed = weak$$choice2 [L874] 0 x$mem_tmp = x [L875] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L877] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L878] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L879] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L881] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L883] 0 x = x$flush_delayed ? x$mem_tmp : x [L884] 0 x$flush_delayed = (_Bool)0 [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 167 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: 45.1s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 22.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 758 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 758 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 196 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2090 IncrementalHoareTripleChecker+Invalid, 2286 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 196 mSolverCounterUnsat, 34 mSDtfsCounter, 2090 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1943occurred in iteration=16, InterpolantAutomatonStates: 84, 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.4s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 355 NumberOfCodeBlocks, 355 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 313 ConstructedInterpolants, 0 QuantifiedInterpolants, 2702 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:22:37,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...