/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:41:27,702 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:41:27,704 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:41:27,725 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:41:27,725 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:41:27,726 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:41:27,727 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:41:27,728 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:41:27,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:41:27,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:41:27,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:41:27,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:41:27,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:41:27,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:41:27,733 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:41:27,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:41:27,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:41:27,737 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:41:27,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:41:27,742 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:41:27,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:41:27,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:41:27,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:41:27,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:41:27,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:41:27,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:41:27,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:41:27,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:41:27,753 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:41:27,754 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:41:27,754 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:41:27,754 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:41:27,755 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:41:27,755 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:41:27,756 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:41:27,756 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:41:27,756 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:41:27,756 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:41:27,757 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:41:27,757 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:41:27,758 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:41:27,762 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 00:41:27,791 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:41:27,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:41:27,793 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:41:27,793 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:41:27,793 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:41:27,794 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:41:27,794 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:41:27,794 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:41:27,794 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:41:27,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:41:27,795 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:41:27,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:41:27,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:41:27,795 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:41:27,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:41:27,795 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:41:27,795 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:41:27,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:41:27,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:41:27,796 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:41:27,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:41:27,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:41:27,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:41:27,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:41:27,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:41:27,796 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:41:27,797 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:41:27,797 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:41:27,797 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-13 00:41:28,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:41:28,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:41:28,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:41:28,080 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:41:28,080 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:41:28,081 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2022-12-13 00:41:29,136 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:41:29,452 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:41:29,453 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2022-12-13 00:41:29,499 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd0c7853b/8bb21c4044ca41cfa70ab07576c2a592/FLAGc27392223 [2022-12-13 00:41:29,672 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd0c7853b/8bb21c4044ca41cfa70ab07576c2a592 [2022-12-13 00:41:29,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:41:29,675 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:41:29,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:41:29,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:41:29,678 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:41:29,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:41:29" (1/1) ... [2022-12-13 00:41:29,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e91b35f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:29, skipping insertion in model container [2022-12-13 00:41:29,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:41:29" (1/1) ... [2022-12-13 00:41:29,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:41:29,766 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:41:29,999 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/mix037_tso.oepc.i[949,962] [2022-12-13 00:41:30,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:41:30,238 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:41:30,245 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/mix037_tso.oepc.i[949,962] [2022-12-13 00:41:30,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:30,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:30,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:41:30,303 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:41:30,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:30 WrapperNode [2022-12-13 00:41:30,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:41:30,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:41:30,305 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:41:30,305 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:41:30,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:30" (1/1) ... [2022-12-13 00:41:30,333 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:30" (1/1) ... [2022-12-13 00:41:30,351 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2022-12-13 00:41:30,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:41:30,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:41:30,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:41:30,351 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:41:30,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:30" (1/1) ... [2022-12-13 00:41:30,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:30" (1/1) ... [2022-12-13 00:41:30,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:30" (1/1) ... [2022-12-13 00:41:30,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:30" (1/1) ... [2022-12-13 00:41:30,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:30" (1/1) ... [2022-12-13 00:41:30,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:30" (1/1) ... [2022-12-13 00:41:30,367 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:30" (1/1) ... [2022-12-13 00:41:30,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:30" (1/1) ... [2022-12-13 00:41:30,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:41:30,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:41:30,371 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:41:30,371 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:41:30,371 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:30" (1/1) ... [2022-12-13 00:41:30,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:41:30,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:41:30,392 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 00:41:30,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 00:41:30,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:41:30,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:41:30,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:41:30,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:41:30,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:41:30,433 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:41:30,433 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:41:30,433 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:41:30,433 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:41:30,433 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:41:30,433 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:41:30,434 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 00:41:30,434 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 00:41:30,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:41:30,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:41:30,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:41:30,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:41:30,436 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:41:30,592 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:41:30,600 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:41:30,808 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:41:30,886 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:41:30,886 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:41:30,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:41:30 BoogieIcfgContainer [2022-12-13 00:41:30,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:41:30,890 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:41:30,890 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:41:30,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:41:30,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:41:29" (1/3) ... [2022-12-13 00:41:30,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3d3663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:41:30, skipping insertion in model container [2022-12-13 00:41:30,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:30" (2/3) ... [2022-12-13 00:41:30,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3d3663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:41:30, skipping insertion in model container [2022-12-13 00:41:30,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:41:30" (3/3) ... [2022-12-13 00:41:30,894 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037_tso.oepc.i [2022-12-13 00:41:30,906 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:41:30,906 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:41:30,906 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:41:30,954 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:41:31,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2022-12-13 00:41:31,075 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-12-13 00:41:31,075 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:41:31,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-13 00:41:31,081 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2022-12-13 00:41:31,098 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2022-12-13 00:41:31,099 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:31,127 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2022-12-13 00:41:31,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2022-12-13 00:41:31,206 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-12-13 00:41:31,206 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:41:31,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-13 00:41:31,210 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2022-12-13 00:41:31,210 INFO L226 LiptonReduction]: Number of co-enabled transitions 3256 [2022-12-13 00:41:40,200 INFO L241 LiptonReduction]: Total number of compositions: 103 [2022-12-13 00:41:40,226 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:41:40,231 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;@70ae5ef4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:41:40,231 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 00:41:40,233 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-13 00:41:40,234 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:41:40,234 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:40,234 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 00:41:40,234 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-13 00:41:40,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:40,237 INFO L85 PathProgramCache]: Analyzing trace with hash 546666744, now seen corresponding path program 1 times [2022-12-13 00:41:40,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:40,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185118034] [2022-12-13 00:41:40,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:40,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:40,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:41:40,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:40,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185118034] [2022-12-13 00:41:40,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185118034] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:40,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:40,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:41:40,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939908083] [2022-12-13 00:41:40,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:40,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:41:40,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:40,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:41:40,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:41:40,708 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 78 [2022-12-13 00:41:40,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 78 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:40,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:40,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 78 [2022-12-13 00:41:40,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:49,701 INFO L130 PetriNetUnfolder]: 69199/97714 cut-off events. [2022-12-13 00:41:49,702 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2022-12-13 00:41:49,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189142 conditions, 97714 events. 69199/97714 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 4911. Compared 723953 event pairs, 25733 based on Foata normal form. 0/58691 useless extension candidates. Maximal degree in co-relation 189130. Up to 76377 conditions per place. [2022-12-13 00:41:50,053 INFO L137 encePairwiseOnDemand]: 74/78 looper letters, 46 selfloop transitions, 2 changer transitions 64/128 dead transitions. [2022-12-13 00:41:50,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 128 transitions, 498 flow [2022-12-13 00:41:50,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:41:50,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:41:50,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2022-12-13 00:41:50,064 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6965811965811965 [2022-12-13 00:41:50,065 INFO L175 Difference]: Start difference. First operand has 91 places, 78 transitions, 168 flow. Second operand 3 states and 163 transitions. [2022-12-13 00:41:50,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 128 transitions, 498 flow [2022-12-13 00:41:50,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 128 transitions, 492 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 00:41:50,071 INFO L231 Difference]: Finished difference. Result has 87 places, 44 transitions, 100 flow [2022-12-13 00:41:50,072 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=87, PETRI_TRANSITIONS=44} [2022-12-13 00:41:50,075 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -4 predicate places. [2022-12-13 00:41:50,075 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:50,075 INFO L89 Accepts]: Start accepts. Operand has 87 places, 44 transitions, 100 flow [2022-12-13 00:41:50,079 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:50,079 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:50,079 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 44 transitions, 100 flow [2022-12-13 00:41:50,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 44 transitions, 100 flow [2022-12-13 00:41:50,100 INFO L130 PetriNetUnfolder]: 0/44 cut-off events. [2022-12-13 00:41:50,100 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:41:50,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 44 events. 0/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 117 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:41:50,104 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 44 transitions, 100 flow [2022-12-13 00:41:50,104 INFO L226 LiptonReduction]: Number of co-enabled transitions 1150 [2022-12-13 00:41:50,470 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:41:50,473 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 398 [2022-12-13 00:41:50,473 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 100 flow [2022-12-13 00:41:50,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:50,473 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:50,473 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:50,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:41:50,476 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-13 00:41:50,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:50,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1932795283, now seen corresponding path program 1 times [2022-12-13 00:41:50,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:50,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399444117] [2022-12-13 00:41:50,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:50,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:50,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:41:50,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:50,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399444117] [2022-12-13 00:41:50,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399444117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:50,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:50,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:41:50,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874774815] [2022-12-13 00:41:50,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:50,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:41:50,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:50,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:41:50,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:41:50,976 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2022-12-13 00:41:50,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:50,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:50,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2022-12-13 00:41:50,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:53,429 INFO L130 PetriNetUnfolder]: 20543/28426 cut-off events. [2022-12-13 00:41:53,429 INFO L131 PetriNetUnfolder]: For 1125/1125 co-relation queries the response was YES. [2022-12-13 00:41:53,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57400 conditions, 28426 events. 20543/28426 cut-off events. For 1125/1125 co-relation queries the response was YES. Maximal size of possible extension queue 859. Compared 155917 event pairs, 7583 based on Foata normal form. 648/24188 useless extension candidates. Maximal degree in co-relation 57390. Up to 18145 conditions per place. [2022-12-13 00:41:53,608 INFO L137 encePairwiseOnDemand]: 41/44 looper letters, 47 selfloop transitions, 2 changer transitions 1/61 dead transitions. [2022-12-13 00:41:53,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 61 transitions, 236 flow [2022-12-13 00:41:53,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:41:53,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:41:53,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-12-13 00:41:53,609 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2022-12-13 00:41:53,609 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 100 flow. Second operand 3 states and 84 transitions. [2022-12-13 00:41:53,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 61 transitions, 236 flow [2022-12-13 00:41:53,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 61 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:41:53,612 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 102 flow [2022-12-13 00:41:53,612 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2022-12-13 00:41:53,613 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -35 predicate places. [2022-12-13 00:41:53,613 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:53,613 INFO L89 Accepts]: Start accepts. Operand has 56 places, 43 transitions, 102 flow [2022-12-13 00:41:53,614 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:53,614 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:53,614 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 43 transitions, 102 flow [2022-12-13 00:41:53,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 43 transitions, 102 flow [2022-12-13 00:41:53,619 INFO L130 PetriNetUnfolder]: 0/43 cut-off events. [2022-12-13 00:41:53,619 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:41:53,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 43 events. 0/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 115 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:41:53,621 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 43 transitions, 102 flow [2022-12-13 00:41:53,621 INFO L226 LiptonReduction]: Number of co-enabled transitions 1094 [2022-12-13 00:41:53,682 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:41:53,683 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-13 00:41:53,683 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 100 flow [2022-12-13 00:41:53,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:53,684 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:53,684 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:53,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:41:53,684 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-13 00:41:53,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:53,684 INFO L85 PathProgramCache]: Analyzing trace with hash 213452845, now seen corresponding path program 1 times [2022-12-13 00:41:53,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:53,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333364794] [2022-12-13 00:41:53,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:53,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:54,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:41:54,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:54,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333364794] [2022-12-13 00:41:54,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333364794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:54,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:54,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:41:54,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393684981] [2022-12-13 00:41:54,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:54,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:41:54,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:54,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:41:54,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:41:54,044 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2022-12-13 00:41:54,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:54,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:54,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2022-12-13 00:41:54,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:54,862 INFO L130 PetriNetUnfolder]: 8868/13133 cut-off events. [2022-12-13 00:41:54,862 INFO L131 PetriNetUnfolder]: For 996/996 co-relation queries the response was YES. [2022-12-13 00:41:54,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26863 conditions, 13133 events. 8868/13133 cut-off events. For 996/996 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 82345 event pairs, 1424 based on Foata normal form. 120/10894 useless extension candidates. Maximal degree in co-relation 26852. Up to 10373 conditions per place. [2022-12-13 00:41:54,921 INFO L137 encePairwiseOnDemand]: 39/42 looper letters, 45 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2022-12-13 00:41:54,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 61 transitions, 239 flow [2022-12-13 00:41:54,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:41:54,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:41:54,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-12-13 00:41:54,922 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2022-12-13 00:41:54,922 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 100 flow. Second operand 3 states and 90 transitions. [2022-12-13 00:41:54,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 61 transitions, 239 flow [2022-12-13 00:41:54,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 233 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:41:54,926 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 104 flow [2022-12-13 00:41:54,926 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2022-12-13 00:41:54,926 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -36 predicate places. [2022-12-13 00:41:54,926 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:54,926 INFO L89 Accepts]: Start accepts. Operand has 55 places, 42 transitions, 104 flow [2022-12-13 00:41:54,927 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:54,927 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:54,927 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 42 transitions, 104 flow [2022-12-13 00:41:54,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 42 transitions, 104 flow [2022-12-13 00:41:54,931 INFO L130 PetriNetUnfolder]: 0/42 cut-off events. [2022-12-13 00:41:54,931 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 00:41:54,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 42 events. 0/42 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 116 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:41:54,931 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 42 transitions, 104 flow [2022-12-13 00:41:54,931 INFO L226 LiptonReduction]: Number of co-enabled transitions 1042 [2022-12-13 00:41:54,942 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:41:54,943 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 00:41:54,943 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 104 flow [2022-12-13 00:41:54,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:54,943 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:54,943 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:54,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:41:54,943 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-13 00:41:54,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:54,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1972897549, now seen corresponding path program 1 times [2022-12-13 00:41:54,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:54,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8172986] [2022-12-13 00:41:54,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:54,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:55,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:41:55,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:55,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8172986] [2022-12-13 00:41:55,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8172986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:55,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:55,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:41:55,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256986196] [2022-12-13 00:41:55,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:55,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:41:55,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:55,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:41:55,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:41:55,234 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2022-12-13 00:41:55,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 104 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:55,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:55,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2022-12-13 00:41:55,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:56,195 INFO L130 PetriNetUnfolder]: 8844/12904 cut-off events. [2022-12-13 00:41:56,196 INFO L131 PetriNetUnfolder]: For 1935/1935 co-relation queries the response was YES. [2022-12-13 00:41:56,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27667 conditions, 12904 events. 8844/12904 cut-off events. For 1935/1935 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 75388 event pairs, 3993 based on Foata normal form. 6/10566 useless extension candidates. Maximal degree in co-relation 27655. Up to 11636 conditions per place. [2022-12-13 00:41:56,305 INFO L137 encePairwiseOnDemand]: 35/42 looper letters, 49 selfloop transitions, 9 changer transitions 0/72 dead transitions. [2022-12-13 00:41:56,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 72 transitions, 295 flow [2022-12-13 00:41:56,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:41:56,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:41:56,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-12-13 00:41:56,322 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6845238095238095 [2022-12-13 00:41:56,322 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 104 flow. Second operand 4 states and 115 transitions. [2022-12-13 00:41:56,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 72 transitions, 295 flow [2022-12-13 00:41:56,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 72 transitions, 289 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:41:56,326 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 157 flow [2022-12-13 00:41:56,326 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2022-12-13 00:41:56,327 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -33 predicate places. [2022-12-13 00:41:56,327 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:56,327 INFO L89 Accepts]: Start accepts. Operand has 58 places, 50 transitions, 157 flow [2022-12-13 00:41:56,328 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:56,328 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:56,328 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 50 transitions, 157 flow [2022-12-13 00:41:56,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 50 transitions, 157 flow [2022-12-13 00:41:56,339 INFO L130 PetriNetUnfolder]: 18/145 cut-off events. [2022-12-13 00:41:56,339 INFO L131 PetriNetUnfolder]: For 16/20 co-relation queries the response was YES. [2022-12-13 00:41:56,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 145 events. 18/145 cut-off events. For 16/20 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 803 event pairs, 6 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 220. Up to 34 conditions per place. [2022-12-13 00:41:56,340 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 50 transitions, 157 flow [2022-12-13 00:41:56,341 INFO L226 LiptonReduction]: Number of co-enabled transitions 1262 [2022-12-13 00:41:56,365 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:41:56,369 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-13 00:41:56,369 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 157 flow [2022-12-13 00:41:56,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:56,369 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:56,369 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:56,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:41:56,370 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-13 00:41:56,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:56,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1874050510, now seen corresponding path program 1 times [2022-12-13 00:41:56,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:56,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334576676] [2022-12-13 00:41:56,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:56,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:56,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:41:56,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:56,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334576676] [2022-12-13 00:41:56,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334576676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:56,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:56,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:41:56,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15971755] [2022-12-13 00:41:56,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:56,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:41:56,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:56,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:41:56,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:41:56,766 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2022-12-13 00:41:56,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 157 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:56,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:56,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2022-12-13 00:41:56,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:58,110 INFO L130 PetriNetUnfolder]: 14471/19707 cut-off events. [2022-12-13 00:41:58,110 INFO L131 PetriNetUnfolder]: For 8207/8207 co-relation queries the response was YES. [2022-12-13 00:41:58,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47657 conditions, 19707 events. 14471/19707 cut-off events. For 8207/8207 co-relation queries the response was YES. Maximal size of possible extension queue 874. Compared 109642 event pairs, 4609 based on Foata normal form. 81/13281 useless extension candidates. Maximal degree in co-relation 47643. Up to 19147 conditions per place. [2022-12-13 00:41:58,206 INFO L137 encePairwiseOnDemand]: 28/42 looper letters, 52 selfloop transitions, 13 changer transitions 0/76 dead transitions. [2022-12-13 00:41:58,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 76 transitions, 357 flow [2022-12-13 00:41:58,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:41:58,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:41:58,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-12-13 00:41:58,208 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2022-12-13 00:41:58,208 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 157 flow. Second operand 3 states and 91 transitions. [2022-12-13 00:41:58,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 76 transitions, 357 flow [2022-12-13 00:41:58,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 76 transitions, 357 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:41:58,213 INFO L231 Difference]: Finished difference. Result has 61 places, 62 transitions, 246 flow [2022-12-13 00:41:58,213 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=61, PETRI_TRANSITIONS=62} [2022-12-13 00:41:58,213 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -30 predicate places. [2022-12-13 00:41:58,213 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:58,214 INFO L89 Accepts]: Start accepts. Operand has 61 places, 62 transitions, 246 flow [2022-12-13 00:41:58,214 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:58,214 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:58,214 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 62 transitions, 246 flow [2022-12-13 00:41:58,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 62 transitions, 246 flow [2022-12-13 00:41:58,699 INFO L130 PetriNetUnfolder]: 3923/6270 cut-off events. [2022-12-13 00:41:58,699 INFO L131 PetriNetUnfolder]: For 1900/1900 co-relation queries the response was YES. [2022-12-13 00:41:58,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13301 conditions, 6270 events. 3923/6270 cut-off events. For 1900/1900 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 46924 event pairs, 1790 based on Foata normal form. 0/3052 useless extension candidates. Maximal degree in co-relation 13287. Up to 4888 conditions per place. [2022-12-13 00:41:58,767 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 62 transitions, 246 flow [2022-12-13 00:41:58,767 INFO L226 LiptonReduction]: Number of co-enabled transitions 1500 [2022-12-13 00:41:58,795 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:41:58,796 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 583 [2022-12-13 00:41:58,796 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 62 transitions, 246 flow [2022-12-13 00:41:58,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:58,796 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:58,796 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:58,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:41:58,796 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-13 00:41:58,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:58,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1583762677, now seen corresponding path program 1 times [2022-12-13 00:41:58,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:58,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605894836] [2022-12-13 00:41:58,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:58,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:58,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:41:58,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:58,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605894836] [2022-12-13 00:41:58,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605894836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:58,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:58,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:41:58,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243365550] [2022-12-13 00:41:58,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:58,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:41:58,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:58,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:41:58,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:41:58,905 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2022-12-13 00:41:58,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 62 transitions, 246 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:58,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:58,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2022-12-13 00:41:58,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:59,968 INFO L130 PetriNetUnfolder]: 10247/14655 cut-off events. [2022-12-13 00:41:59,969 INFO L131 PetriNetUnfolder]: For 6631/6631 co-relation queries the response was YES. [2022-12-13 00:42:00,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44123 conditions, 14655 events. 10247/14655 cut-off events. For 6631/6631 co-relation queries the response was YES. Maximal size of possible extension queue 746. Compared 87045 event pairs, 1684 based on Foata normal form. 324/10212 useless extension candidates. Maximal degree in co-relation 44106. Up to 12475 conditions per place. [2022-12-13 00:42:00,059 INFO L137 encePairwiseOnDemand]: 28/42 looper letters, 64 selfloop transitions, 25 changer transitions 0/100 dead transitions. [2022-12-13 00:42:00,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 100 transitions, 558 flow [2022-12-13 00:42:00,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:42:00,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:42:00,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-12-13 00:42:00,060 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.75 [2022-12-13 00:42:00,060 INFO L175 Difference]: Start difference. First operand has 61 places, 62 transitions, 246 flow. Second operand 4 states and 126 transitions. [2022-12-13 00:42:00,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 100 transitions, 558 flow [2022-12-13 00:42:00,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 100 transitions, 545 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:42:00,065 INFO L231 Difference]: Finished difference. Result has 64 places, 74 transitions, 381 flow [2022-12-13 00:42:00,065 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=381, PETRI_PLACES=64, PETRI_TRANSITIONS=74} [2022-12-13 00:42:00,066 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -27 predicate places. [2022-12-13 00:42:00,066 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:42:00,066 INFO L89 Accepts]: Start accepts. Operand has 64 places, 74 transitions, 381 flow [2022-12-13 00:42:00,067 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:42:00,067 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:42:00,067 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 74 transitions, 381 flow [2022-12-13 00:42:00,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 74 transitions, 381 flow [2022-12-13 00:42:00,385 INFO L130 PetriNetUnfolder]: 3059/5193 cut-off events. [2022-12-13 00:42:00,386 INFO L131 PetriNetUnfolder]: For 2047/9403 co-relation queries the response was YES. [2022-12-13 00:42:00,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15436 conditions, 5193 events. 3059/5193 cut-off events. For 2047/9403 co-relation queries the response was YES. Maximal size of possible extension queue 669. Compared 38390 event pairs, 527 based on Foata normal form. 9/2638 useless extension candidates. Maximal degree in co-relation 15420. Up to 3970 conditions per place. [2022-12-13 00:42:00,432 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 74 transitions, 381 flow [2022-12-13 00:42:00,433 INFO L226 LiptonReduction]: Number of co-enabled transitions 1866 [2022-12-13 00:42:00,463 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:42:00,463 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 397 [2022-12-13 00:42:00,463 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 74 transitions, 381 flow [2022-12-13 00:42:00,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:42:00,464 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:42:00,464 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:42:00,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:42:00,464 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-13 00:42:00,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:42:00,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1753398409, now seen corresponding path program 1 times [2022-12-13 00:42:00,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:42:00,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471682029] [2022-12-13 00:42:00,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:42:00,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:42:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:42:00,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:42:00,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:42:00,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471682029] [2022-12-13 00:42:00,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471682029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:42:00,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:42:00,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:42:00,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953383872] [2022-12-13 00:42:00,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:42:00,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:42:00,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:42:00,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:42:00,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:42:00,823 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2022-12-13 00:42:00,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 74 transitions, 381 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:42:00,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:42:00,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2022-12-13 00:42:00,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:42:01,487 INFO L130 PetriNetUnfolder]: 5801/8904 cut-off events. [2022-12-13 00:42:01,487 INFO L131 PetriNetUnfolder]: For 5075/5075 co-relation queries the response was YES. [2022-12-13 00:42:01,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32479 conditions, 8904 events. 5801/8904 cut-off events. For 5075/5075 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 54155 event pairs, 487 based on Foata normal form. 486/6482 useless extension candidates. Maximal degree in co-relation 32460. Up to 4696 conditions per place. [2022-12-13 00:42:01,544 INFO L137 encePairwiseOnDemand]: 28/42 looper letters, 74 selfloop transitions, 37 changer transitions 0/122 dead transitions. [2022-12-13 00:42:01,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 122 transitions, 795 flow [2022-12-13 00:42:01,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:42:01,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:42:01,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 159 transitions. [2022-12-13 00:42:01,546 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7571428571428571 [2022-12-13 00:42:01,546 INFO L175 Difference]: Start difference. First operand has 64 places, 74 transitions, 381 flow. Second operand 5 states and 159 transitions. [2022-12-13 00:42:01,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 122 transitions, 795 flow [2022-12-13 00:42:01,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 122 transitions, 745 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-13 00:42:01,557 INFO L231 Difference]: Finished difference. Result has 67 places, 86 transitions, 527 flow [2022-12-13 00:42:01,558 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=527, PETRI_PLACES=67, PETRI_TRANSITIONS=86} [2022-12-13 00:42:01,558 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -24 predicate places. [2022-12-13 00:42:01,558 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:42:01,558 INFO L89 Accepts]: Start accepts. Operand has 67 places, 86 transitions, 527 flow [2022-12-13 00:42:01,559 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:42:01,559 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:42:01,559 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 86 transitions, 527 flow [2022-12-13 00:42:01,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 86 transitions, 527 flow [2022-12-13 00:42:01,776 INFO L130 PetriNetUnfolder]: 1844/3330 cut-off events. [2022-12-13 00:42:01,776 INFO L131 PetriNetUnfolder]: For 2071/5323 co-relation queries the response was YES. [2022-12-13 00:42:01,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12728 conditions, 3330 events. 1844/3330 cut-off events. For 2071/5323 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 24392 event pairs, 113 based on Foata normal form. 16/1619 useless extension candidates. Maximal degree in co-relation 12711. Up to 2557 conditions per place. [2022-12-13 00:42:01,801 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 86 transitions, 527 flow [2022-12-13 00:42:01,801 INFO L226 LiptonReduction]: Number of co-enabled transitions 1890 [2022-12-13 00:42:01,809 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:42:01,809 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 251 [2022-12-13 00:42:01,809 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 86 transitions, 527 flow [2022-12-13 00:42:01,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:42:01,810 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:42:01,810 INFO L214 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-13 00:42:01,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:42:01,810 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-13 00:42:01,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:42:01,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1605760083, now seen corresponding path program 1 times [2022-12-13 00:42:01,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:42:01,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024005457] [2022-12-13 00:42:01,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:42:01,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:42:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:42:01,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:42:01,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:42:01,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024005457] [2022-12-13 00:42:01,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024005457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:42:01,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:42:01,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:42:01,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252600815] [2022-12-13 00:42:01,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:42:01,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:42:01,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:42:01,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:42:01,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:42:01,956 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2022-12-13 00:42:01,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 86 transitions, 527 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:42:01,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:42:01,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2022-12-13 00:42:01,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:42:02,922 INFO L130 PetriNetUnfolder]: 7973/12906 cut-off events. [2022-12-13 00:42:02,922 INFO L131 PetriNetUnfolder]: For 17347/19350 co-relation queries the response was YES. [2022-12-13 00:42:02,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51710 conditions, 12906 events. 7973/12906 cut-off events. For 17347/19350 co-relation queries the response was YES. Maximal size of possible extension queue 767. Compared 92192 event pairs, 1286 based on Foata normal form. 992/11301 useless extension candidates. Maximal degree in co-relation 51690. Up to 7002 conditions per place. [2022-12-13 00:42:02,998 INFO L137 encePairwiseOnDemand]: 39/42 looper letters, 132 selfloop transitions, 2 changer transitions 14/174 dead transitions. [2022-12-13 00:42:02,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 174 transitions, 1390 flow [2022-12-13 00:42:02,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:42:02,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:42:02,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-12-13 00:42:02,999 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7321428571428571 [2022-12-13 00:42:02,999 INFO L175 Difference]: Start difference. First operand has 67 places, 86 transitions, 527 flow. Second operand 4 states and 123 transitions. [2022-12-13 00:42:03,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 174 transitions, 1390 flow [2022-12-13 00:42:03,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 174 transitions, 1180 flow, removed 52 selfloop flow, removed 3 redundant places. [2022-12-13 00:42:03,134 INFO L231 Difference]: Finished difference. Result has 69 places, 87 transitions, 442 flow [2022-12-13 00:42:03,134 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=442, PETRI_PLACES=69, PETRI_TRANSITIONS=87} [2022-12-13 00:42:03,135 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -22 predicate places. [2022-12-13 00:42:03,135 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:42:03,135 INFO L89 Accepts]: Start accepts. Operand has 69 places, 87 transitions, 442 flow [2022-12-13 00:42:03,136 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:42:03,136 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:42:03,136 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 87 transitions, 442 flow [2022-12-13 00:42:03,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 87 transitions, 442 flow [2022-12-13 00:42:03,453 INFO L130 PetriNetUnfolder]: 3614/6388 cut-off events. [2022-12-13 00:42:03,453 INFO L131 PetriNetUnfolder]: For 4857/6165 co-relation queries the response was YES. [2022-12-13 00:42:03,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19380 conditions, 6388 events. 3614/6388 cut-off events. For 4857/6165 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 51140 event pairs, 199 based on Foata normal form. 30/2907 useless extension candidates. Maximal degree in co-relation 19362. Up to 4456 conditions per place. [2022-12-13 00:42:03,502 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 87 transitions, 442 flow [2022-12-13 00:42:03,502 INFO L226 LiptonReduction]: Number of co-enabled transitions 1936 [2022-12-13 00:42:03,521 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:42:03,522 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 387 [2022-12-13 00:42:03,522 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 87 transitions, 442 flow [2022-12-13 00:42:03,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:42:03,522 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:42:03,522 INFO L214 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-13 00:42:03,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:42:03,522 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-13 00:42:03,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:42:03,523 INFO L85 PathProgramCache]: Analyzing trace with hash -680333368, now seen corresponding path program 1 times [2022-12-13 00:42:03,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:42:03,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694570621] [2022-12-13 00:42:03,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:42:03,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:42:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:42:03,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:42:03,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:42:03,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694570621] [2022-12-13 00:42:03,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694570621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:42:03,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:42:03,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:42:03,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129502014] [2022-12-13 00:42:03,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:42:03,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:42:03,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:42:03,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:42:03,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:42:03,836 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2022-12-13 00:42:03,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 87 transitions, 442 flow. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:42:03,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:42:03,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2022-12-13 00:42:03,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:42:04,519 INFO L130 PetriNetUnfolder]: 6311/9569 cut-off events. [2022-12-13 00:42:04,519 INFO L131 PetriNetUnfolder]: For 7328/7328 co-relation queries the response was YES. [2022-12-13 00:42:04,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33006 conditions, 9569 events. 6311/9569 cut-off events. For 7328/7328 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 59134 event pairs, 230 based on Foata normal form. 594/6516 useless extension candidates. Maximal degree in co-relation 32985. Up to 3339 conditions per place. [2022-12-13 00:42:04,562 INFO L137 encePairwiseOnDemand]: 28/42 looper letters, 55 selfloop transitions, 49 changer transitions 9/123 dead transitions. [2022-12-13 00:42:04,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 123 transitions, 793 flow [2022-12-13 00:42:04,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:42:04,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:42:04,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2022-12-13 00:42:04,564 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6746031746031746 [2022-12-13 00:42:04,564 INFO L175 Difference]: Start difference. First operand has 69 places, 87 transitions, 442 flow. Second operand 6 states and 170 transitions. [2022-12-13 00:42:04,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 123 transitions, 793 flow [2022-12-13 00:42:04,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 123 transitions, 772 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 00:42:04,806 INFO L231 Difference]: Finished difference. Result has 72 places, 85 transitions, 546 flow [2022-12-13 00:42:04,806 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=546, PETRI_PLACES=72, PETRI_TRANSITIONS=85} [2022-12-13 00:42:04,807 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -19 predicate places. [2022-12-13 00:42:04,807 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:42:04,807 INFO L89 Accepts]: Start accepts. Operand has 72 places, 85 transitions, 546 flow [2022-12-13 00:42:04,808 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:42:04,808 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:42:04,808 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 85 transitions, 546 flow [2022-12-13 00:42:04,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 85 transitions, 546 flow [2022-12-13 00:42:04,920 INFO L130 PetriNetUnfolder]: 1568/2573 cut-off events. [2022-12-13 00:42:04,920 INFO L131 PetriNetUnfolder]: For 1462/3013 co-relation queries the response was YES. [2022-12-13 00:42:04,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9668 conditions, 2573 events. 1568/2573 cut-off events. For 1462/3013 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 15470 event pairs, 5 based on Foata normal form. 1/914 useless extension candidates. Maximal degree in co-relation 9650. Up to 1702 conditions per place. [2022-12-13 00:42:04,939 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 85 transitions, 546 flow [2022-12-13 00:42:04,939 INFO L226 LiptonReduction]: Number of co-enabled transitions 1668 [2022-12-13 00:42:06,909 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:42:06,911 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2104 [2022-12-13 00:42:06,911 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 82 transitions, 540 flow [2022-12-13 00:42:06,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:42:06,911 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:42:06,911 INFO L214 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, 1] [2022-12-13 00:42:06,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:42:06,911 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-13 00:42:06,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:42:06,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1632182968, now seen corresponding path program 1 times [2022-12-13 00:42:06,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:42:06,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587922559] [2022-12-13 00:42:06,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:42:06,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:42:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:42:45,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:42:45,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:42:45,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587922559] [2022-12-13 00:42:45,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587922559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:42:45,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:42:45,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:42:45,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508130750] [2022-12-13 00:42:45,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:42:45,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:42:45,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:42:45,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:42:45,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:42:45,110 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2022-12-13 00:42:45,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 82 transitions, 540 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:42:45,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:42:45,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2022-12-13 00:42:45,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:42:45,991 INFO L130 PetriNetUnfolder]: 8257/12359 cut-off events. [2022-12-13 00:42:45,991 INFO L131 PetriNetUnfolder]: For 18248/19632 co-relation queries the response was YES. [2022-12-13 00:42:46,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47428 conditions, 12359 events. 8257/12359 cut-off events. For 18248/19632 co-relation queries the response was YES. Maximal size of possible extension queue 669. Compared 76043 event pairs, 328 based on Foata normal form. 636/10263 useless extension candidates. Maximal degree in co-relation 47407. Up to 5556 conditions per place. [2022-12-13 00:42:46,060 INFO L137 encePairwiseOnDemand]: 30/38 looper letters, 113 selfloop transitions, 9 changer transitions 36/180 dead transitions. [2022-12-13 00:42:46,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 180 transitions, 1447 flow [2022-12-13 00:42:46,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:42:46,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:42:46,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2022-12-13 00:42:46,062 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.618421052631579 [2022-12-13 00:42:46,062 INFO L175 Difference]: Start difference. First operand has 67 places, 82 transitions, 540 flow. Second operand 6 states and 141 transitions. [2022-12-13 00:42:46,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 180 transitions, 1447 flow [2022-12-13 00:42:46,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 180 transitions, 1173 flow, removed 61 selfloop flow, removed 5 redundant places. [2022-12-13 00:42:46,766 INFO L231 Difference]: Finished difference. Result has 71 places, 89 transitions, 464 flow [2022-12-13 00:42:46,767 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=464, PETRI_PLACES=71, PETRI_TRANSITIONS=89} [2022-12-13 00:42:46,767 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -20 predicate places. [2022-12-13 00:42:46,767 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:42:46,767 INFO L89 Accepts]: Start accepts. Operand has 71 places, 89 transitions, 464 flow [2022-12-13 00:42:46,768 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:42:46,768 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:42:46,768 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 89 transitions, 464 flow [2022-12-13 00:42:46,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 89 transitions, 464 flow [2022-12-13 00:42:46,963 INFO L130 PetriNetUnfolder]: 3407/5161 cut-off events. [2022-12-13 00:42:46,963 INFO L131 PetriNetUnfolder]: For 2258/2410 co-relation queries the response was YES. [2022-12-13 00:42:46,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14815 conditions, 5161 events. 3407/5161 cut-off events. For 2258/2410 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 31797 event pairs, 12 based on Foata normal form. 1/1568 useless extension candidates. Maximal degree in co-relation 14794. Up to 2620 conditions per place. [2022-12-13 00:42:47,001 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 89 transitions, 464 flow [2022-12-13 00:42:47,001 INFO L226 LiptonReduction]: Number of co-enabled transitions 1658 [2022-12-13 00:42:47,132 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [439] $Ultimate##0-->L805: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y~0_6 1) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_6, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~y~0] and [564] $Ultimate##0-->L831: Formula: (and (= |v_P3Thread1of1ForFork2_#in~arg.base_17| v_P3Thread1of1ForFork2_~arg.base_17) (= v_~a~0_30 v_~__unbuffered_p3_EAX~0_148) (= v_~z~0_50 1) (= v_~a~0_30 1) (= v_P3Thread1of1ForFork2_~arg.offset_17 |v_P3Thread1of1ForFork2_#in~arg.offset_17|)) InVars {P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_17|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_17|} OutVars{~a~0=v_~a~0_30, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_17, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_148, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_17|, ~z~0=v_~z~0_50, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_17, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_17|} AuxVars[] AssignedVars[~a~0, P3Thread1of1ForFork2_~arg.offset, ~__unbuffered_p3_EAX~0, ~z~0, P3Thread1of1ForFork2_~arg.base] [2022-12-13 00:42:47,170 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [439] $Ultimate##0-->L805: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y~0_6 1) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_6, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~y~0] and [568] $Ultimate##0-->L788: Formula: (and (= v_~x$w_buff0_used~0_800 1) (= v_~x$r_buff0_thd1~0_219 v_~x$r_buff1_thd1~0_216) (= v_~x$r_buff0_thd0~0_439 v_~x$r_buff1_thd0~0_441) (= 2 v_~x$w_buff0~0_526) (= v_~x$r_buff0_thd2~0_188 1) (not (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_40| 0)) (= v_~x$r_buff0_thd2~0_189 v_~x$r_buff1_thd2~0_150) (= v_~x$w_buff0_used~0_801 v_~x$w_buff1_used~0_756) (= |v_P1Thread1of1ForFork3_~arg#1.offset_36| |v_P1Thread1of1ForFork3_#in~arg#1.offset_36|) (= v_~y~0_38 v_~__unbuffered_p1_EAX~0_161) (= v_~x$r_buff0_thd4~0_110 v_~x$r_buff1_thd4~0_116) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_40| |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_40|) (= v_~x$r_buff0_thd3~0_100 v_~x$r_buff1_thd3~0_104) (= v_~x$w_buff0~0_527 v_~x$w_buff1~0_489) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_756 256) 0)) (not (= 0 (mod v_~x$w_buff0_used~0_800 256))))) 1 0) |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_40|) (= |v_P1Thread1of1ForFork3_#in~arg#1.base_36| |v_P1Thread1of1ForFork3_~arg#1.base_36|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_527, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_439, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_219, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_110, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_100, ~y~0=v_~y~0_38, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_189, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_36|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_36|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_801} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_526, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_439, P1Thread1of1ForFork3_~arg#1.base=|v_P1Thread1of1ForFork3_~arg#1.base_36|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_219, ~x$w_buff1~0=v_~x$w_buff1~0_489, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_104, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_150, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_756, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_216, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_110, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_100, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_188, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_441, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_40|, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_36|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_116, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_800, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_161, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_40|, ~y~0=v_~y~0_38, P1Thread1of1ForFork3_~arg#1.offset=|v_P1Thread1of1ForFork3_~arg#1.offset_36|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_36|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork3_~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, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork3_~arg#1.offset] [2022-12-13 00:42:47,345 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] $Ultimate##0-->L788: Formula: (and (= v_~x$w_buff0_used~0_805 v_~x$w_buff1_used~0_758) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_42| |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_42|) (= |v_P1Thread1of1ForFork3_#in~arg#1.base_38| |v_P1Thread1of1ForFork3_~arg#1.base_38|) (= v_~x$r_buff0_thd0~0_441 v_~x$r_buff1_thd0~0_443) (= v_~x$w_buff0~0_531 v_~x$w_buff1~0_491) (= v_~x$r_buff0_thd3~0_102 v_~x$r_buff1_thd3~0_106) (= v_~y~0_42 v_~__unbuffered_p1_EAX~0_163) (= v_~x$w_buff0_used~0_804 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_17| v_P2Thread1of1ForFork0_~arg.base_17) (= v_~x$r_buff0_thd4~0_112 v_~x$r_buff1_thd4~0_118) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_42| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_804 256) 0)) (not (= (mod v_~x$w_buff1_used~0_758 256) 0)))) 1 0)) (= |v_P1Thread1of1ForFork3_~arg#1.offset_38| |v_P1Thread1of1ForFork3_#in~arg#1.offset_38|) (= v_~x$r_buff0_thd1~0_221 v_~x$r_buff1_thd1~0_218) (= v_~x$r_buff0_thd2~0_193 v_~x$r_buff1_thd2~0_152) (= v_~y~0_42 1) (= v_~x$r_buff0_thd2~0_192 1) (= |v_P2Thread1of1ForFork0_#in~arg.offset_17| v_P2Thread1of1ForFork0_~arg.offset_17) (not (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_42| 0)) (= 2 v_~x$w_buff0~0_530)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_531, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_441, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_221, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_17|, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_112, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_102, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_193, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_38|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_17|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_38|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_805} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_530, P1Thread1of1ForFork3_~arg#1.base=|v_P1Thread1of1ForFork3_~arg#1.base_38|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_221, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_106, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_218, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_102, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_38|, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_163, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_42|, ~y~0=v_~y~0_42, P1Thread1of1ForFork3_~arg#1.offset=|v_P1Thread1of1ForFork3_~arg#1.offset_38|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_38|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_441, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_17|, ~x$w_buff1~0=v_~x$w_buff1~0_491, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_17, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_152, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_758, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_112, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_192, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_443, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_42|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_118, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_804, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_17|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork3_~arg#1.base, ~x$w_buff1~0, P2Thread1of1ForFork0_~arg.offset, ~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, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P2Thread1of1ForFork0_~arg.base, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, ~y~0, P1Thread1of1ForFork3_~arg#1.offset] and [398] L805-->L808: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~z~0_1) InVars {~z~0=v_~z~0_1} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1, ~z~0=v_~z~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] [2022-12-13 00:42:47,460 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:42:47,461 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 694 [2022-12-13 00:42:47,461 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 88 transitions, 470 flow [2022-12-13 00:42:47,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:42:47,461 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:42:47,461 INFO L214 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, 1] [2022-12-13 00:42:47,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:42:47,461 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-13 00:42:47,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:42:47,462 INFO L85 PathProgramCache]: Analyzing trace with hash 974740740, now seen corresponding path program 2 times [2022-12-13 00:42:47,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:42:47,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895225225] [2022-12-13 00:42:47,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:42:47,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:42:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:43:25,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:43:25,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:43:25,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895225225] [2022-12-13 00:43:25,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895225225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:43:25,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:43:25,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 00:43:25,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407198999] [2022-12-13 00:43:25,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:43:25,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 00:43:25,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:43:25,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 00:43:25,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 00:43:25,430 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2022-12-13 00:43:25,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 88 transitions, 470 flow. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:43:25,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:43:25,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2022-12-13 00:43:25,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:43:27,303 INFO L130 PetriNetUnfolder]: 14244/21371 cut-off events. [2022-12-13 00:43:27,303 INFO L131 PetriNetUnfolder]: For 24964/26263 co-relation queries the response was YES. [2022-12-13 00:43:27,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74219 conditions, 21371 events. 14244/21371 cut-off events. For 24964/26263 co-relation queries the response was YES. Maximal size of possible extension queue 1218. Compared 143717 event pairs, 911 based on Foata normal form. 796/17305 useless extension candidates. Maximal degree in co-relation 74195. Up to 6656 conditions per place. [2022-12-13 00:43:27,459 INFO L137 encePairwiseOnDemand]: 29/41 looper letters, 75 selfloop transitions, 12 changer transitions 180/288 dead transitions. [2022-12-13 00:43:27,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 288 transitions, 2049 flow [2022-12-13 00:43:27,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 00:43:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 00:43:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 262 transitions. [2022-12-13 00:43:27,461 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.532520325203252 [2022-12-13 00:43:27,461 INFO L175 Difference]: Start difference. First operand has 70 places, 88 transitions, 470 flow. Second operand 12 states and 262 transitions. [2022-12-13 00:43:27,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 288 transitions, 2049 flow [2022-12-13 00:43:29,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 288 transitions, 2041 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-13 00:43:29,600 INFO L231 Difference]: Finished difference. Result has 89 places, 83 transitions, 498 flow [2022-12-13 00:43:29,600 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=498, PETRI_PLACES=89, PETRI_TRANSITIONS=83} [2022-12-13 00:43:29,601 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -2 predicate places. [2022-12-13 00:43:29,601 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:43:29,601 INFO L89 Accepts]: Start accepts. Operand has 89 places, 83 transitions, 498 flow [2022-12-13 00:43:29,602 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:43:29,602 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:43:29,602 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 83 transitions, 498 flow [2022-12-13 00:43:29,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 83 transitions, 498 flow [2022-12-13 00:43:29,712 INFO L130 PetriNetUnfolder]: 1227/2238 cut-off events. [2022-12-13 00:43:29,712 INFO L131 PetriNetUnfolder]: For 2196/2225 co-relation queries the response was YES. [2022-12-13 00:43:29,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6857 conditions, 2238 events. 1227/2238 cut-off events. For 2196/2225 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 14786 event pairs, 3 based on Foata normal form. 4/768 useless extension candidates. Maximal degree in co-relation 6826. Up to 973 conditions per place. [2022-12-13 00:43:29,733 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 83 transitions, 498 flow [2022-12-13 00:43:29,733 INFO L226 LiptonReduction]: Number of co-enabled transitions 1280 [2022-12-13 00:43:29,923 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [575] $Ultimate##0-->L788: Formula: (and (= v_~x$r_buff0_thd3~0_110 v_~x$r_buff1_thd3~0_114) (= v_~x$w_buff0_used~0_824 v_~x$w_buff1_used~0_772) (= 2 v_~x$w_buff0~0_543) (= v_~x$r_buff0_thd2~0_208 v_~x$r_buff1_thd2~0_162) (= v_~x$r_buff0_thd0~0_445 v_~x$r_buff1_thd0~0_447) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_46| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_772 256) 0)) (not (= (mod v_~x$w_buff0_used~0_823 256) 0)))) 1 0)) (not (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_46| 0)) (= |v_P1Thread1of1ForFork3_#in~arg#1.base_42| |v_P1Thread1of1ForFork3_~arg#1.base_42|) (= v_~x$r_buff0_thd4~0_116 v_~x$r_buff1_thd4~0_122) (= v_~x$r_buff0_thd2~0_207 1) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_46| |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_46|) (= v_~x$w_buff0_used~0_823 1) (= v_~x$w_buff0~0_544 v_~x$w_buff1~0_500) (= v_~y~0_52 v_~__unbuffered_p1_EAX~0_167) (= v_~x$r_buff0_thd1~0_227 v_~x$r_buff1_thd1~0_222) (= |v_P1Thread1of1ForFork3_~arg#1.offset_42| |v_P1Thread1of1ForFork3_#in~arg#1.offset_42|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_544, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_445, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_116, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_110, ~y~0=v_~y~0_52, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_208, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_42|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_42|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_824} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_543, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_445, P1Thread1of1ForFork3_~arg#1.base=|v_P1Thread1of1ForFork3_~arg#1.base_42|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ~x$w_buff1~0=v_~x$w_buff1~0_500, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_114, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_162, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_772, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_222, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_116, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_110, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_207, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_447, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_46|, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_42|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_122, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_823, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_167, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_46|, ~y~0=v_~y~0_52, P1Thread1of1ForFork3_~arg#1.offset=|v_P1Thread1of1ForFork3_~arg#1.offset_42|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_42|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork3_~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, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork3_~arg#1.offset] and [574] $Ultimate##0-->L815: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_111 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_819 256) 0))) (.cse5 (not (= 0 (mod v_~x$r_buff0_thd3~0_107 256))))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_820 256) 0)) .cse5)) (.cse2 (and .cse5 .cse4)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_769 256) 0))))) (and (= |v_P2Thread1of1ForFork0_#in~arg.base_25| v_P2Thread1of1ForFork0_~arg.base_25) (= v_~z~0_72 v_~__unbuffered_p2_EAX~0_179) (= (ite .cse0 v_~x$w_buff0~0_541 (ite .cse1 v_~x$w_buff1~0_498 v_~x~0_715)) v_~x~0_714) (= |v_P2Thread1of1ForFork0_#in~arg.offset_25| v_P2Thread1of1ForFork0_~arg.offset_25) (= (ite .cse2 0 v_~x$r_buff0_thd3~0_107) v_~x$r_buff0_thd3~0_106) (= v_~y~0_50 1) (= v_~x$w_buff0_used~0_819 (ite .cse0 0 v_~x$w_buff0_used~0_820)) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_769) v_~x$w_buff1_used~0_768) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_768 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd3~0_106 256) 0)))) 0 v_~x$r_buff1_thd3~0_111) v_~x$r_buff1_thd3~0_110)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_541, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_25|, ~x$w_buff1~0=v_~x$w_buff1~0_498, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_111, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_769, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_107, ~z~0=v_~z~0_72, ~x~0=v_~x~0_715, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_820} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_541, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_25|, ~x$w_buff1~0=v_~x$w_buff1~0_498, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_25, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_110, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_768, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_106, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_819, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_179, ~z~0=v_~z~0_72, ~y~0=v_~y~0_50, ~x~0=v_~x~0_714, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_25|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd3~0, ~y~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:43:30,132 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 00:43:30,133 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 532 [2022-12-13 00:43:30,133 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 81 transitions, 511 flow [2022-12-13 00:43:30,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:43:30,133 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:43:30,133 INFO L214 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-13 00:43:30,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:43:30,133 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-13 00:43:30,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:43:30,134 INFO L85 PathProgramCache]: Analyzing trace with hash -638893510, now seen corresponding path program 1 times [2022-12-13 00:43:30,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:43:30,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307089295] [2022-12-13 00:43:30,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:43:30,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:43:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:44:11,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:44:11,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:44:11,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307089295] [2022-12-13 00:44:11,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307089295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:44:11,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:44:11,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:44:11,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737187789] [2022-12-13 00:44:11,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:44:11,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:44:11,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:44:11,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:44:11,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:44:11,357 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2022-12-13 00:44:11,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 81 transitions, 511 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:44:11,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:44:11,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2022-12-13 00:44:11,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:44:12,083 INFO L130 PetriNetUnfolder]: 5291/8178 cut-off events. [2022-12-13 00:44:12,083 INFO L131 PetriNetUnfolder]: For 29409/29871 co-relation queries the response was YES. [2022-12-13 00:44:12,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33522 conditions, 8178 events. 5291/8178 cut-off events. For 29409/29871 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 51981 event pairs, 527 based on Foata normal form. 351/6421 useless extension candidates. Maximal degree in co-relation 33488. Up to 3661 conditions per place. [2022-12-13 00:44:12,139 INFO L137 encePairwiseOnDemand]: 29/36 looper letters, 88 selfloop transitions, 11 changer transitions 10/130 dead transitions. [2022-12-13 00:44:12,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 130 transitions, 1007 flow [2022-12-13 00:44:12,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:44:12,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:44:12,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2022-12-13 00:44:12,140 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5444444444444444 [2022-12-13 00:44:12,141 INFO L175 Difference]: Start difference. First operand has 80 places, 81 transitions, 511 flow. Second operand 5 states and 98 transitions. [2022-12-13 00:44:12,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 130 transitions, 1007 flow [2022-12-13 00:44:12,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 130 transitions, 922 flow, removed 33 selfloop flow, removed 13 redundant places. [2022-12-13 00:44:12,668 INFO L231 Difference]: Finished difference. Result has 73 places, 84 transitions, 517 flow [2022-12-13 00:44:12,668 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=517, PETRI_PLACES=73, PETRI_TRANSITIONS=84} [2022-12-13 00:44:12,669 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -18 predicate places. [2022-12-13 00:44:12,669 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:44:12,669 INFO L89 Accepts]: Start accepts. Operand has 73 places, 84 transitions, 517 flow [2022-12-13 00:44:12,669 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:44:12,669 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:44:12,669 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 84 transitions, 517 flow [2022-12-13 00:44:12,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 84 transitions, 517 flow [2022-12-13 00:44:12,817 INFO L130 PetriNetUnfolder]: 2244/3765 cut-off events. [2022-12-13 00:44:12,818 INFO L131 PetriNetUnfolder]: For 2690/2992 co-relation queries the response was YES. [2022-12-13 00:44:12,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11044 conditions, 3765 events. 2244/3765 cut-off events. For 2690/2992 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 27745 event pairs, 8 based on Foata normal form. 22/1258 useless extension candidates. Maximal degree in co-relation 11022. Up to 1783 conditions per place. [2022-12-13 00:44:12,847 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 84 transitions, 517 flow [2022-12-13 00:44:12,848 INFO L226 LiptonReduction]: Number of co-enabled transitions 1282 [2022-12-13 00:44:12,849 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:44:12,850 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-13 00:44:12,850 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 84 transitions, 517 flow [2022-12-13 00:44:12,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:44:12,850 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:44:12,850 INFO L214 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-13 00:44:12,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:44:12,851 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-13 00:44:12,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:44:12,851 INFO L85 PathProgramCache]: Analyzing trace with hash 143348643, now seen corresponding path program 1 times [2022-12-13 00:44:12,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:44:12,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482274831] [2022-12-13 00:44:12,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:44:12,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:44:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:44:12,879 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:44:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:44:12,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:44:12,964 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:44:12,965 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 00:44:12,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 00:44:12,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 00:44:12,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 00:44:12,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 00:44:12,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 00:44:12,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 00:44:12,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 00:44:12,967 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:44:12,971 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:44:12,971 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:44:13,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:44:13 BasicIcfg [2022-12-13 00:44:13,047 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:44:13,047 INFO L158 Benchmark]: Toolchain (without parser) took 163372.50ms. Allocated memory was 220.2MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 194.7MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2022-12-13 00:44:13,048 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 220.2MB. Free memory is still 197.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:44:13,048 INFO L158 Benchmark]: CACSL2BoogieTranslator took 627.87ms. Allocated memory is still 220.2MB. Free memory was 194.7MB in the beginning and 166.3MB in the end (delta: 28.4MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-13 00:44:13,048 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.08ms. Allocated memory is still 220.2MB. Free memory was 166.3MB in the beginning and 163.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:44:13,048 INFO L158 Benchmark]: Boogie Preprocessor took 18.80ms. Allocated memory is still 220.2MB. Free memory was 163.8MB in the beginning and 161.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:44:13,048 INFO L158 Benchmark]: RCFGBuilder took 517.67ms. Allocated memory is still 220.2MB. Free memory was 161.7MB in the beginning and 122.9MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-12-13 00:44:13,048 INFO L158 Benchmark]: TraceAbstraction took 162157.13ms. Allocated memory was 220.2MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 121.8MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-12-13 00:44:13,049 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 220.2MB. Free memory is still 197.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 627.87ms. Allocated memory is still 220.2MB. Free memory was 194.7MB in the beginning and 166.3MB in the end (delta: 28.4MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.08ms. Allocated memory is still 220.2MB. Free memory was 166.3MB in the beginning and 163.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.80ms. Allocated memory is still 220.2MB. Free memory was 163.8MB in the beginning and 161.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 517.67ms. Allocated memory is still 220.2MB. Free memory was 161.7MB in the beginning and 122.9MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 162157.13ms. Allocated memory was 220.2MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 121.8MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.0s, 140 PlacesBefore, 91 PlacesAfterwards, 129 TransitionsBefore, 78 TransitionsAfterwards, 3256 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 53 ConcurrentYvCompositions, 4 ChoiceCompositions, 103 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4722, independent: 4498, independent conditional: 4498, independent unconditional: 0, dependent: 224, dependent conditional: 224, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4722, independent: 4498, independent conditional: 0, independent unconditional: 4498, dependent: 224, dependent conditional: 0, dependent unconditional: 224, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4722, independent: 4498, independent conditional: 0, independent unconditional: 4498, dependent: 224, dependent conditional: 0, dependent unconditional: 224, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4722, independent: 4498, independent conditional: 0, independent unconditional: 4498, dependent: 224, dependent conditional: 0, dependent unconditional: 224, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2969, independent: 2888, independent conditional: 0, independent unconditional: 2888, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2969, independent: 2850, independent conditional: 0, independent unconditional: 2850, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 119, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 574, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 528, dependent conditional: 0, dependent unconditional: 528, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4722, independent: 1610, independent conditional: 0, independent unconditional: 1610, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 2969, unknown conditional: 0, unknown unconditional: 2969] , Statistics on independence cache: Total cache size (in pairs): 4674, Positive cache size: 4593, Positive conditional cache size: 0, Positive unconditional cache size: 4593, Negative cache size: 81, Negative conditional cache size: 0, Negative unconditional cache size: 81, 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.4s, 55 PlacesBefore, 55 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 1150 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 562, independent: 516, independent conditional: 516, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 562, independent: 516, independent conditional: 19, independent unconditional: 497, dependent: 46, dependent conditional: 1, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 562, independent: 516, independent conditional: 19, independent unconditional: 497, dependent: 46, dependent conditional: 1, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 562, independent: 516, independent conditional: 19, independent unconditional: 497, dependent: 46, dependent conditional: 1, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 493, independent: 460, independent conditional: 19, independent unconditional: 441, dependent: 33, dependent conditional: 1, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 493, independent: 379, independent conditional: 0, independent unconditional: 379, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 114, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 33, dependent conditional: 1, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 165, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 99, dependent conditional: 9, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 562, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 493, unknown conditional: 20, unknown unconditional: 473] , Statistics on independence cache: Total cache size (in pairs): 493, Positive cache size: 460, Positive conditional cache size: 19, Positive unconditional cache size: 441, Negative cache size: 33, Negative conditional cache size: 1, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 55 PlacesBefore, 54 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 1094 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 959, independent: 874, independent conditional: 874, independent unconditional: 0, dependent: 85, dependent conditional: 85, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 959, independent: 874, independent conditional: 24, independent unconditional: 850, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 959, independent: 874, independent conditional: 0, independent unconditional: 874, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 959, independent: 874, independent conditional: 0, independent unconditional: 874, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 55, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 55, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 959, independent: 823, independent conditional: 0, independent unconditional: 823, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 55, unknown conditional: 0, unknown unconditional: 55] , Statistics on independence cache: Total cache size (in pairs): 569, Positive cache size: 532, Positive conditional cache size: 20, Positive unconditional cache size: 512, Negative cache size: 37, Negative conditional cache size: 1, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 1042 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 447, independent: 406, independent conditional: 406, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 447, independent: 406, independent conditional: 16, independent unconditional: 390, dependent: 41, dependent conditional: 4, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 447, independent: 406, independent conditional: 16, independent unconditional: 390, dependent: 41, dependent conditional: 4, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 447, independent: 406, independent conditional: 16, independent unconditional: 390, dependent: 41, dependent conditional: 4, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 8, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 447, independent: 406, independent conditional: 16, independent unconditional: 390, dependent: 37, dependent conditional: 2, dependent unconditional: 35, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 573, Positive cache size: 532, Positive conditional cache size: 20, Positive unconditional cache size: 512, Negative cache size: 41, Negative conditional cache size: 3, Negative unconditional cache size: 38, 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, 58 PlacesBefore, 58 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 1262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 258, independent: 238, independent conditional: 238, 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: 258, independent: 238, independent conditional: 33, independent unconditional: 205, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 258, independent: 238, independent conditional: 33, independent unconditional: 205, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 258, independent: 238, independent conditional: 33, independent unconditional: 205, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 258, independent: 238, independent conditional: 33, independent unconditional: 205, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 575, Positive cache size: 532, Positive conditional cache size: 20, Positive unconditional cache size: 512, Negative cache size: 43, Negative conditional cache size: 5, Negative unconditional cache size: 38, 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, 61 PlacesBefore, 61 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 1500 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 268, independent: 250, independent conditional: 250, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 268, independent: 250, independent conditional: 68, independent unconditional: 182, dependent: 18, dependent conditional: 4, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 268, independent: 250, independent conditional: 68, independent unconditional: 182, dependent: 18, dependent conditional: 4, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 268, independent: 250, independent conditional: 68, independent unconditional: 182, dependent: 18, dependent conditional: 4, dependent unconditional: 14, 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: 268, independent: 250, independent conditional: 68, independent unconditional: 182, dependent: 18, dependent conditional: 4, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 575, Positive cache size: 532, Positive conditional cache size: 20, Positive unconditional cache size: 512, Negative cache size: 43, Negative conditional cache size: 5, Negative unconditional cache size: 38, 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, 64 PlacesBefore, 64 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 1866 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 227, independent: 209, independent conditional: 209, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 227, independent: 209, independent conditional: 68, independent unconditional: 141, dependent: 18, dependent conditional: 4, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 227, independent: 209, independent conditional: 68, independent unconditional: 141, dependent: 18, dependent conditional: 4, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 227, independent: 209, independent conditional: 68, independent unconditional: 141, dependent: 18, dependent conditional: 4, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 227, independent: 209, independent conditional: 68, independent unconditional: 141, dependent: 17, dependent conditional: 4, dependent unconditional: 13, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 576, Positive cache size: 532, Positive conditional cache size: 20, Positive unconditional cache size: 512, Negative cache size: 44, Negative conditional cache size: 5, Negative unconditional cache size: 39, 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, 67 PlacesBefore, 67 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 1890 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 232, independent: 214, independent conditional: 214, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 232, independent: 214, independent conditional: 68, independent unconditional: 146, dependent: 18, dependent conditional: 4, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 232, independent: 214, independent conditional: 68, independent unconditional: 146, dependent: 18, dependent conditional: 4, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 232, independent: 214, independent conditional: 68, independent unconditional: 146, dependent: 18, dependent conditional: 4, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 232, independent: 211, independent conditional: 68, independent unconditional: 143, dependent: 18, dependent conditional: 4, dependent unconditional: 14, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 579, Positive cache size: 535, Positive conditional cache size: 20, Positive unconditional cache size: 515, Negative cache size: 44, Negative conditional cache size: 5, Negative unconditional cache size: 39, 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, 69 PlacesBefore, 69 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 1936 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 218, independent: 203, independent conditional: 203, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 218, independent: 203, independent conditional: 70, independent unconditional: 133, dependent: 15, dependent conditional: 4, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 218, independent: 203, independent conditional: 70, independent unconditional: 133, dependent: 15, dependent conditional: 4, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 218, independent: 203, independent conditional: 70, independent unconditional: 133, dependent: 15, dependent conditional: 4, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, 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: 218, independent: 200, independent conditional: 69, independent unconditional: 131, dependent: 15, dependent conditional: 4, dependent unconditional: 11, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 582, Positive cache size: 538, Positive conditional cache size: 21, Positive unconditional cache size: 517, Negative cache size: 44, Negative conditional cache size: 5, Negative unconditional cache size: 39, 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: 2.0s, 70 PlacesBefore, 67 PlacesAfterwards, 85 TransitionsBefore, 82 TransitionsAfterwards, 1668 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 402, independent: 378, independent conditional: 378, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 402, independent: 378, independent conditional: 173, independent unconditional: 205, dependent: 24, dependent conditional: 6, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 402, independent: 378, independent conditional: 173, independent unconditional: 205, dependent: 24, dependent conditional: 6, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 402, independent: 378, independent conditional: 173, independent unconditional: 205, dependent: 24, dependent conditional: 6, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 402, independent: 378, independent conditional: 173, independent unconditional: 205, dependent: 23, dependent conditional: 5, dependent unconditional: 18, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 618, Positive cache size: 573, Positive conditional cache size: 22, Positive unconditional cache size: 551, Negative cache size: 45, Negative conditional cache size: 6, Negative unconditional cache size: 39, 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.5s, 71 PlacesBefore, 70 PlacesAfterwards, 89 TransitionsBefore, 88 TransitionsAfterwards, 1658 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 250, independent: 241, independent conditional: 241, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 250, independent: 241, independent conditional: 129, independent unconditional: 112, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 250, independent: 241, independent conditional: 102, independent unconditional: 139, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 250, independent: 241, independent conditional: 102, independent unconditional: 139, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 8, independent unconditional: 5, 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: 13, independent conditional: 0, independent unconditional: 13, 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: 250, independent: 228, independent conditional: 94, independent unconditional: 134, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 13, unknown conditional: 8, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 725, Positive cache size: 680, Positive conditional cache size: 32, Positive unconditional cache size: 648, Negative cache size: 45, Negative conditional cache size: 6, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 27, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 82 PlacesBefore, 80 PlacesAfterwards, 83 TransitionsBefore, 81 TransitionsAfterwards, 1280 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 148, independent: 141, independent conditional: 141, 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: 148, independent: 141, independent conditional: 80, independent unconditional: 61, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 155, independent: 141, independent conditional: 77, independent unconditional: 64, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 155, independent: 141, independent conditional: 77, independent unconditional: 64, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 10, independent unconditional: 7, 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: 19, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 155, independent: 124, independent conditional: 67, independent unconditional: 57, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 19, unknown conditional: 12, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 804, Positive cache size: 757, Positive conditional cache size: 43, Positive unconditional cache size: 714, Negative cache size: 47, Negative conditional cache size: 8, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 73 PlacesBefore, 73 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 1282 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 804, Positive cache size: 757, Positive conditional cache size: 43, Positive unconditional cache size: 714, Negative cache size: 47, Negative conditional cache size: 8, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - 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_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t993; [L859] FCALL, FORK 0 pthread_create(&t993, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t993, ((void *)0), P0, ((void *)0))=10, t993={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] [L860] 0 pthread_t t994; [L861] FCALL, FORK 0 pthread_create(&t994, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t994, ((void *)0), P1, ((void *)0))=11, t993={7:0}, t994={8: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] [L862] 0 pthread_t t995; [L863] FCALL, FORK 0 pthread_create(&t995, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t995, ((void *)0), P2, ((void *)0))=12, t993={7:0}, t994={8:0}, t995={9: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] [L864] 0 pthread_t t996; [L865] FCALL, FORK 0 pthread_create(&t996, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t996, ((void *)0), P3, ((void *)0))=13, t993={7:0}, t994={8:0}, t995={9:0}, t996={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] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 [L787] 2 __unbuffered_p1_EAX = y [L804] 2 y = 1 [L807] 2 __unbuffered_p2_EAX = z [L810] 2 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L811] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L812] 2 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 [L813] 2 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L814] 2 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_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=0] [L824] 4 z = 1 [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L833] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L754] 1 b = 1 [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1] [L790] 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) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 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 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 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_p2_EAX=0, __unbuffered_p3_EAX=1, __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}, b=1, 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=1] [L760] 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) [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] 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 [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] 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=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1] [L836] 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) [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] 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 [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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}, b=1, 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=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 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) [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] 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 [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] 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 [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] 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) [L883] 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)) [L884] 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)) [L885] 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)) [L886] 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)) [L887] 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)) [L888] 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)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, 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=1] - 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: 861]: 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: 863]: 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: 865]: 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: 859]: 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, 171 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: 162.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 26.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 568 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 568 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 171 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1600 IncrementalHoareTripleChecker+Invalid, 1771 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 171 mSolverCounterUnsat, 25 mSDtfsCounter, 1600 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=546occurred in iteration=9, InterpolantAutomatonStates: 58, 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.5s SatisfiabilityAnalysisTime, 119.6s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 3909 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-13 00:44:13,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...