/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix006_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:17:39,823 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:17:39,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:17:39,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:17:39,877 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:17:39,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:17:39,879 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:17:39,881 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:17:39,883 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:17:39,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:17:39,892 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:17:39,895 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:17:39,895 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:17:39,898 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:17:39,899 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:17:39,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:17:39,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:17:39,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:17:39,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:17:39,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:17:39,911 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:17:39,915 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:17:39,916 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:17:39,917 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:17:39,920 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:17:39,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:17:39,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:17:39,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:17:39,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:17:39,922 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:17:39,922 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:17:39,923 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:17:39,924 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:17:39,924 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:17:39,925 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:17:39,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:17:39,926 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:17:39,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:17:39,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:17:39,927 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:17:39,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:17:39,934 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:17:39,968 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:17:39,968 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:17:39,970 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:17:39,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:17:39,970 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:17:39,971 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:17:39,971 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:17:39,971 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:17:39,971 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:17:39,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:17:39,972 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:17:39,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:17:39,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:17:39,972 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:17:39,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:17:39,973 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:17:39,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:17:39,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:17:39,973 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:17:39,973 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:17:39,973 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:17:39,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:17:39,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:17:39,974 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:17:39,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:17:39,974 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:17:39,974 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:17:39,974 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:17:39,975 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:17:39,975 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 09:17:40,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:17:40,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:17:40,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:17:40,318 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:17:40,320 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:17:40,321 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_tso.oepc.i [2022-12-13 09:17:41,441 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:17:41,692 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:17:41,693 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_tso.oepc.i [2022-12-13 09:17:41,709 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ca01cda1/0874be389608446a8c842b7bb7cd41e0/FLAG67711f13d [2022-12-13 09:17:41,720 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ca01cda1/0874be389608446a8c842b7bb7cd41e0 [2022-12-13 09:17:41,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:17:41,722 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:17:41,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:17:41,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:17:41,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:17:41,725 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:17:41" (1/1) ... [2022-12-13 09:17:41,726 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@485b3ce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:41, skipping insertion in model container [2022-12-13 09:17:41,726 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:17:41" (1/1) ... [2022-12-13 09:17:41,730 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:17:41,765 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:17:41,870 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/mix006_tso.oepc.i[949,962] [2022-12-13 09:17:41,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:41,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:41,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:41,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:41,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:41,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:41,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:41,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:41,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:41,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:41,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:41,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:41,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:41,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:41,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:41,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:41,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:41,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:41,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:41,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:41,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:42,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:42,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:42,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:42,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:42,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:42,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:42,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:42,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:42,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:42,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:42,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:42,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:42,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:42,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:17:42,052 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:17:42,061 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/mix006_tso.oepc.i[949,962] [2022-12-13 09:17:42,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:42,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:42,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:42,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:42,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:42,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:42,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:42,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:42,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:42,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:42,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:42,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:42,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:42,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:42,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:42,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:42,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:42,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:42,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:42,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:42,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:42,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:42,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:42,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:42,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:42,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:42,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:42,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:42,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:42,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:42,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:42,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:42,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:17:42,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:17:42,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:17:42,129 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:17:42,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:42 WrapperNode [2022-12-13 09:17:42,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:17:42,131 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:17:42,131 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:17:42,131 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:17:42,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:42" (1/1) ... [2022-12-13 09:17:42,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:42" (1/1) ... [2022-12-13 09:17:42,205 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 256 [2022-12-13 09:17:42,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:17:42,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:17:42,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:17:42,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:17:42,212 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:42" (1/1) ... [2022-12-13 09:17:42,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:42" (1/1) ... [2022-12-13 09:17:42,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:42" (1/1) ... [2022-12-13 09:17:42,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:42" (1/1) ... [2022-12-13 09:17:42,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:42" (1/1) ... [2022-12-13 09:17:42,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:42" (1/1) ... [2022-12-13 09:17:42,233 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:42" (1/1) ... [2022-12-13 09:17:42,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:42" (1/1) ... [2022-12-13 09:17:42,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:17:42,254 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:17:42,254 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:17:42,254 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:17:42,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:42" (1/1) ... [2022-12-13 09:17:42,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:17:42,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:17:42,297 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 09:17:42,315 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 09:17:42,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:17:42,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:17:42,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:17:42,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:17:42,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:17:42,328 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:17:42,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:17:42,328 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:17:42,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:17:42,328 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 09:17:42,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 09:17:42,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:17:42,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:17:42,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:17:42,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:17:42,329 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 09:17:42,492 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:17:42,493 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:17:42,800 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:17:43,023 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:17:43,024 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:17:43,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:17:43 BoogieIcfgContainer [2022-12-13 09:17:43,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:17:43,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:17:43,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:17:43,031 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:17:43,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:17:41" (1/3) ... [2022-12-13 09:17:43,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61049d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:17:43, skipping insertion in model container [2022-12-13 09:17:43,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:17:42" (2/3) ... [2022-12-13 09:17:43,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61049d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:17:43, skipping insertion in model container [2022-12-13 09:17:43,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:17:43" (3/3) ... [2022-12-13 09:17:43,035 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006_tso.oepc.i [2022-12-13 09:17:43,049 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:17:43,050 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-12-13 09:17:43,050 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:17:43,106 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:17:43,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 129 transitions, 273 flow [2022-12-13 09:17:43,204 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-13 09:17:43,204 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:17:43,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-13 09:17:43,212 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 129 transitions, 273 flow [2022-12-13 09:17:43,217 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 126 transitions, 261 flow [2022-12-13 09:17:43,219 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:17:43,232 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 126 transitions, 261 flow [2022-12-13 09:17:43,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 126 transitions, 261 flow [2022-12-13 09:17:43,265 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-13 09:17:43,265 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:17:43,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-13 09:17:43,269 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 126 transitions, 261 flow [2022-12-13 09:17:43,269 INFO L226 LiptonReduction]: Number of co-enabled transitions 2186 [2022-12-13 09:17:51,866 INFO L241 LiptonReduction]: Total number of compositions: 103 [2022-12-13 09:17:51,891 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:17:51,898 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;@4471e2c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:17:51,899 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-13 09:17:51,912 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-13 09:17:51,912 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:17:51,912 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:17:51,913 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 09:17:51,914 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 09:17:51,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:17:51,921 INFO L85 PathProgramCache]: Analyzing trace with hash 658685776, now seen corresponding path program 1 times [2022-12-13 09:17:51,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:17:51,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157821303] [2022-12-13 09:17:51,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:17:51,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:17:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:17:52,264 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 09:17:52,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:17:52,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157821303] [2022-12-13 09:17:52,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157821303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:17:52,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:17:52,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:17:52,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134297262] [2022-12-13 09:17:52,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:17:52,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:17:52,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:17:52,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:17:52,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:17:52,302 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 63 [2022-12-13 09:17:52,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 63 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:52,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:17:52,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 63 [2022-12-13 09:17:52,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:17:55,151 INFO L130 PetriNetUnfolder]: 16128/24156 cut-off events. [2022-12-13 09:17:55,151 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-12-13 09:17:55,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46962 conditions, 24156 events. 16128/24156 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 1264. Compared 167723 event pairs, 3456 based on Foata normal form. 0/14542 useless extension candidates. Maximal degree in co-relation 46951. Up to 20263 conditions per place. [2022-12-13 09:17:55,228 INFO L137 encePairwiseOnDemand]: 59/63 looper letters, 82 selfloop transitions, 2 changer transitions 8/102 dead transitions. [2022-12-13 09:17:55,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 102 transitions, 400 flow [2022-12-13 09:17:55,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:17:55,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:17:55,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2022-12-13 09:17:55,238 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6613756613756614 [2022-12-13 09:17:55,239 INFO L175 Difference]: Start difference. First operand has 73 places, 63 transitions, 135 flow. Second operand 3 states and 125 transitions. [2022-12-13 09:17:55,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 102 transitions, 400 flow [2022-12-13 09:17:55,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 102 transitions, 396 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 09:17:55,244 INFO L231 Difference]: Finished difference. Result has 70 places, 57 transitions, 124 flow [2022-12-13 09:17:55,245 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=70, PETRI_TRANSITIONS=57} [2022-12-13 09:17:55,248 INFO L295 CegarLoopForPetriNet]: 73 programPoint places, -3 predicate places. [2022-12-13 09:17:55,248 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:17:55,249 INFO L89 Accepts]: Start accepts. Operand has 70 places, 57 transitions, 124 flow [2022-12-13 09:17:55,252 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:17:55,253 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:17:55,253 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 57 transitions, 124 flow [2022-12-13 09:17:55,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 57 transitions, 124 flow [2022-12-13 09:17:55,273 INFO L130 PetriNetUnfolder]: 0/57 cut-off events. [2022-12-13 09:17:55,274 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:17:55,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 57 events. 0/57 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 243 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 09:17:55,277 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 57 transitions, 124 flow [2022-12-13 09:17:55,277 INFO L226 LiptonReduction]: Number of co-enabled transitions 1748 [2022-12-13 09:17:55,574 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:17:55,576 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 328 [2022-12-13 09:17:55,576 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 124 flow [2022-12-13 09:17:55,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:55,577 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:17:55,577 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:17:55,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:17:55,577 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 09:17:55,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:17:55,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1636886343, now seen corresponding path program 1 times [2022-12-13 09:17:55,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:17:55,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978116798] [2022-12-13 09:17:55,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:17:55,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:17:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:17:55,767 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 09:17:55,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:17:55,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978116798] [2022-12-13 09:17:55,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978116798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:17:55,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:17:55,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:17:55,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871606713] [2022-12-13 09:17:55,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:17:55,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:17:55,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:17:55,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:17:55,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:17:55,769 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 57 [2022-12-13 09:17:55,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 09:17:55,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:17:55,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 57 [2022-12-13 09:17:55,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:17:57,955 INFO L130 PetriNetUnfolder]: 13513/20957 cut-off events. [2022-12-13 09:17:57,955 INFO L131 PetriNetUnfolder]: For 787/787 co-relation queries the response was YES. [2022-12-13 09:17:57,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40887 conditions, 20957 events. 13513/20957 cut-off events. For 787/787 co-relation queries the response was YES. Maximal size of possible extension queue 1073. Compared 150772 event pairs, 1598 based on Foata normal form. 0/13528 useless extension candidates. Maximal degree in co-relation 40877. Up to 16466 conditions per place. [2022-12-13 09:17:58,000 INFO L137 encePairwiseOnDemand]: 54/57 looper letters, 35 selfloop transitions, 2 changer transitions 44/91 dead transitions. [2022-12-13 09:17:58,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 91 transitions, 356 flow [2022-12-13 09:17:58,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:17:58,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:17:58,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-12-13 09:17:58,002 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6549707602339181 [2022-12-13 09:17:58,002 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 124 flow. Second operand 3 states and 112 transitions. [2022-12-13 09:17:58,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 91 transitions, 356 flow [2022-12-13 09:17:58,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 91 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:17:58,005 INFO L231 Difference]: Finished difference. Result has 65 places, 34 transitions, 78 flow [2022-12-13 09:17:58,005 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=65, PETRI_TRANSITIONS=34} [2022-12-13 09:17:58,005 INFO L295 CegarLoopForPetriNet]: 73 programPoint places, -8 predicate places. [2022-12-13 09:17:58,005 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:17:58,006 INFO L89 Accepts]: Start accepts. Operand has 65 places, 34 transitions, 78 flow [2022-12-13 09:17:58,006 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:17:58,006 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:17:58,006 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 34 transitions, 78 flow [2022-12-13 09:17:58,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 78 flow [2022-12-13 09:17:58,010 INFO L130 PetriNetUnfolder]: 0/34 cut-off events. [2022-12-13 09:17:58,010 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:17:58,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 34 events. 0/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 81 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 09:17:58,011 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 78 flow [2022-12-13 09:17:58,011 INFO L226 LiptonReduction]: Number of co-enabled transitions 654 [2022-12-13 09:17:58,060 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:17:58,061 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-13 09:17:58,061 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 78 flow [2022-12-13 09:17:58,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 09:17:58,062 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:17:58,062 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:17:58,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:17:58,063 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 09:17:58,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:17:58,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1089837765, now seen corresponding path program 1 times [2022-12-13 09:17:58,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:17:58,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788249278] [2022-12-13 09:17:58,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:17:58,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:17:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:17:58,495 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 09:17:58,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:17:58,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788249278] [2022-12-13 09:17:58,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788249278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:17:58,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:17:58,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:17:58,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326206675] [2022-12-13 09:17:58,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:17:58,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:17:58,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:17:58,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:17:58,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:17:58,500 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2022-12-13 09:17:58,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:58,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:17:58,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2022-12-13 09:17:58,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:17:58,948 INFO L130 PetriNetUnfolder]: 2629/4019 cut-off events. [2022-12-13 09:17:58,948 INFO L131 PetriNetUnfolder]: For 118/118 co-relation queries the response was YES. [2022-12-13 09:17:58,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8065 conditions, 4019 events. 2629/4019 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 19961 event pairs, 789 based on Foata normal form. 84/3569 useless extension candidates. Maximal degree in co-relation 8055. Up to 2849 conditions per place. [2022-12-13 09:17:58,968 INFO L137 encePairwiseOnDemand]: 31/34 looper letters, 37 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2022-12-13 09:17:58,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 47 transitions, 182 flow [2022-12-13 09:17:58,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:17:58,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:17:58,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-13 09:17:58,969 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-13 09:17:58,969 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 78 flow. Second operand 3 states and 64 transitions. [2022-12-13 09:17:58,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 47 transitions, 182 flow [2022-12-13 09:17:58,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:17:58,971 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 82 flow [2022-12-13 09:17:58,971 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2022-12-13 09:17:58,971 INFO L295 CegarLoopForPetriNet]: 73 programPoint places, -29 predicate places. [2022-12-13 09:17:58,972 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:17:58,972 INFO L89 Accepts]: Start accepts. Operand has 44 places, 34 transitions, 82 flow [2022-12-13 09:17:58,972 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:17:58,972 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:17:58,972 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 34 transitions, 82 flow [2022-12-13 09:17:58,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 34 transitions, 82 flow [2022-12-13 09:17:58,976 INFO L130 PetriNetUnfolder]: 0/34 cut-off events. [2022-12-13 09:17:58,977 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:17:58,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 0/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 86 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 09:17:58,977 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 34 transitions, 82 flow [2022-12-13 09:17:58,977 INFO L226 LiptonReduction]: Number of co-enabled transitions 648 [2022-12-13 09:17:58,992 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:17:58,994 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 09:17:58,994 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 82 flow [2022-12-13 09:17:58,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:58,994 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:17:58,994 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:17:58,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:17:58,994 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 09:17:58,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:17:58,995 INFO L85 PathProgramCache]: Analyzing trace with hash -705256830, now seen corresponding path program 1 times [2022-12-13 09:17:58,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:17:58,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796481801] [2022-12-13 09:17:58,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:17:58,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:17:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:17:59,186 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 09:17:59,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:17:59,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796481801] [2022-12-13 09:17:59,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796481801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:17:59,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:17:59,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:17:59,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323614058] [2022-12-13 09:17:59,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:17:59,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:17:59,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:17:59,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:17:59,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:17:59,189 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2022-12-13 09:17:59,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:59,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:17:59,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2022-12-13 09:17:59,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:17:59,461 INFO L130 PetriNetUnfolder]: 1719/2693 cut-off events. [2022-12-13 09:17:59,462 INFO L131 PetriNetUnfolder]: For 215/215 co-relation queries the response was YES. [2022-12-13 09:17:59,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5620 conditions, 2693 events. 1719/2693 cut-off events. For 215/215 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 14050 event pairs, 439 based on Foata normal form. 40/2310 useless extension candidates. Maximal degree in co-relation 5609. Up to 1961 conditions per place. [2022-12-13 09:17:59,471 INFO L137 encePairwiseOnDemand]: 31/34 looper letters, 35 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2022-12-13 09:17:59,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 47 transitions, 187 flow [2022-12-13 09:17:59,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:17:59,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:17:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-13 09:17:59,475 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 09:17:59,475 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 82 flow. Second operand 3 states and 68 transitions. [2022-12-13 09:17:59,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 47 transitions, 187 flow [2022-12-13 09:17:59,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 47 transitions, 181 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:17:59,478 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 86 flow [2022-12-13 09:17:59,478 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2022-12-13 09:17:59,479 INFO L295 CegarLoopForPetriNet]: 73 programPoint places, -28 predicate places. [2022-12-13 09:17:59,480 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:17:59,480 INFO L89 Accepts]: Start accepts. Operand has 45 places, 34 transitions, 86 flow [2022-12-13 09:17:59,481 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:17:59,481 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:17:59,481 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 34 transitions, 86 flow [2022-12-13 09:17:59,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 34 transitions, 86 flow [2022-12-13 09:17:59,487 INFO L130 PetriNetUnfolder]: 0/34 cut-off events. [2022-12-13 09:17:59,487 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 09:17:59,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 34 events. 0/34 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 86 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 09:17:59,488 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 34 transitions, 86 flow [2022-12-13 09:17:59,488 INFO L226 LiptonReduction]: Number of co-enabled transitions 642 [2022-12-13 09:17:59,580 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:17:59,582 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 09:17:59,582 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 86 flow [2022-12-13 09:17:59,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:59,582 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:17:59,582 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:17:59,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:17:59,582 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 09:17:59,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:17:59,583 INFO L85 PathProgramCache]: Analyzing trace with hash -643570282, now seen corresponding path program 1 times [2022-12-13 09:17:59,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:17:59,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752830459] [2022-12-13 09:17:59,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:17:59,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:17:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:17:59,810 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 09:17:59,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:17:59,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752830459] [2022-12-13 09:17:59,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752830459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:17:59,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:17:59,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:17:59,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576896077] [2022-12-13 09:17:59,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:17:59,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:17:59,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:17:59,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:17:59,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:17:59,813 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2022-12-13 09:17:59,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:17:59,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:17:59,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2022-12-13 09:17:59,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:18:00,133 INFO L130 PetriNetUnfolder]: 2225/3417 cut-off events. [2022-12-13 09:18:00,134 INFO L131 PetriNetUnfolder]: For 468/468 co-relation queries the response was YES. [2022-12-13 09:18:00,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7583 conditions, 3417 events. 2225/3417 cut-off events. For 468/468 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 17529 event pairs, 599 based on Foata normal form. 60/2567 useless extension candidates. Maximal degree in co-relation 7571. Up to 3166 conditions per place. [2022-12-13 09:18:00,148 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 39 selfloop transitions, 10 changer transitions 0/56 dead transitions. [2022-12-13 09:18:00,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 236 flow [2022-12-13 09:18:00,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:18:00,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:18:00,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-12-13 09:18:00,152 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.696078431372549 [2022-12-13 09:18:00,152 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 86 flow. Second operand 3 states and 71 transitions. [2022-12-13 09:18:00,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 236 flow [2022-12-13 09:18:00,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:18:00,154 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 150 flow [2022-12-13 09:18:00,154 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2022-12-13 09:18:00,156 INFO L295 CegarLoopForPetriNet]: 73 programPoint places, -27 predicate places. [2022-12-13 09:18:00,156 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:18:00,156 INFO L89 Accepts]: Start accepts. Operand has 46 places, 43 transitions, 150 flow [2022-12-13 09:18:00,158 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:18:00,158 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:18:00,159 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 43 transitions, 150 flow [2022-12-13 09:18:00,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 43 transitions, 150 flow [2022-12-13 09:18:00,192 INFO L130 PetriNetUnfolder]: 216/490 cut-off events. [2022-12-13 09:18:00,192 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-13 09:18:00,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 490 events. 216/490 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 3149 event pairs, 108 based on Foata normal form. 0/293 useless extension candidates. Maximal degree in co-relation 971. Up to 343 conditions per place. [2022-12-13 09:18:00,195 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 43 transitions, 150 flow [2022-12-13 09:18:00,195 INFO L226 LiptonReduction]: Number of co-enabled transitions 792 [2022-12-13 09:18:00,251 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:18:00,252 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 09:18:00,252 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 150 flow [2022-12-13 09:18:00,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:18:00,253 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:18:00,253 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:18:00,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:18:00,253 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 09:18:00,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:18:00,253 INFO L85 PathProgramCache]: Analyzing trace with hash 831967527, now seen corresponding path program 1 times [2022-12-13 09:18:00,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:18:00,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16926327] [2022-12-13 09:18:00,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:18:00,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:18:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:18:00,463 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 09:18:00,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:18:00,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16926327] [2022-12-13 09:18:00,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16926327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:18:00,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:18:00,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:18:00,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593676682] [2022-12-13 09:18:00,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:18:00,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:18:00,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:18:00,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:18:00,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:18:00,465 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2022-12-13 09:18:00,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 09:18:00,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:18:00,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2022-12-13 09:18:00,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:18:00,763 INFO L130 PetriNetUnfolder]: 1151/1998 cut-off events. [2022-12-13 09:18:00,763 INFO L131 PetriNetUnfolder]: For 240/240 co-relation queries the response was YES. [2022-12-13 09:18:00,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5517 conditions, 1998 events. 1151/1998 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10805 event pairs, 203 based on Foata normal form. 141/1613 useless extension candidates. Maximal degree in co-relation 5504. Up to 1252 conditions per place. [2022-12-13 09:18:00,812 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 50 selfloop transitions, 19 changer transitions 0/76 dead transitions. [2022-12-13 09:18:00,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 76 transitions, 382 flow [2022-12-13 09:18:00,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:18:00,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:18:00,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2022-12-13 09:18:00,814 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7205882352941176 [2022-12-13 09:18:00,814 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 150 flow. Second operand 4 states and 98 transitions. [2022-12-13 09:18:00,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 76 transitions, 382 flow [2022-12-13 09:18:00,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 76 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:18:00,817 INFO L231 Difference]: Finished difference. Result has 49 places, 52 transitions, 252 flow [2022-12-13 09:18:00,817 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=252, PETRI_PLACES=49, PETRI_TRANSITIONS=52} [2022-12-13 09:18:00,818 INFO L295 CegarLoopForPetriNet]: 73 programPoint places, -24 predicate places. [2022-12-13 09:18:00,818 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:18:00,818 INFO L89 Accepts]: Start accepts. Operand has 49 places, 52 transitions, 252 flow [2022-12-13 09:18:00,820 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:18:00,820 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:18:00,820 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 52 transitions, 252 flow [2022-12-13 09:18:00,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 52 transitions, 252 flow [2022-12-13 09:18:00,859 INFO L130 PetriNetUnfolder]: 162/409 cut-off events. [2022-12-13 09:18:00,860 INFO L131 PetriNetUnfolder]: For 72/117 co-relation queries the response was YES. [2022-12-13 09:18:00,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 409 events. 162/409 cut-off events. For 72/117 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 2444 event pairs, 27 based on Foata normal form. 2/250 useless extension candidates. Maximal degree in co-relation 1133. Up to 280 conditions per place. [2022-12-13 09:18:00,862 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 52 transitions, 252 flow [2022-12-13 09:18:00,862 INFO L226 LiptonReduction]: Number of co-enabled transitions 810 [2022-12-13 09:18:00,867 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:18:00,871 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-13 09:18:00,871 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 52 transitions, 252 flow [2022-12-13 09:18:00,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 09:18:00,871 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:18:00,871 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 09:18:00,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:18:00,871 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 09:18:00,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:18:00,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1531650579, now seen corresponding path program 1 times [2022-12-13 09:18:00,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:18:00,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202643763] [2022-12-13 09:18:00,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:18:00,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:18:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:18:01,199 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 09:18:01,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:18:01,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202643763] [2022-12-13 09:18:01,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202643763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:18:01,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:18:01,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:18:01,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574376996] [2022-12-13 09:18:01,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:18:01,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:18:01,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:18:01,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:18:01,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:18:01,201 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2022-12-13 09:18:01,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 52 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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 09:18:01,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:18:01,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2022-12-13 09:18:01,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:18:01,420 INFO L130 PetriNetUnfolder]: 701/1260 cut-off events. [2022-12-13 09:18:01,420 INFO L131 PetriNetUnfolder]: For 321/321 co-relation queries the response was YES. [2022-12-13 09:18:01,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4124 conditions, 1260 events. 701/1260 cut-off events. For 321/321 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6296 event pairs, 122 based on Foata normal form. 108/1004 useless extension candidates. Maximal degree in co-relation 4109. Up to 556 conditions per place. [2022-12-13 09:18:01,426 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 41 selfloop transitions, 28 changer transitions 0/76 dead transitions. [2022-12-13 09:18:01,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 76 transitions, 448 flow [2022-12-13 09:18:01,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:18:01,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:18:01,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2022-12-13 09:18:01,427 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6176470588235294 [2022-12-13 09:18:01,427 INFO L175 Difference]: Start difference. First operand has 49 places, 52 transitions, 252 flow. Second operand 5 states and 105 transitions. [2022-12-13 09:18:01,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 76 transitions, 448 flow [2022-12-13 09:18:01,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 76 transitions, 398 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-13 09:18:01,433 INFO L231 Difference]: Finished difference. Result has 50 places, 52 transitions, 282 flow [2022-12-13 09:18:01,434 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=50, PETRI_TRANSITIONS=52} [2022-12-13 09:18:01,435 INFO L295 CegarLoopForPetriNet]: 73 programPoint places, -23 predicate places. [2022-12-13 09:18:01,435 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:18:01,435 INFO L89 Accepts]: Start accepts. Operand has 50 places, 52 transitions, 282 flow [2022-12-13 09:18:01,436 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:18:01,436 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:18:01,436 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 52 transitions, 282 flow [2022-12-13 09:18:01,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 52 transitions, 282 flow [2022-12-13 09:18:01,460 INFO L130 PetriNetUnfolder]: 81/247 cut-off events. [2022-12-13 09:18:01,461 INFO L131 PetriNetUnfolder]: For 72/108 co-relation queries the response was YES. [2022-12-13 09:18:01,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 247 events. 81/247 cut-off events. For 72/108 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1304 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 789. Up to 163 conditions per place. [2022-12-13 09:18:01,462 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 52 transitions, 282 flow [2022-12-13 09:18:01,462 INFO L226 LiptonReduction]: Number of co-enabled transitions 702 [2022-12-13 09:18:04,216 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:18:04,216 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2781 [2022-12-13 09:18:04,217 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 50 transitions, 278 flow [2022-12-13 09:18:04,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 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 09:18:04,217 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:18:04,217 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] [2022-12-13 09:18:04,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:18:04,217 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 09:18:04,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:18:04,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1782842384, now seen corresponding path program 1 times [2022-12-13 09:18:04,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:18:04,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738132710] [2022-12-13 09:18:04,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:18:04,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:18:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:18:04,521 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 09:18:04,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:18:04,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738132710] [2022-12-13 09:18:04,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738132710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:18:04,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:18:04,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:18:04,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931683884] [2022-12-13 09:18:04,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:18:04,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:18:04,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:18:04,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:18:04,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:18:04,524 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 09:18:04,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 50 transitions, 278 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 09:18:04,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:18:04,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 09:18:04,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:18:04,743 INFO L130 PetriNetUnfolder]: 876/1620 cut-off events. [2022-12-13 09:18:04,743 INFO L131 PetriNetUnfolder]: For 1533/1647 co-relation queries the response was YES. [2022-12-13 09:18:04,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5377 conditions, 1620 events. 876/1620 cut-off events. For 1533/1647 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9447 event pairs, 54 based on Foata normal form. 86/1403 useless extension candidates. Maximal degree in co-relation 5363. Up to 821 conditions per place. [2022-12-13 09:18:04,751 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 47 selfloop transitions, 1 changer transitions 32/94 dead transitions. [2022-12-13 09:18:04,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 94 transitions, 680 flow [2022-12-13 09:18:04,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:18:04,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:18:04,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-12-13 09:18:04,753 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6875 [2022-12-13 09:18:04,753 INFO L175 Difference]: Start difference. First operand has 48 places, 50 transitions, 278 flow. Second operand 4 states and 88 transitions. [2022-12-13 09:18:04,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 94 transitions, 680 flow [2022-12-13 09:18:04,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 94 transitions, 546 flow, removed 30 selfloop flow, removed 3 redundant places. [2022-12-13 09:18:04,771 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 209 flow [2022-12-13 09:18:04,772 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=209, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2022-12-13 09:18:04,773 INFO L295 CegarLoopForPetriNet]: 73 programPoint places, -23 predicate places. [2022-12-13 09:18:04,773 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:18:04,773 INFO L89 Accepts]: Start accepts. Operand has 50 places, 49 transitions, 209 flow [2022-12-13 09:18:04,774 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:18:04,774 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:18:04,775 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 49 transitions, 209 flow [2022-12-13 09:18:04,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 49 transitions, 209 flow [2022-12-13 09:18:04,792 INFO L130 PetriNetUnfolder]: 90/216 cut-off events. [2022-12-13 09:18:04,792 INFO L131 PetriNetUnfolder]: For 192/192 co-relation queries the response was YES. [2022-12-13 09:18:04,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 216 events. 90/216 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1114 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 578. Up to 109 conditions per place. [2022-12-13 09:18:04,794 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 49 transitions, 209 flow [2022-12-13 09:18:04,794 INFO L226 LiptonReduction]: Number of co-enabled transitions 636 [2022-12-13 09:18:04,858 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:18:04,859 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-13 09:18:04,859 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 48 transitions, 207 flow [2022-12-13 09:18:04,859 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 09:18:04,859 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:18:04,859 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 09:18:04,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:18:04,860 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 09:18:04,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:18:04,860 INFO L85 PathProgramCache]: Analyzing trace with hash -769411847, now seen corresponding path program 1 times [2022-12-13 09:18:04,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:18:04,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678183190] [2022-12-13 09:18:04,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:18:04,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:18:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:18:05,655 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 09:18:05,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:18:05,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678183190] [2022-12-13 09:18:05,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678183190] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:18:05,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:18:05,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:18:05,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121419658] [2022-12-13 09:18:05,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:18:05,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:18:05,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:18:05,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:18:05,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:18:05,657 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2022-12-13 09:18:05,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 48 transitions, 207 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 09:18:05,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:18:05,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2022-12-13 09:18:05,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:18:05,934 INFO L130 PetriNetUnfolder]: 979/1759 cut-off events. [2022-12-13 09:18:05,935 INFO L131 PetriNetUnfolder]: For 1521/1665 co-relation queries the response was YES. [2022-12-13 09:18:05,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5269 conditions, 1759 events. 979/1759 cut-off events. For 1521/1665 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10135 event pairs, 23 based on Foata normal form. 145/1550 useless extension candidates. Maximal degree in co-relation 5254. Up to 775 conditions per place. [2022-12-13 09:18:05,940 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 70 selfloop transitions, 15 changer transitions 21/119 dead transitions. [2022-12-13 09:18:05,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 119 transitions, 707 flow [2022-12-13 09:18:05,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 09:18:05,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 09:18:05,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2022-12-13 09:18:05,942 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2022-12-13 09:18:05,942 INFO L175 Difference]: Start difference. First operand has 47 places, 48 transitions, 207 flow. Second operand 7 states and 130 transitions. [2022-12-13 09:18:05,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 119 transitions, 707 flow [2022-12-13 09:18:05,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 119 transitions, 702 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 09:18:05,958 INFO L231 Difference]: Finished difference. Result has 54 places, 60 transitions, 293 flow [2022-12-13 09:18:05,958 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=293, PETRI_PLACES=54, PETRI_TRANSITIONS=60} [2022-12-13 09:18:05,959 INFO L295 CegarLoopForPetriNet]: 73 programPoint places, -19 predicate places. [2022-12-13 09:18:05,959 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:18:05,959 INFO L89 Accepts]: Start accepts. Operand has 54 places, 60 transitions, 293 flow [2022-12-13 09:18:05,961 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:18:05,961 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:18:05,961 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 60 transitions, 293 flow [2022-12-13 09:18:05,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 60 transitions, 293 flow [2022-12-13 09:18:05,996 INFO L130 PetriNetUnfolder]: 267/617 cut-off events. [2022-12-13 09:18:05,997 INFO L131 PetriNetUnfolder]: For 369/405 co-relation queries the response was YES. [2022-12-13 09:18:05,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1699 conditions, 617 events. 267/617 cut-off events. For 369/405 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 4030 event pairs, 1 based on Foata normal form. 7/257 useless extension candidates. Maximal degree in co-relation 1684. Up to 280 conditions per place. [2022-12-13 09:18:06,001 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 60 transitions, 293 flow [2022-12-13 09:18:06,001 INFO L226 LiptonReduction]: Number of co-enabled transitions 780 [2022-12-13 09:18:06,084 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [688] $Ultimate##0-->L767: Formula: (and (= v_~z~0_42 1) (= |v_P0Thread1of1ForFork2_#in~arg.offset_15| v_P0Thread1of1ForFork2_~arg.offset_15) (= v_P0Thread1of1ForFork2_~arg.base_15 |v_P0Thread1of1ForFork2_#in~arg.base_15|) (= v_~x~0_825 1)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_15|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_15|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_15|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_15, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_15|, ~z~0=v_~z~0_42, ~x~0=v_~x~0_825, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_15} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~z~0, ~x~0, P0Thread1of1ForFork2_~arg.base] and [629] $Ultimate##0-->L793: Formula: (and (= v_~x$r_buff0_thd2~0_132 1) (= v_~x$r_buff1_thd1~0_59 v_~x$r_buff0_thd1~0_61) (= v_~x$w_buff0_used~0_289 1) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|) (= v_~x$r_buff0_thd0~0_115 v_~x$r_buff1_thd0~0_107) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_289 256) 0)) (not (= (mod v_~x$w_buff1_used~0_266 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|) (= v_~x$w_buff0~0_175 v_~x$w_buff1~0_155) (= v_~x$w_buff0_used~0_290 v_~x$w_buff1_used~0_266) (= v_~x$r_buff0_thd2~0_133 v_~x$r_buff1_thd2~0_117) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9| 0)) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= 2 v_~x$w_buff0~0_174) (= v_~x$r_buff1_thd3~0_49 v_~x$r_buff0_thd3~0_55)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_175, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_115, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_61, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_55, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_133, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_290} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_174, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_115, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_61, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_155, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_49, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_117, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_266, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_59, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_55, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_132, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_107, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_289, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] [2022-12-13 09:18:06,207 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [688] $Ultimate##0-->L767: Formula: (and (= v_~z~0_42 1) (= |v_P0Thread1of1ForFork2_#in~arg.offset_15| v_P0Thread1of1ForFork2_~arg.offset_15) (= v_P0Thread1of1ForFork2_~arg.base_15 |v_P0Thread1of1ForFork2_#in~arg.base_15|) (= v_~x~0_825 1)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_15|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_15|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_15|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_15, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_15|, ~z~0=v_~z~0_42, ~x~0=v_~x~0_825, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_15} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~z~0, ~x~0, P0Thread1of1ForFork2_~arg.base] and [534] L870-->L882: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff1_thd3~0_64 256) 0))) (.cse6 (not (= (mod v_~y$w_buff0_used~0_115 256) 0))) (.cse11 (not (= (mod v_~y$r_buff0_thd3~0_83 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd3~0_32 256) 0))) (.cse9 (not (= (mod v_~x$w_buff0_used~0_151 256) 0))) (.cse8 (not (= 0 (mod v_~x$r_buff1_thd3~0_28 256))))) (let ((.cse1 (and .cse8 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse0 (and .cse10 .cse9)) (.cse3 (and .cse11 (not (= (mod v_~y$w_buff0_used~0_116 256) 0)))) (.cse2 (and .cse11 .cse6)) (.cse7 (and (not (= (mod v_~y$w_buff1_used~0_113 256) 0)) .cse5)) (.cse4 (and .cse10 (not (= (mod v_~x$w_buff0_used~0_152 256) 0))))) (and (= v_~x$w_buff1_used~0_142 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143)) (= v_~y$r_buff0_thd3~0_82 (ite .cse2 0 v_~y$r_buff0_thd3~0_83)) (= (ite .cse3 0 v_~y$w_buff0_used~0_116) v_~y$w_buff0_used~0_115) (= (ite .cse4 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_106)) v_~x~0_105) (= (ite (or (and .cse5 (not (= (mod v_~y$w_buff1_used~0_112 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_82 256) 0)) .cse6)) 0 v_~y$r_buff1_thd3~0_64) v_~y$r_buff1_thd3~0_63) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_32) v_~x$r_buff0_thd3~0_31) (= v_~y~0_86 (ite .cse3 v_~y$w_buff0~0_50 (ite .cse7 v_~y$w_buff1~0_55 v_~y~0_87))) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse8) (and .cse9 (not (= (mod v_~x$r_buff0_thd3~0_31 256) 0)))) 0 v_~x$r_buff1_thd3~0_28) v_~x$r_buff1_thd3~0_27) (= (ite (or .cse2 .cse7) 0 v_~y$w_buff1_used~0_113) v_~y$w_buff1_used~0_112) (= v_~x$w_buff0_used~0_151 (ite .cse4 0 v_~x$w_buff0_used~0_152))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_116, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_32, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_152, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_64, ~y$w_buff1~0=v_~y$w_buff1~0_55, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_87, ~x~0=v_~x~0_106, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_113} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_115, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_31, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_151, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_63, ~y$w_buff1~0=v_~y$w_buff1~0_55, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_82, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_86, ~x~0=v_~x~0_105, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_112} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~y~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] [2022-12-13 09:18:06,540 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [533] L867-->L870: Formula: (= v_~__unbuffered_p2_EBX~0_1 v_~z~0_2) InVars {~z~0=v_~z~0_2} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_1, ~z~0=v_~z~0_2} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0] and [690] $Ultimate##0-->L882: Formula: (let ((.cse6 (not (= (mod v_~x$w_buff0_used~0_951 256) 0))) (.cse5 (not (= (mod v_~x$r_buff1_thd3~0_120 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd3~0_126 256) 0))) (.cse9 (not (= (mod v_~y$r_buff1_thd3~0_212 256) 0))) (.cse11 (not (= (mod v_~y$r_buff0_thd3~0_261 256) 0))) (.cse8 (not (= (mod v_~y$w_buff0_used~0_469 256) 0)))) (let ((.cse2 (and .cse11 .cse8)) (.cse0 (and .cse11 (not (= (mod v_~y$w_buff0_used~0_470 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_433 256) 0)) .cse9)) (.cse3 (and (not (= (mod v_~x$w_buff0_used~0_952 256) 0)) .cse10)) (.cse7 (and .cse5 (not (= (mod v_~x$w_buff1_used~0_913 256) 0)))) (.cse4 (and .cse6 .cse10))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_470) v_~y$w_buff0_used~0_469) (= |v_P0Thread1of1ForFork2_#in~arg.offset_21| v_P0Thread1of1ForFork2_~arg.offset_21) (= v_~z~0_48 1) (= v_~y$w_buff1_used~0_432 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_433)) (= (ite .cse3 0 v_~x$w_buff0_used~0_952) v_~x$w_buff0_used~0_951) (= (ite .cse2 0 v_~y$r_buff0_thd3~0_261) v_~y$r_buff0_thd3~0_260) (= v_~y~0_379 (ite .cse0 v_~y$w_buff0~0_316 (ite .cse1 v_~y$w_buff1~0_288 v_~y~0_380))) (= v_P0Thread1of1ForFork2_~arg.base_21 |v_P0Thread1of1ForFork2_#in~arg.base_21|) (= (ite .cse4 0 v_~x$r_buff0_thd3~0_126) v_~x$r_buff0_thd3~0_125) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_912 256) 0)) .cse5) (and .cse6 (not (= (mod v_~x$r_buff0_thd3~0_125 256) 0)))) 0 v_~x$r_buff1_thd3~0_120) v_~x$r_buff1_thd3~0_119) (= (ite .cse3 v_~x$w_buff0~0_684 (ite .cse7 v_~x$w_buff1~0_653 1)) v_~x~0_880) (= (ite (or (and .cse8 (not (= (mod v_~y$r_buff0_thd3~0_260 256) 0))) (and .cse9 (not (= (mod v_~y$w_buff1_used~0_432 256) 0)))) 0 v_~y$r_buff1_thd3~0_212) v_~y$r_buff1_thd3~0_211) (= (ite (or .cse7 .cse4) 0 v_~x$w_buff1_used~0_913) v_~x$w_buff1_used~0_912)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_684, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_470, ~x$w_buff1~0=v_~x$w_buff1~0_653, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_120, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_913, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_21|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_126, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_952, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_212, ~y$w_buff1~0=v_~y$w_buff1~0_288, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_21|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_261, ~y$w_buff0~0=v_~y$w_buff0~0_316, ~y~0=v_~y~0_380, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_433} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_684, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_469, ~x$w_buff1~0=v_~x$w_buff1~0_653, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_119, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_912, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_21|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_125, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_951, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_21, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_211, ~y$w_buff1~0=v_~y$w_buff1~0_288, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_21|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_260, ~y$w_buff0~0=v_~y$w_buff0~0_316, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_21, ~z~0=v_~z~0_48, ~y~0=v_~y~0_379, ~x~0=v_~x~0_880, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_432} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x$w_buff0_used~0, P0Thread1of1ForFork2_~arg.base, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, P0Thread1of1ForFork2_~arg.offset, ~z~0, ~y~0, ~x~0, ~y$w_buff1_used~0] [2022-12-13 09:18:06,778 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:18:06,780 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 821 [2022-12-13 09:18:06,780 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 59 transitions, 299 flow [2022-12-13 09:18:06,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 09:18:06,781 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:18:06,781 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 09:18:06,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:18:06,782 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 09:18:06,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:18:06,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1782241252, now seen corresponding path program 1 times [2022-12-13 09:18:06,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:18:06,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879095682] [2022-12-13 09:18:06,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:18:06,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:18:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:18:07,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:18:07,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:18:07,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879095682] [2022-12-13 09:18:07,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879095682] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:18:07,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:18:07,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:18:07,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640373259] [2022-12-13 09:18:07,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:18:07,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:18:07,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:18:07,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:18:07,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:18:07,904 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 09:18:07,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 59 transitions, 299 flow. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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 09:18:07,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:18:07,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 09:18:07,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:18:08,556 INFO L130 PetriNetUnfolder]: 1682/2995 cut-off events. [2022-12-13 09:18:08,557 INFO L131 PetriNetUnfolder]: For 3631/3878 co-relation queries the response was YES. [2022-12-13 09:18:08,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10293 conditions, 2995 events. 1682/2995 cut-off events. For 3631/3878 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 18664 event pairs, 223 based on Foata normal form. 197/2495 useless extension candidates. Maximal degree in co-relation 10275. Up to 969 conditions per place. [2022-12-13 09:18:08,569 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 90 selfloop transitions, 12 changer transitions 75/189 dead transitions. [2022-12-13 09:18:08,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 189 transitions, 1382 flow [2022-12-13 09:18:08,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 09:18:08,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 09:18:08,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2022-12-13 09:18:08,571 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5486111111111112 [2022-12-13 09:18:08,571 INFO L175 Difference]: Start difference. First operand has 52 places, 59 transitions, 299 flow. Second operand 9 states and 158 transitions. [2022-12-13 09:18:08,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 189 transitions, 1382 flow [2022-12-13 09:18:08,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 189 transitions, 1347 flow, removed 17 selfloop flow, removed 2 redundant places. [2022-12-13 09:18:08,631 INFO L231 Difference]: Finished difference. Result has 61 places, 64 transitions, 352 flow [2022-12-13 09:18:08,631 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=352, PETRI_PLACES=61, PETRI_TRANSITIONS=64} [2022-12-13 09:18:08,632 INFO L295 CegarLoopForPetriNet]: 73 programPoint places, -12 predicate places. [2022-12-13 09:18:08,632 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:18:08,632 INFO L89 Accepts]: Start accepts. Operand has 61 places, 64 transitions, 352 flow [2022-12-13 09:18:08,633 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:18:08,633 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:18:08,633 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 64 transitions, 352 flow [2022-12-13 09:18:08,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 64 transitions, 352 flow [2022-12-13 09:18:08,718 INFO L130 PetriNetUnfolder]: 553/1199 cut-off events. [2022-12-13 09:18:08,719 INFO L131 PetriNetUnfolder]: For 1133/1157 co-relation queries the response was YES. [2022-12-13 09:18:08,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3482 conditions, 1199 events. 553/1199 cut-off events. For 1133/1157 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 8852 event pairs, 6 based on Foata normal form. 9/473 useless extension candidates. Maximal degree in co-relation 3464. Up to 595 conditions per place. [2022-12-13 09:18:08,726 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 64 transitions, 352 flow [2022-12-13 09:18:08,726 INFO L226 LiptonReduction]: Number of co-enabled transitions 770 [2022-12-13 09:18:08,921 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [597] $Ultimate##0-->L851: Formula: (and (= v_~y$r_buff0_thd1~0_15 v_~y$r_buff1_thd1~0_13) (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff1_thd2~0_57) (= v_~y$w_buff0_used~0_192 v_~y$w_buff1_used~0_172) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_13| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_13|) (= v_~y$r_buff0_thd3~0_104 1) (= v_~y$w_buff1~0_99 v_~y$w_buff0~0_109) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_13| 0)) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_7| |v_P2Thread1of1ForFork1_~arg#1.offset_7|) (= v_~y$r_buff0_thd3~0_105 v_~y$r_buff1_thd3~0_75) (= v_~y$w_buff0_used~0_191 1) (= v_~y$w_buff0~0_108 1) (= v_~y$r_buff0_thd0~0_51 v_~y$r_buff1_thd0~0_43) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_13| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_191 256) 0)) (not (= (mod v_~y$w_buff1_used~0_172 256) 0)))) 1 0)) (= |v_P2Thread1of1ForFork1_#in~arg#1.base_7| |v_P2Thread1of1ForFork1_~arg#1.base_7|)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_192, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_105, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_109, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_191, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_7|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_57, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_13, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_75, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff1~0=v_~y$w_buff1~0_99, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_104, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_108, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_13|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_43, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_13|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_172} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [524] L809-->L825: Formula: (let ((.cse10 (= (mod v_~y$r_buff1_thd2~0_40 256) 0)) (.cse6 (= (mod v_~y$r_buff0_thd2~0_38 256) 0))) (let ((.cse8 (not .cse6)) (.cse1 (and .cse6 (= (mod v_~y$w_buff1_used~0_141 256) 0))) (.cse11 (= (mod v_~y$w_buff0_used~0_148 256) 0)) (.cse2 (and .cse6 .cse10))) (let ((.cse7 (= (mod v_~y$w_buff1_used~0_140 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_147 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_124 256) 0))) (.cse4 (or .cse1 .cse11 .cse2)) (.cse5 (and .cse8 (not .cse11)))) (and (= v_~y$w_buff0~0_71 v_~y$w_buff0~0_70) (= (ite .cse0 v_~y$w_buff1_used~0_141 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff1_used~0_141 0)) v_~y$w_buff1_used~0_140) (= 0 v_~y$flush_delayed~0_40) (= v_~__unbuffered_p1_EBX~0_24 (ite .cse4 v_~y~0_112 (ite .cse5 v_~y$w_buff0~0_71 v_~y$w_buff1~0_70))) (= |v_P1Thread1of1ForFork0_#t~nondet5#1_1| v_~weak$$choice0~0_24) (= v_~y$w_buff1~0_70 v_~y$w_buff1~0_69) (= v_~y~0_112 v_~y$mem_tmp~0_34) (= v_~y$r_buff0_thd2~0_37 (ite .cse0 v_~y$r_buff0_thd2~0_38 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~y$r_buff0_thd2~0_38 (ite (and .cse8 (not .cse3)) 0 v_~y$r_buff0_thd2~0_38)))) (= (ite .cse0 v_~y$r_buff1_thd2~0_40 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd2~0_37 256) 0))) (or (and .cse7 .cse9) (and .cse10 .cse9) .cse3)) v_~y$r_buff1_thd2~0_40 0)) v_~y$r_buff1_thd2~0_39) (= v_~weak$$choice2~0_124 |v_P1Thread1of1ForFork0_#t~nondet6#1_1|) (= v_~y~0_110 (ite .cse0 v_~y$mem_tmp~0_34 v_~__unbuffered_p1_EBX~0_24)) (= v_~y$w_buff0_used~0_147 (ite .cse0 v_~y$w_buff0_used~0_148 (ite .cse4 v_~y$w_buff0_used~0_148 (ite .cse5 0 v_~y$w_buff0_used~0_148)))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_40, P1Thread1of1ForFork0_#t~nondet5#1=|v_P1Thread1of1ForFork0_#t~nondet5#1_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_148, ~y$w_buff1~0=v_~y$w_buff1~0_70, ~y$w_buff0~0=v_~y$w_buff0~0_71, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_38, P1Thread1of1ForFork0_#t~nondet6#1=|v_P1Thread1of1ForFork0_#t~nondet6#1_1|, ~y~0=v_~y~0_112, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_141} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_147, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_39, ~weak$$choice0~0=v_~weak$$choice0~0_24, ~y$mem_tmp~0=v_~y$mem_tmp~0_34, ~y$w_buff1~0=v_~y$w_buff1~0_69, ~y$w_buff0~0=v_~y$w_buff0~0_70, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$flush_delayed~0=v_~y$flush_delayed~0_40, ~y~0=v_~y~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_124, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_140} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_#t~nondet5#1, ~y$w_buff0_used~0, P1Thread1of1ForFork0_#t~nondet6#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-13 09:18:09,869 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [693] $Ultimate##0-->L825: Formula: (let ((.cse1 (= (mod v_~y$r_buff0_thd2~0_132 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_486 256) 0))) (let ((.cse2 (and .cse1 .cse4))) (let ((.cse7 (or .cse1 .cse2)) (.cse6 (not .cse1)) (.cse0 (not (= (mod v_~weak$$choice2~0_456 256) 0))) (.cse5 (= (mod v_~y$w_buff1_used~0_447 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_484 256) 0))) (and (= v_~y$w_buff1_used~0_447 (ite .cse0 v_~y$w_buff0_used~0_486 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff0_used~0_486 0))) (= v_~y$flush_delayed~0_122 0) (= v_~y$r_buff0_thd1~0_43 v_~y$r_buff1_thd1~0_41) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_37| |v_P2Thread1of1ForFork1_~arg#1.offset_37|) (= v_~y$w_buff1~0_295 v_~y$w_buff0~0_326) (= (ite .cse4 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_43|) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_43| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_43|) (= v_~y$r_buff0_thd3~0_275 1) (= (ite .cse0 v_~y$mem_tmp~0_114 v_~__unbuffered_p1_EBX~0_224) v_~y~0_394) (= (ite .cse0 v_~y$r_buff0_thd2~0_132 (ite (or .cse1 (and .cse1 .cse5) .cse3) v_~y$r_buff0_thd2~0_132 (ite (and (not .cse3) .cse6) 0 v_~y$r_buff0_thd2~0_132))) v_~y$r_buff0_thd2~0_131) (= |v_P1Thread1of1ForFork0_#t~nondet5#1_70| v_~weak$$choice0~0_358) (= v_~y$w_buff0~0_324 1) (= v_~y$r_buff0_thd0~0_149 v_~y$r_buff1_thd0~0_144) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_43| 0)) (= v_~y$w_buff0_used~0_484 (ite .cse0 1 (ite .cse7 1 (ite .cse6 0 1)))) (= v_~y~0_395 v_~y$mem_tmp~0_114) (= v_~__unbuffered_p1_EBX~0_224 (ite .cse7 v_~y~0_395 (ite .cse6 1 v_~y$w_buff1~0_295))) (= (ite .cse0 v_~y$r_buff0_thd2~0_132 (ite (let ((.cse8 (= (mod v_~y$r_buff0_thd2~0_131 256) 0))) (or (and .cse1 .cse8) (and .cse5 .cse8) .cse3)) v_~y$r_buff0_thd2~0_132 0)) v_~y$r_buff1_thd2~0_135) (= |v_P2Thread1of1ForFork1_~arg#1.base_37| |v_P2Thread1of1ForFork1_#in~arg#1.base_37|) (= v_~y$r_buff0_thd3~0_276 v_~y$r_buff1_thd3~0_226) (= v_~weak$$choice2~0_456 |v_P1Thread1of1ForFork0_#t~nondet6#1_70|))))) InVars {P1Thread1of1ForFork0_#t~nondet5#1=|v_P1Thread1of1ForFork0_#t~nondet5#1_70|, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_37|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_486, ~y$w_buff0~0=v_~y$w_buff0~0_326, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_149, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_132, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_43, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_37|, P1Thread1of1ForFork0_#t~nondet6#1=|v_P1Thread1of1ForFork0_#t~nondet6#1_70|, ~y~0=v_~y~0_395} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_484, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_37|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_41, ~y$mem_tmp~0=v_~y$mem_tmp~0_114, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_226, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_37|, ~y$w_buff0~0=v_~y$w_buff0~0_324, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_275, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_37|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_43, ~y$flush_delayed~0=v_~y$flush_delayed~0_122, ~y~0=v_~y~0_394, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_224, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_37|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_135, ~weak$$choice0~0=v_~weak$$choice0~0_358, ~y$w_buff1~0=v_~y$w_buff1~0_295, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_149, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_131, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_43|, ~weak$$choice2~0=v_~weak$$choice2~0_456, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_144, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_447, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_43|} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_#t~nondet5#1, ~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, P1Thread1of1ForFork0_#t~nondet6#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_~arg#1.base, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [532] L851-->L867: Formula: (let ((.cse4 (= (mod v_~y$r_buff1_thd3~0_60 256) 0)) (.cse9 (= (mod v_~y$r_buff0_thd3~0_79 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~y$w_buff0_used~0_112 256) 0)) (.cse2 (and .cse4 .cse9)) (.cse3 (and .cse9 (= (mod v_~y$w_buff1_used~0_109 256) 0)))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_108 256) 0))) (.cse6 (= 0 (mod v_~y$w_buff1_used~0_108 256))) (.cse1 (= (mod v_~y$w_buff0_used~0_111 256) 0)) (.cse7 (or .cse11 .cse2 .cse3)) (.cse8 (and (not .cse11) .cse10))) (and (= v_~y$w_buff1_used~0_108 (ite .cse0 v_~y$w_buff1_used~0_109 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff1_used~0_109 0))) (= v_~weak$$choice2~0_108 |v_P2Thread1of1ForFork1_#t~nondet8#1_1|) (= (ite .cse0 v_~y$r_buff1_thd3~0_60 (ite (let ((.cse5 (= (mod v_~y$r_buff0_thd3~0_78 256) 0))) (or (and .cse4 .cse5) .cse1 (and .cse5 .cse6))) v_~y$r_buff1_thd3~0_60 0)) v_~y$r_buff1_thd3~0_59) (= 0 v_~y$flush_delayed~0_32) (= (ite .cse0 v_~y$w_buff0_used~0_112 (ite .cse7 v_~y$w_buff0_used~0_112 (ite .cse8 0 v_~y$w_buff0_used~0_112))) v_~y$w_buff0_used~0_111) (= v_~y~0_83 v_~y$mem_tmp~0_26) (= v_~y~0_82 (ite .cse0 v_~y$mem_tmp~0_26 v_~__unbuffered_p2_EAX~0_18)) (= v_~y$r_buff0_thd3~0_78 (ite .cse0 v_~y$r_buff0_thd3~0_79 (ite (or .cse1 .cse2 (and .cse9 .cse6)) v_~y$r_buff0_thd3~0_79 (ite (and (not .cse1) .cse10) 0 v_~y$r_buff0_thd3~0_79)))) (= v_~y$w_buff1~0_52 v_~y$w_buff1~0_51) (= |v_P2Thread1of1ForFork1_#t~nondet7#1_1| v_~weak$$choice0~0_14) (= v_~__unbuffered_p2_EAX~0_18 (ite .cse7 v_~y~0_83 (ite .cse8 v_~y$w_buff0~0_47 v_~y$w_buff1~0_52))) (= v_~y$w_buff0~0_47 v_~y$w_buff0~0_46))))) InVars {P2Thread1of1ForFork1_#t~nondet7#1=|v_P2Thread1of1ForFork1_#t~nondet7#1_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_60, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_112, ~y$w_buff1~0=v_~y$w_buff1~0_52, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_79, ~y$w_buff0~0=v_~y$w_buff0~0_47, P2Thread1of1ForFork1_#t~nondet8#1=|v_P2Thread1of1ForFork1_#t~nondet8#1_1|, ~y~0=v_~y~0_83, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_109} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_111, ~weak$$choice0~0=v_~weak$$choice0~0_14, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_59, ~y$w_buff1~0=v_~y$w_buff1~0_51, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_78, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y$flush_delayed~0=v_~y$flush_delayed~0_32, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_18, ~y~0=v_~y~0_82, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_108} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~nondet7#1, ~y$w_buff0_used~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, ~y~0, ~weak$$choice2~0, P2Thread1of1ForFork1_#t~nondet8#1, ~y$w_buff1_used~0] [2022-12-13 09:18:10,300 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:18:10,301 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1669 [2022-12-13 09:18:10,302 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 61 transitions, 342 flow [2022-12-13 09:18:10,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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 09:18:10,302 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:18:10,302 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 09:18:10,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:18:10,302 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 09:18:10,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:18:10,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1320911505, now seen corresponding path program 1 times [2022-12-13 09:18:10,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:18:10,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16090790] [2022-12-13 09:18:10,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:18:10,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:18:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:18:11,456 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 09:18:11,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:18:11,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16090790] [2022-12-13 09:18:11,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16090790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:18:11,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:18:11,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:18:11,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767761815] [2022-12-13 09:18:11,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:18:11,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:18:11,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:18:11,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:18:11,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:18:11,458 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2022-12-13 09:18:11,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 61 transitions, 342 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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 09:18:11,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:18:11,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2022-12-13 09:18:11,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:18:11,943 INFO L130 PetriNetUnfolder]: 1441/2642 cut-off events. [2022-12-13 09:18:11,944 INFO L131 PetriNetUnfolder]: For 4394/4538 co-relation queries the response was YES. [2022-12-13 09:18:11,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9452 conditions, 2642 events. 1441/2642 cut-off events. For 4394/4538 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 17444 event pairs, 89 based on Foata normal form. 174/2163 useless extension candidates. Maximal degree in co-relation 9431. Up to 982 conditions per place. [2022-12-13 09:18:11,956 INFO L137 encePairwiseOnDemand]: 22/31 looper letters, 56 selfloop transitions, 15 changer transitions 34/117 dead transitions. [2022-12-13 09:18:11,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 117 transitions, 829 flow [2022-12-13 09:18:11,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 09:18:11,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 09:18:11,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2022-12-13 09:18:11,958 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4976958525345622 [2022-12-13 09:18:11,958 INFO L175 Difference]: Start difference. First operand has 56 places, 61 transitions, 342 flow. Second operand 7 states and 108 transitions. [2022-12-13 09:18:11,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 117 transitions, 829 flow [2022-12-13 09:18:12,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 117 transitions, 819 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 09:18:12,030 INFO L231 Difference]: Finished difference. Result has 62 places, 66 transitions, 411 flow [2022-12-13 09:18:12,031 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=411, PETRI_PLACES=62, PETRI_TRANSITIONS=66} [2022-12-13 09:18:12,031 INFO L295 CegarLoopForPetriNet]: 73 programPoint places, -11 predicate places. [2022-12-13 09:18:12,031 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:18:12,031 INFO L89 Accepts]: Start accepts. Operand has 62 places, 66 transitions, 411 flow [2022-12-13 09:18:12,033 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:18:12,033 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:18:12,033 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 66 transitions, 411 flow [2022-12-13 09:18:12,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 66 transitions, 411 flow [2022-12-13 09:18:12,148 INFO L130 PetriNetUnfolder]: 721/1510 cut-off events. [2022-12-13 09:18:12,148 INFO L131 PetriNetUnfolder]: For 1514/1545 co-relation queries the response was YES. [2022-12-13 09:18:12,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4384 conditions, 1510 events. 721/1510 cut-off events. For 1514/1545 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 11475 event pairs, 4 based on Foata normal form. 10/566 useless extension candidates. Maximal degree in co-relation 4364. Up to 721 conditions per place. [2022-12-13 09:18:12,161 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 66 transitions, 411 flow [2022-12-13 09:18:12,161 INFO L226 LiptonReduction]: Number of co-enabled transitions 744 [2022-12-13 09:18:12,162 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:18:12,165 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 09:18:12,165 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 66 transitions, 411 flow [2022-12-13 09:18:12,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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 09:18:12,165 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:18:12,165 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:18:12,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 09:18:12,165 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 09:18:12,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:18:12,166 INFO L85 PathProgramCache]: Analyzing trace with hash 539930165, now seen corresponding path program 1 times [2022-12-13 09:18:12,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:18:12,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55499691] [2022-12-13 09:18:12,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:18:12,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:18:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:18:12,243 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:18:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:18:12,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:18:12,363 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:18:12,364 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2022-12-13 09:18:12,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2022-12-13 09:18:12,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2022-12-13 09:18:12,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2022-12-13 09:18:12,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2022-12-13 09:18:12,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2022-12-13 09:18:12,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2022-12-13 09:18:12,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2022-12-13 09:18:12,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 09:18:12,369 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:18:12,383 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:18:12,384 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:18:12,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:18:12 BasicIcfg [2022-12-13 09:18:12,485 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:18:12,485 INFO L158 Benchmark]: Toolchain (without parser) took 30763.15ms. Allocated memory was 182.5MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 157.4MB in the beginning and 1.1GB in the end (delta: -897.7MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-13 09:18:12,485 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 159.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:18:12,486 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.24ms. Allocated memory is still 182.5MB. Free memory was 157.3MB in the beginning and 125.8MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-13 09:18:12,486 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.92ms. Allocated memory is still 182.5MB. Free memory was 125.8MB in the beginning and 121.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-12-13 09:18:12,486 INFO L158 Benchmark]: Boogie Preprocessor took 47.56ms. Allocated memory is still 182.5MB. Free memory was 121.7MB in the beginning and 119.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 09:18:12,486 INFO L158 Benchmark]: RCFGBuilder took 772.72ms. Allocated memory was 182.5MB in the beginning and 225.4MB in the end (delta: 43.0MB). Free memory was 119.0MB in the beginning and 164.5MB in the end (delta: -45.5MB). Peak memory consumption was 36.3MB. Max. memory is 8.0GB. [2022-12-13 09:18:12,486 INFO L158 Benchmark]: TraceAbstraction took 29456.45ms. Allocated memory was 225.4MB in the beginning and 2.8GB in the end (delta: 2.5GB). Free memory was 163.0MB in the beginning and 1.1GB in the end (delta: -892.2MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-13 09:18:12,487 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.11ms. Allocated memory is still 182.5MB. Free memory is still 159.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 407.24ms. Allocated memory is still 182.5MB. Free memory was 157.3MB in the beginning and 125.8MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 74.92ms. Allocated memory is still 182.5MB. Free memory was 125.8MB in the beginning and 121.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.56ms. Allocated memory is still 182.5MB. Free memory was 121.7MB in the beginning and 119.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 772.72ms. Allocated memory was 182.5MB in the beginning and 225.4MB in the end (delta: 43.0MB). Free memory was 119.0MB in the beginning and 164.5MB in the end (delta: -45.5MB). Peak memory consumption was 36.3MB. Max. memory is 8.0GB. * TraceAbstraction took 29456.45ms. Allocated memory was 225.4MB in the beginning and 2.8GB in the end (delta: 2.5GB). Free memory was 163.0MB in the beginning and 1.1GB in the end (delta: -892.2MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.6s, 134 PlacesBefore, 73 PlacesAfterwards, 126 TransitionsBefore, 63 TransitionsAfterwards, 2186 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 56 TrivialYvCompositions, 42 ConcurrentYvCompositions, 3 ChoiceCompositions, 103 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3536, independent: 3339, independent conditional: 3339, independent unconditional: 0, dependent: 197, dependent conditional: 197, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2254, independent: 2182, independent conditional: 0, independent unconditional: 2182, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2254, independent: 2182, independent conditional: 0, independent unconditional: 2182, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2254, independent: 2137, independent conditional: 0, independent unconditional: 2137, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 117, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 726, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 688, dependent conditional: 0, dependent unconditional: 688, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3536, independent: 1157, independent conditional: 1157, independent unconditional: 0, dependent: 125, dependent conditional: 125, dependent unconditional: 0, unknown: 2254, unknown conditional: 2254, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2264, Positive cache size: 2192, Positive conditional cache size: 2192, Positive unconditional cache size: 0, Negative cache size: 72, Negative conditional cache size: 72, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 66 PlacesBefore, 66 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 1748 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 326, independent: 258, independent conditional: 258, independent unconditional: 0, dependent: 68, dependent conditional: 68, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 275, independent: 232, independent conditional: 17, independent unconditional: 215, dependent: 43, dependent conditional: 2, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 275, independent: 232, independent conditional: 17, independent unconditional: 215, dependent: 43, dependent conditional: 2, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 275, independent: 214, independent conditional: 0, independent unconditional: 214, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 61, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 43, dependent conditional: 2, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 287, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 274, dependent conditional: 15, dependent unconditional: 259, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 326, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 275, unknown conditional: 275, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 275, Positive cache size: 232, Positive conditional cache size: 232, Positive unconditional cache size: 0, Negative cache size: 43, Negative conditional cache size: 43, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 654 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 302, independent: 264, independent conditional: 264, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 73, independent: 58, independent conditional: 16, independent unconditional: 42, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 73, independent: 58, independent conditional: 16, independent unconditional: 42, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 73, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 40, dependent conditional: 10, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 302, independent: 206, independent conditional: 206, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 73, unknown conditional: 73, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 348, Positive cache size: 290, Positive conditional cache size: 290, Positive unconditional cache size: 0, Negative cache size: 58, Negative conditional cache size: 58, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 648 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 290, independent: 254, independent conditional: 254, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 8, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 290, independent: 247, independent conditional: 247, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 357, Positive cache size: 297, Positive conditional cache size: 297, Positive unconditional cache size: 0, Negative cache size: 60, Negative conditional cache size: 60, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 45 PlacesBefore, 45 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 642 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 238, independent: 203, independent conditional: 203, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 16, independent conditional: 10, independent unconditional: 6, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, independent: 16, independent conditional: 10, independent unconditional: 6, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 88, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 88, dependent conditional: 13, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 238, independent: 187, independent conditional: 187, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 27, unknown conditional: 27, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 384, Positive cache size: 313, Positive conditional cache size: 313, Positive unconditional cache size: 0, Negative cache size: 71, Negative conditional cache size: 71, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 46 PlacesBefore, 46 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 792 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 174, independent: 141, independent conditional: 141, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 17, independent conditional: 6, independent unconditional: 11, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 17, independent conditional: 6, independent unconditional: 11, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 53, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 174, independent: 124, independent conditional: 124, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 404, Positive cache size: 330, Positive conditional cache size: 330, Positive unconditional cache size: 0, Negative cache size: 74, Negative conditional cache size: 74, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 810 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 223, independent: 181, independent conditional: 181, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, independent: 23, independent conditional: 19, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 23, independent conditional: 19, independent unconditional: 4, 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: 23, independent: 23, independent conditional: 0, independent unconditional: 23, 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: 223, independent: 158, independent conditional: 158, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 23, unknown conditional: 23, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 427, Positive cache size: 353, Positive conditional cache size: 353, Positive unconditional cache size: 0, Negative cache size: 74, Negative conditional cache size: 74, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 50 PlacesBefore, 48 PlacesAfterwards, 52 TransitionsBefore, 50 TransitionsAfterwards, 702 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 580, independent: 494, independent conditional: 494, independent unconditional: 0, dependent: 86, dependent conditional: 86, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 42, 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: 42, independent: 42, independent conditional: 0, independent unconditional: 42, 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: 580, independent: 452, independent conditional: 452, independent unconditional: 0, dependent: 86, dependent conditional: 86, dependent unconditional: 0, unknown: 42, unknown conditional: 42, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 469, Positive cache size: 395, Positive conditional cache size: 395, Positive unconditional cache size: 0, Negative cache size: 74, Negative conditional cache size: 74, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 48 PlacesBefore, 47 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 636 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 460, independent: 382, independent conditional: 382, independent unconditional: 0, dependent: 78, dependent conditional: 78, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 75, independent: 68, independent conditional: 41, independent unconditional: 27, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 75, independent: 68, independent conditional: 41, independent unconditional: 27, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 75, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 460, independent: 314, independent conditional: 314, independent unconditional: 0, dependent: 71, dependent conditional: 71, dependent unconditional: 0, unknown: 75, unknown conditional: 75, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 544, Positive cache size: 463, Positive conditional cache size: 463, Positive unconditional cache size: 0, Negative cache size: 81, Negative conditional cache size: 81, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 53 PlacesBefore, 52 PlacesAfterwards, 60 TransitionsBefore, 59 TransitionsAfterwards, 780 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 215, independent: 200, independent conditional: 200, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 58, independent conditional: 49, independent unconditional: 9, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 60, independent: 58, independent conditional: 49, independent unconditional: 9, 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: 60, independent: 58, independent conditional: 0, independent unconditional: 58, 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: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 215, independent: 142, independent conditional: 142, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 60, unknown conditional: 60, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 604, Positive cache size: 521, Positive conditional cache size: 521, Positive unconditional cache size: 0, Negative cache size: 83, Negative conditional cache size: 83, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 59 PlacesBefore, 56 PlacesAfterwards, 64 TransitionsBefore, 61 TransitionsAfterwards, 770 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 107, independent: 104, independent conditional: 104, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, independent: 66, independent conditional: 63, independent unconditional: 3, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 67, independent: 66, independent conditional: 63, independent unconditional: 3, 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: 67, independent: 66, independent conditional: 0, independent unconditional: 66, 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: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 107, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 67, unknown conditional: 67, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 671, Positive cache size: 587, Positive conditional cache size: 587, Positive unconditional cache size: 0, Negative cache size: 84, Negative conditional cache size: 84, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 744 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 671, Positive cache size: 587, Positive conditional cache size: 587, Positive unconditional cache size: 0, Negative cache size: 84, Negative conditional cache size: 84, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff0_thd3; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$read_delayed; [L733] 0 int *x$read_delayed_var; [L734] 0 int x$w_buff0; [L735] 0 _Bool x$w_buff0_used; [L736] 0 int x$w_buff1; [L737] 0 _Bool x$w_buff1_used; [L739] 0 int y = 0; [L740] 0 _Bool y$flush_delayed; [L741] 0 int y$mem_tmp; [L742] 0 _Bool y$r_buff0_thd0; [L743] 0 _Bool y$r_buff0_thd1; [L744] 0 _Bool y$r_buff0_thd2; [L745] 0 _Bool y$r_buff0_thd3; [L746] 0 _Bool y$r_buff1_thd0; [L747] 0 _Bool y$r_buff1_thd1; [L748] 0 _Bool y$r_buff1_thd2; [L749] 0 _Bool y$r_buff1_thd3; [L750] 0 _Bool y$read_delayed; [L751] 0 int *y$read_delayed_var; [L752] 0 int y$w_buff0; [L753] 0 _Bool y$w_buff0_used; [L754] 0 int y$w_buff1; [L755] 0 _Bool y$w_buff1_used; [L757] 0 int z = 0; [L758] 0 _Bool weak$$choice0; [L759] 0 _Bool weak$$choice2; [L899] 0 pthread_t t171; [L900] FCALL, FORK 0 pthread_create(&t171, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t171, ((void *)0), P0, ((void *)0))=-3, t171={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L901] 0 pthread_t t172; [L902] FCALL, FORK 0 pthread_create(&t172, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t172, ((void *)0), P1, ((void *)0))=-2, t171={5:0}, t172={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L903] 0 pthread_t t173; [L904] FCALL, FORK 0 pthread_create(&t173, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t173, ((void *)0), P2, ((void *)0))=-1, t171={5:0}, t172={6:0}, t173={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L841] 3 y$w_buff1 = y$w_buff0 [L842] 3 y$w_buff0 = 1 [L843] 3 y$w_buff1_used = y$w_buff0_used [L844] 3 y$w_buff0_used = (_Bool)1 [L845] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L845] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L846] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L847] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L848] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L849] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L850] 3 y$r_buff0_thd3 = (_Bool)1 [L853] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 3 y$flush_delayed = weak$$choice2 [L856] 3 y$mem_tmp = y [L857] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L858] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L859] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L860] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L861] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L862] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L863] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L864] 3 __unbuffered_p2_EAX = y [L865] 3 y = y$flush_delayed ? y$mem_tmp : y [L866] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L869] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L763] 1 z = 1 [L766] 1 x = 1 [L769] 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) [L770] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L771] 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 [L772] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L773] 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_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] 2 x$w_buff1 = x$w_buff0 [L784] 2 x$w_buff0 = 2 [L785] 2 x$w_buff1_used = x$w_buff0_used [L786] 2 x$w_buff0_used = (_Bool)1 [L787] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L787] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L788] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L789] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L790] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L791] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L792] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 2 x$flush_delayed = weak$$choice2 [L798] 2 x$mem_tmp = x [L799] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L800] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L801] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L802] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L803] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L804] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L805] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L806] 2 __unbuffered_p1_EAX = x [L807] 2 x = x$flush_delayed ? x$mem_tmp : x [L808] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 2 y$flush_delayed = weak$$choice2 [L814] 2 y$mem_tmp = y [L815] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L816] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L817] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L818] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L819] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L820] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L821] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L822] 2 __unbuffered_p1_EBX = y [L823] 2 y = y$flush_delayed ? y$mem_tmp : y [L824] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] 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) [L828] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L829] 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 [L830] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L831] 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L834] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L872] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L873] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L874] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L875] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L876] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L877] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L878] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L879] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L880] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L881] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L884] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L906] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L908] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L908] RET 0 assume_abort_if_not(main$tmp_guard0) [L910] 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) [L911] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L912] 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 [L913] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L914] 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 [L915] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L916] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L917] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L918] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L919] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L922] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L923] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L924] 0 x$flush_delayed = weak$$choice2 [L925] 0 x$mem_tmp = x [L926] 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) [L927] 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)) [L928] 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)) [L929] 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)) [L930] 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)) [L931] 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)) [L932] 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)) [L933] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L934] 0 x = x$flush_delayed ? x$mem_tmp : x [L935] 0 x$flush_delayed = (_Bool)0 [L937] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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: 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: 900]: 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: 902]: 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: 904]: 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 7 procedures, 159 locations, 8 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: 29.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 404 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 404 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1090 IncrementalHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 3 mSDtfsCounter, 1090 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=411occurred in iteration=11, InterpolantAutomatonStates: 51, 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.6s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 177 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 1549 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 09:18:12,518 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...