/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:48:49,867 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:48:49,868 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:48:49,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:48:49,899 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:48:49,901 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:48:49,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:48:49,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:48:49,908 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:48:49,912 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:48:49,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:48:49,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:48:49,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:48:49,916 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:48:49,917 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:48:49,918 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:48:49,918 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:48:49,919 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:48:49,921 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:48:49,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:48:49,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:48:49,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:48:49,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:48:49,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:48:49,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:48:49,935 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:48:49,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:48:49,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:48:49,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:48:49,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:48:49,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:48:49,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:48:49,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:48:49,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:48:49,941 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:48:49,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:48:49,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:48:49,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:48:49,942 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:48:49,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:48:49,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:48:49,946 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 11:48:49,972 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:48:49,972 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:48:49,974 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:48:49,974 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:48:49,974 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:48:49,975 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:48:49,975 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:48:49,975 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:48:49,975 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:48:49,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:48:49,976 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:48:49,976 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:48:49,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:48:49,976 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:48:49,976 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:48:49,976 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:48:49,977 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:48:49,977 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:48:49,977 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:48:49,977 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:48:49,977 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:48:49,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:48:49,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:48:49,977 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:48:49,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:48:49,978 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:48:49,978 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:48:49,978 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:48:49,978 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 11:48:50,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:48:50,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:48:50,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:48:50,260 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:48:50,260 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:48:50,261 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-12-13 11:48:51,266 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:48:51,445 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:48:51,446 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-12-13 11:48:51,455 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed6080d09/4b3fc68a0eab48ccb6fa8ed304fa6b8e/FLAG47a75ba92 [2022-12-13 11:48:51,471 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed6080d09/4b3fc68a0eab48ccb6fa8ed304fa6b8e [2022-12-13 11:48:51,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:48:51,473 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:48:51,474 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:48:51,474 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:48:51,476 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:48:51,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:48:51" (1/1) ... [2022-12-13 11:48:51,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c54aab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:51, skipping insertion in model container [2022-12-13 11:48:51,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:48:51" (1/1) ... [2022-12-13 11:48:51,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:48:51,536 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:48:51,718 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/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2022-12-13 11:48:51,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:48:51,916 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:48:51,925 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/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2022-12-13 11:48:51,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:51,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:51,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:48:52,009 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:48:52,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:52 WrapperNode [2022-12-13 11:48:52,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:48:52,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:48:52,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:48:52,011 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:48:52,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:52" (1/1) ... [2022-12-13 11:48:52,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:52" (1/1) ... [2022-12-13 11:48:52,062 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 137 [2022-12-13 11:48:52,063 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:48:52,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:48:52,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:48:52,064 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:48:52,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:52" (1/1) ... [2022-12-13 11:48:52,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:52" (1/1) ... [2022-12-13 11:48:52,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:52" (1/1) ... [2022-12-13 11:48:52,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:52" (1/1) ... [2022-12-13 11:48:52,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:52" (1/1) ... [2022-12-13 11:48:52,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:52" (1/1) ... [2022-12-13 11:48:52,079 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:52" (1/1) ... [2022-12-13 11:48:52,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:52" (1/1) ... [2022-12-13 11:48:52,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:48:52,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:48:52,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:48:52,083 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:48:52,083 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:52" (1/1) ... [2022-12-13 11:48:52,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:48:52,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:48:52,112 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 11:48:52,127 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 11:48:52,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:48:52,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:48:52,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:48:52,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:48:52,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:48:52,145 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:48:52,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:48:52,145 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:48:52,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:48:52,145 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:48:52,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:48:52,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:48:52,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:48:52,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:48:52,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:48:52,147 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 11:48:52,233 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:48:52,234 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:48:52,458 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:48:52,543 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:48:52,543 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:48:52,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:48:52 BoogieIcfgContainer [2022-12-13 11:48:52,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:48:52,547 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:48:52,547 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:48:52,549 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:48:52,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:48:51" (1/3) ... [2022-12-13 11:48:52,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6f69de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:48:52, skipping insertion in model container [2022-12-13 11:48:52,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:52" (2/3) ... [2022-12-13 11:48:52,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6f69de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:48:52, skipping insertion in model container [2022-12-13 11:48:52,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:48:52" (3/3) ... [2022-12-13 11:48:52,550 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-12-13 11:48:52,562 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:48:52,563 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:48:52,563 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:48:52,595 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:48:52,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-12-13 11:48:52,669 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-12-13 11:48:52,670 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:48:52,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-13 11:48:52,675 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-12-13 11:48:52,677 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-12-13 11:48:52,678 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:52,701 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 111 transitions, 231 flow [2022-12-13 11:48:52,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 231 flow [2022-12-13 11:48:52,737 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-12-13 11:48:52,737 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:48:52,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-13 11:48:52,741 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 111 transitions, 231 flow [2022-12-13 11:48:52,741 INFO L226 LiptonReduction]: Number of co-enabled transitions 2240 [2022-12-13 11:48:57,337 INFO L241 LiptonReduction]: Total number of compositions: 92 [2022-12-13 11:48:57,347 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:48:57,352 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;@757bc069, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:48:57,352 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 11:48:57,354 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 11:48:57,354 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:48:57,354 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:57,355 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 11:48:57,355 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:48:57,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:57,358 INFO L85 PathProgramCache]: Analyzing trace with hash 513275, now seen corresponding path program 1 times [2022-12-13 11:48:57,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:57,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352734470] [2022-12-13 11:48:57,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:57,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:57,567 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 11:48:57,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:57,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352734470] [2022-12-13 11:48:57,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352734470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:57,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:57,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:48:57,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263714844] [2022-12-13 11:48:57,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:57,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:48:57,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:57,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:48:57,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:48:57,586 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 68 [2022-12-13 11:48:57,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 68 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 11:48:57,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:57,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 68 [2022-12-13 11:48:57,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:59,050 INFO L130 PetriNetUnfolder]: 13250/20508 cut-off events. [2022-12-13 11:48:59,050 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-12-13 11:48:59,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39352 conditions, 20508 events. 13250/20508 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 1100. Compared 154903 event pairs, 1220 based on Foata normal form. 0/12354 useless extension candidates. Maximal degree in co-relation 39341. Up to 16747 conditions per place. [2022-12-13 11:48:59,103 INFO L137 encePairwiseOnDemand]: 63/68 looper letters, 37 selfloop transitions, 3 changer transitions 59/111 dead transitions. [2022-12-13 11:48:59,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 111 transitions, 433 flow [2022-12-13 11:48:59,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:48:59,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:48:59,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2022-12-13 11:48:59,110 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6862745098039216 [2022-12-13 11:48:59,111 INFO L175 Difference]: Start difference. First operand has 78 places, 68 transitions, 145 flow. Second operand 3 states and 140 transitions. [2022-12-13 11:48:59,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 111 transitions, 433 flow [2022-12-13 11:48:59,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 111 transitions, 428 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 11:48:59,115 INFO L231 Difference]: Finished difference. Result has 75 places, 36 transitions, 84 flow [2022-12-13 11:48:59,116 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=75, PETRI_TRANSITIONS=36} [2022-12-13 11:48:59,119 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -3 predicate places. [2022-12-13 11:48:59,119 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:59,119 INFO L89 Accepts]: Start accepts. Operand has 75 places, 36 transitions, 84 flow [2022-12-13 11:48:59,122 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:59,122 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:59,122 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 36 transitions, 84 flow [2022-12-13 11:48:59,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 84 flow [2022-12-13 11:48:59,127 INFO L130 PetriNetUnfolder]: 0/36 cut-off events. [2022-12-13 11:48:59,127 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:48:59,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 36 events. 0/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 100 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 11:48:59,129 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 36 transitions, 84 flow [2022-12-13 11:48:59,129 INFO L226 LiptonReduction]: Number of co-enabled transitions 754 [2022-12-13 11:48:59,269 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:48:59,270 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-13 11:48:59,270 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 84 flow [2022-12-13 11:48:59,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 11:48:59,270 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:59,271 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:48:59,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:48:59,271 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:48:59,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:59,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1085961309, now seen corresponding path program 1 times [2022-12-13 11:48:59,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:59,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756052774] [2022-12-13 11:48:59,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:59,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:59,461 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 11:48:59,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:59,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756052774] [2022-12-13 11:48:59,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756052774] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:59,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:59,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:48:59,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431649330] [2022-12-13 11:48:59,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:59,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:48:59,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:59,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:48:59,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:48:59,463 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2022-12-13 11:48:59,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:59,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:59,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2022-12-13 11:48:59,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:49:00,175 INFO L130 PetriNetUnfolder]: 6355/9718 cut-off events. [2022-12-13 11:49:00,175 INFO L131 PetriNetUnfolder]: For 337/337 co-relation queries the response was YES. [2022-12-13 11:49:00,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19782 conditions, 9718 events. 6355/9718 cut-off events. For 337/337 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 58649 event pairs, 2079 based on Foata normal form. 0/7722 useless extension candidates. Maximal degree in co-relation 19772. Up to 6027 conditions per place. [2022-12-13 11:49:00,215 INFO L137 encePairwiseOnDemand]: 28/36 looper letters, 44 selfloop transitions, 7 changer transitions 2/61 dead transitions. [2022-12-13 11:49:00,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 61 transitions, 248 flow [2022-12-13 11:49:00,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:49:00,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:49:00,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-12-13 11:49:00,217 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2022-12-13 11:49:00,217 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 84 flow. Second operand 3 states and 78 transitions. [2022-12-13 11:49:00,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 61 transitions, 248 flow [2022-12-13 11:49:00,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:49:00,219 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 130 flow [2022-12-13 11:49:00,220 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2022-12-13 11:49:00,220 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -31 predicate places. [2022-12-13 11:49:00,220 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:49:00,220 INFO L89 Accepts]: Start accepts. Operand has 47 places, 41 transitions, 130 flow [2022-12-13 11:49:00,221 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:49:00,221 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:49:00,221 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 41 transitions, 130 flow [2022-12-13 11:49:00,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 41 transitions, 130 flow [2022-12-13 11:49:00,237 INFO L130 PetriNetUnfolder]: 72/319 cut-off events. [2022-12-13 11:49:00,238 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-13 11:49:00,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 319 events. 72/319 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2198 event pairs, 36 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 516. Up to 117 conditions per place. [2022-12-13 11:49:00,241 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 41 transitions, 130 flow [2022-12-13 11:49:00,241 INFO L226 LiptonReduction]: Number of co-enabled transitions 830 [2022-12-13 11:49:00,285 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:49:00,286 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-13 11:49:00,287 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 130 flow [2022-12-13 11:49:00,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:49:00,287 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:49:00,287 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:00,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:49:00,288 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:49:00,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:00,288 INFO L85 PathProgramCache]: Analyzing trace with hash -694939643, now seen corresponding path program 1 times [2022-12-13 11:49:00,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:00,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36419225] [2022-12-13 11:49:00,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:00,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:00,391 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 11:49:00,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:00,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36419225] [2022-12-13 11:49:00,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36419225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:00,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:00,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:49:00,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189883539] [2022-12-13 11:49:00,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:00,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:49:00,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:00,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:49:00,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:49:00,394 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 11:49:00,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 11:49:00,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:49:00,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 11:49:00,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:49:00,887 INFO L130 PetriNetUnfolder]: 4678/7288 cut-off events. [2022-12-13 11:49:00,887 INFO L131 PetriNetUnfolder]: For 2265/2265 co-relation queries the response was YES. [2022-12-13 11:49:00,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16878 conditions, 7288 events. 4678/7288 cut-off events. For 2265/2265 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 42227 event pairs, 1108 based on Foata normal form. 78/6069 useless extension candidates. Maximal degree in co-relation 16866. Up to 3497 conditions per place. [2022-12-13 11:49:00,914 INFO L137 encePairwiseOnDemand]: 28/35 looper letters, 55 selfloop transitions, 7 changer transitions 0/70 dead transitions. [2022-12-13 11:49:00,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 70 transitions, 328 flow [2022-12-13 11:49:00,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:49:00,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:49:00,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-12-13 11:49:00,918 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2022-12-13 11:49:00,918 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 130 flow. Second operand 4 states and 90 transitions. [2022-12-13 11:49:00,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 70 transitions, 328 flow [2022-12-13 11:49:00,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 70 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:49:00,927 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 164 flow [2022-12-13 11:49:00,928 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2022-12-13 11:49:00,928 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -28 predicate places. [2022-12-13 11:49:00,928 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:49:00,928 INFO L89 Accepts]: Start accepts. Operand has 50 places, 44 transitions, 164 flow [2022-12-13 11:49:00,929 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:49:00,929 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:49:00,929 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 44 transitions, 164 flow [2022-12-13 11:49:00,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 44 transitions, 164 flow [2022-12-13 11:49:00,940 INFO L130 PetriNetUnfolder]: 48/228 cut-off events. [2022-12-13 11:49:00,941 INFO L131 PetriNetUnfolder]: For 60/64 co-relation queries the response was YES. [2022-12-13 11:49:00,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 228 events. 48/228 cut-off events. For 60/64 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1350 event pairs, 18 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 422. Up to 83 conditions per place. [2022-12-13 11:49:00,942 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 44 transitions, 164 flow [2022-12-13 11:49:00,942 INFO L226 LiptonReduction]: Number of co-enabled transitions 876 [2022-12-13 11:49:00,944 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:49:00,945 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 11:49:00,945 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 164 flow [2022-12-13 11:49:00,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 11:49:00,945 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:49:00,945 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:00,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:49:00,945 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:49:00,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:00,946 INFO L85 PathProgramCache]: Analyzing trace with hash -157841589, now seen corresponding path program 1 times [2022-12-13 11:49:00,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:00,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011566103] [2022-12-13 11:49:00,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:00,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:01,028 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 11:49:01,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:01,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011566103] [2022-12-13 11:49:01,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011566103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:01,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:01,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:49:01,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583228723] [2022-12-13 11:49:01,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:01,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:49:01,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:01,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:49:01,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:49:01,030 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 11:49:01,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:49:01,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:49:01,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 11:49:01,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:49:01,530 INFO L130 PetriNetUnfolder]: 4348/6811 cut-off events. [2022-12-13 11:49:01,530 INFO L131 PetriNetUnfolder]: For 3707/3707 co-relation queries the response was YES. [2022-12-13 11:49:01,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16513 conditions, 6811 events. 4348/6811 cut-off events. For 3707/3707 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 39539 event pairs, 1838 based on Foata normal form. 90/5714 useless extension candidates. Maximal degree in co-relation 16498. Up to 3065 conditions per place. [2022-12-13 11:49:01,557 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 57 selfloop transitions, 11 changer transitions 1/77 dead transitions. [2022-12-13 11:49:01,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 77 transitions, 406 flow [2022-12-13 11:49:01,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:49:01,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:49:01,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-13 11:49:01,559 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6714285714285714 [2022-12-13 11:49:01,559 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 164 flow. Second operand 4 states and 94 transitions. [2022-12-13 11:49:01,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 77 transitions, 406 flow [2022-12-13 11:49:01,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 77 transitions, 401 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:49:01,567 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 248 flow [2022-12-13 11:49:01,567 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=248, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2022-12-13 11:49:01,568 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -23 predicate places. [2022-12-13 11:49:01,568 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:49:01,568 INFO L89 Accepts]: Start accepts. Operand has 55 places, 48 transitions, 248 flow [2022-12-13 11:49:01,569 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:49:01,569 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:49:01,569 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 48 transitions, 248 flow [2022-12-13 11:49:01,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 48 transitions, 248 flow [2022-12-13 11:49:01,583 INFO L130 PetriNetUnfolder]: 39/200 cut-off events. [2022-12-13 11:49:01,584 INFO L131 PetriNetUnfolder]: For 166/167 co-relation queries the response was YES. [2022-12-13 11:49:01,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 200 events. 39/200 cut-off events. For 166/167 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1137 event pairs, 14 based on Foata normal form. 1/146 useless extension candidates. Maximal degree in co-relation 454. Up to 70 conditions per place. [2022-12-13 11:49:01,586 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 48 transitions, 248 flow [2022-12-13 11:49:01,586 INFO L226 LiptonReduction]: Number of co-enabled transitions 878 [2022-12-13 11:49:01,588 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:49:01,589 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 11:49:01,589 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 248 flow [2022-12-13 11:49:01,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:49:01,589 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:49:01,589 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:01,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:49:01,589 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:49:01,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:01,590 INFO L85 PathProgramCache]: Analyzing trace with hash 185769180, now seen corresponding path program 1 times [2022-12-13 11:49:01,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:01,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689627766] [2022-12-13 11:49:01,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:01,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:01,674 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 11:49:01,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:01,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689627766] [2022-12-13 11:49:01,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689627766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:01,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:01,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:49:01,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540949302] [2022-12-13 11:49:01,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:01,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:49:01,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:01,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:49:01,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:49:01,676 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2022-12-13 11:49:01,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 11:49:01,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:49:01,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2022-12-13 11:49:01,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:49:02,179 INFO L130 PetriNetUnfolder]: 3932/6240 cut-off events. [2022-12-13 11:49:02,180 INFO L131 PetriNetUnfolder]: For 5858/6137 co-relation queries the response was YES. [2022-12-13 11:49:02,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15573 conditions, 6240 events. 3932/6240 cut-off events. For 5858/6137 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 37653 event pairs, 1051 based on Foata normal form. 119/4547 useless extension candidates. Maximal degree in co-relation 15554. Up to 5779 conditions per place. [2022-12-13 11:49:02,200 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 49 selfloop transitions, 10 changer transitions 0/75 dead transitions. [2022-12-13 11:49:02,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 75 transitions, 480 flow [2022-12-13 11:49:02,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:49:02,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:49:02,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-13 11:49:02,201 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2022-12-13 11:49:02,201 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 248 flow. Second operand 3 states and 72 transitions. [2022-12-13 11:49:02,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 75 transitions, 480 flow [2022-12-13 11:49:02,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 75 transitions, 473 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:49:02,205 INFO L231 Difference]: Finished difference. Result has 56 places, 57 transitions, 312 flow [2022-12-13 11:49:02,205 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=56, PETRI_TRANSITIONS=57} [2022-12-13 11:49:02,206 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -22 predicate places. [2022-12-13 11:49:02,206 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:49:02,206 INFO L89 Accepts]: Start accepts. Operand has 56 places, 57 transitions, 312 flow [2022-12-13 11:49:02,206 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:49:02,206 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:49:02,207 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 57 transitions, 312 flow [2022-12-13 11:49:02,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 57 transitions, 312 flow [2022-12-13 11:49:02,282 INFO L130 PetriNetUnfolder]: 804/1742 cut-off events. [2022-12-13 11:49:02,282 INFO L131 PetriNetUnfolder]: For 592/656 co-relation queries the response was YES. [2022-12-13 11:49:02,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3748 conditions, 1742 events. 804/1742 cut-off events. For 592/656 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 14338 event pairs, 408 based on Foata normal form. 1/967 useless extension candidates. Maximal degree in co-relation 3730. Up to 1261 conditions per place. [2022-12-13 11:49:02,295 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 57 transitions, 312 flow [2022-12-13 11:49:02,296 INFO L226 LiptonReduction]: Number of co-enabled transitions 1080 [2022-12-13 11:49:02,307 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:49:02,308 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 11:49:02,308 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 312 flow [2022-12-13 11:49:02,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 11:49:02,308 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:49:02,308 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 11:49:02,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:49:02,308 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:49:02,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:02,309 INFO L85 PathProgramCache]: Analyzing trace with hash -815115255, now seen corresponding path program 1 times [2022-12-13 11:49:02,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:02,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919904643] [2022-12-13 11:49:02,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:02,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:02,418 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 11:49:02,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:02,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919904643] [2022-12-13 11:49:02,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919904643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:02,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:02,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:49:02,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832413805] [2022-12-13 11:49:02,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:02,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:49:02,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:02,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:49:02,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:49:02,419 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2022-12-13 11:49:02,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 312 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 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 11:49:02,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:49:02,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2022-12-13 11:49:02,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:49:03,155 INFO L130 PetriNetUnfolder]: 6218/10020 cut-off events. [2022-12-13 11:49:03,155 INFO L131 PetriNetUnfolder]: For 12816/13047 co-relation queries the response was YES. [2022-12-13 11:49:03,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31049 conditions, 10020 events. 6218/10020 cut-off events. For 12816/13047 co-relation queries the response was YES. Maximal size of possible extension queue 578. Compared 68132 event pairs, 1246 based on Foata normal form. 223/8473 useless extension candidates. Maximal degree in co-relation 31028. Up to 5299 conditions per place. [2022-12-13 11:49:03,189 INFO L137 encePairwiseOnDemand]: 25/34 looper letters, 98 selfloop transitions, 20 changer transitions 4/133 dead transitions. [2022-12-13 11:49:03,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 133 transitions, 889 flow [2022-12-13 11:49:03,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:49:03,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:49:03,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2022-12-13 11:49:03,190 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6715686274509803 [2022-12-13 11:49:03,191 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 312 flow. Second operand 6 states and 137 transitions. [2022-12-13 11:49:03,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 133 transitions, 889 flow [2022-12-13 11:49:03,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 133 transitions, 863 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:49:03,204 INFO L231 Difference]: Finished difference. Result has 63 places, 66 transitions, 462 flow [2022-12-13 11:49:03,204 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=462, PETRI_PLACES=63, PETRI_TRANSITIONS=66} [2022-12-13 11:49:03,204 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -15 predicate places. [2022-12-13 11:49:03,204 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:49:03,204 INFO L89 Accepts]: Start accepts. Operand has 63 places, 66 transitions, 462 flow [2022-12-13 11:49:03,205 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:49:03,205 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:49:03,205 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 66 transitions, 462 flow [2022-12-13 11:49:03,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 66 transitions, 462 flow [2022-12-13 11:49:03,317 INFO L130 PetriNetUnfolder]: 1372/2838 cut-off events. [2022-12-13 11:49:03,317 INFO L131 PetriNetUnfolder]: For 1282/1345 co-relation queries the response was YES. [2022-12-13 11:49:03,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6077 conditions, 2838 events. 1372/2838 cut-off events. For 1282/1345 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 24635 event pairs, 674 based on Foata normal form. 11/1454 useless extension candidates. Maximal degree in co-relation 6055. Up to 2278 conditions per place. [2022-12-13 11:49:03,336 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 66 transitions, 462 flow [2022-12-13 11:49:03,336 INFO L226 LiptonReduction]: Number of co-enabled transitions 1284 [2022-12-13 11:49:03,350 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:49:03,351 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 147 [2022-12-13 11:49:03,351 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 66 transitions, 462 flow [2022-12-13 11:49:03,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 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 11:49:03,351 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:49:03,351 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:03,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:49:03,351 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:49:03,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:03,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1213646045, now seen corresponding path program 1 times [2022-12-13 11:49:03,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:03,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040146963] [2022-12-13 11:49:03,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:03,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:03,434 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 11:49:03,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:03,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040146963] [2022-12-13 11:49:03,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040146963] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:03,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:03,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:49:03,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605007934] [2022-12-13 11:49:03,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:03,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:49:03,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:03,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:49:03,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:49:03,436 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2022-12-13 11:49:03,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 66 transitions, 462 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 11:49:03,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:49:03,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2022-12-13 11:49:03,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:49:03,842 INFO L130 PetriNetUnfolder]: 3013/5438 cut-off events. [2022-12-13 11:49:03,842 INFO L131 PetriNetUnfolder]: For 7004/7130 co-relation queries the response was YES. [2022-12-13 11:49:03,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16970 conditions, 5438 events. 3013/5438 cut-off events. For 7004/7130 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 38255 event pairs, 399 based on Foata normal form. 397/4162 useless extension candidates. Maximal degree in co-relation 16945. Up to 3781 conditions per place. [2022-12-13 11:49:03,856 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 65 selfloop transitions, 19 changer transitions 7/110 dead transitions. [2022-12-13 11:49:03,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 110 transitions, 923 flow [2022-12-13 11:49:03,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:49:03,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:49:03,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-12-13 11:49:03,858 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7279411764705882 [2022-12-13 11:49:03,858 INFO L175 Difference]: Start difference. First operand has 63 places, 66 transitions, 462 flow. Second operand 4 states and 99 transitions. [2022-12-13 11:49:03,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 110 transitions, 923 flow [2022-12-13 11:49:03,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 110 transitions, 919 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-13 11:49:03,865 INFO L231 Difference]: Finished difference. Result has 67 places, 73 transitions, 542 flow [2022-12-13 11:49:03,865 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=542, PETRI_PLACES=67, PETRI_TRANSITIONS=73} [2022-12-13 11:49:03,866 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -11 predicate places. [2022-12-13 11:49:03,866 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:49:03,866 INFO L89 Accepts]: Start accepts. Operand has 67 places, 73 transitions, 542 flow [2022-12-13 11:49:03,867 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:49:03,867 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:49:03,867 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 73 transitions, 542 flow [2022-12-13 11:49:03,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 73 transitions, 542 flow [2022-12-13 11:49:03,958 INFO L130 PetriNetUnfolder]: 653/1774 cut-off events. [2022-12-13 11:49:03,959 INFO L131 PetriNetUnfolder]: For 1195/1611 co-relation queries the response was YES. [2022-12-13 11:49:03,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5418 conditions, 1774 events. 653/1774 cut-off events. For 1195/1611 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 15961 event pairs, 127 based on Foata normal form. 14/1065 useless extension candidates. Maximal degree in co-relation 5393. Up to 1252 conditions per place. [2022-12-13 11:49:03,969 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 73 transitions, 542 flow [2022-12-13 11:49:03,969 INFO L226 LiptonReduction]: Number of co-enabled transitions 1198 [2022-12-13 11:49:04,010 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:49:04,011 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 11:49:04,011 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 73 transitions, 542 flow [2022-12-13 11:49:04,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 11:49:04,011 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:49:04,011 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 11:49:04,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:49:04,011 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:49:04,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:04,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1753437133, now seen corresponding path program 1 times [2022-12-13 11:49:04,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:04,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605220546] [2022-12-13 11:49:04,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:04,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:04,200 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 11:49:04,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:04,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605220546] [2022-12-13 11:49:04,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605220546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:04,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:04,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:49:04,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074694422] [2022-12-13 11:49:04,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:04,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:49:04,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:04,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:49:04,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:49:04,202 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2022-12-13 11:49:04,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 73 transitions, 542 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 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 11:49:04,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:49:04,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2022-12-13 11:49:04,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:49:04,443 INFO L130 PetriNetUnfolder]: 1588/2935 cut-off events. [2022-12-13 11:49:04,443 INFO L131 PetriNetUnfolder]: For 4124/4204 co-relation queries the response was YES. [2022-12-13 11:49:04,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11493 conditions, 2935 events. 1588/2935 cut-off events. For 4124/4204 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 18696 event pairs, 151 based on Foata normal form. 318/2258 useless extension candidates. Maximal degree in co-relation 11465. Up to 1492 conditions per place. [2022-12-13 11:49:04,453 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 40 selfloop transitions, 28 changer transitions 29/106 dead transitions. [2022-12-13 11:49:04,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 106 transitions, 933 flow [2022-12-13 11:49:04,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:49:04,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:49:04,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2022-12-13 11:49:04,455 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6294117647058823 [2022-12-13 11:49:04,455 INFO L175 Difference]: Start difference. First operand has 67 places, 73 transitions, 542 flow. Second operand 5 states and 107 transitions. [2022-12-13 11:49:04,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 106 transitions, 933 flow [2022-12-13 11:49:04,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 106 transitions, 876 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-13 11:49:04,462 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 395 flow [2022-12-13 11:49:04,462 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=395, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2022-12-13 11:49:04,462 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -10 predicate places. [2022-12-13 11:49:04,463 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:49:04,463 INFO L89 Accepts]: Start accepts. Operand has 68 places, 57 transitions, 395 flow [2022-12-13 11:49:04,464 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:49:04,464 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:49:04,464 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 57 transitions, 395 flow [2022-12-13 11:49:04,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 57 transitions, 395 flow [2022-12-13 11:49:04,489 INFO L130 PetriNetUnfolder]: 208/587 cut-off events. [2022-12-13 11:49:04,489 INFO L131 PetriNetUnfolder]: For 396/627 co-relation queries the response was YES. [2022-12-13 11:49:04,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2100 conditions, 587 events. 208/587 cut-off events. For 396/627 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 4048 event pairs, 3 based on Foata normal form. 0/297 useless extension candidates. Maximal degree in co-relation 2076. Up to 397 conditions per place. [2022-12-13 11:49:04,492 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 57 transitions, 395 flow [2022-12-13 11:49:04,492 INFO L226 LiptonReduction]: Number of co-enabled transitions 654 [2022-12-13 11:49:04,941 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 11:49:04,942 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 479 [2022-12-13 11:49:04,942 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 390 flow [2022-12-13 11:49:04,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 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 11:49:04,942 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:49:04,942 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 11:49:04,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:49:04,943 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:49:04,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:04,943 INFO L85 PathProgramCache]: Analyzing trace with hash 253129182, now seen corresponding path program 1 times [2022-12-13 11:49:04,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:04,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811421776] [2022-12-13 11:49:04,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:04,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:05,620 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 11:49:05,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:05,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811421776] [2022-12-13 11:49:05,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811421776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:05,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:05,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:49:05,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868615683] [2022-12-13 11:49:05,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:05,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:49:05,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:05,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:49:05,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:49:05,621 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 11:49:05,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 390 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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 11:49:05,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:49:05,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 11:49:05,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:49:05,955 INFO L130 PetriNetUnfolder]: 1108/2040 cut-off events. [2022-12-13 11:49:05,955 INFO L131 PetriNetUnfolder]: For 6032/6192 co-relation queries the response was YES. [2022-12-13 11:49:05,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8764 conditions, 2040 events. 1108/2040 cut-off events. For 6032/6192 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 12870 event pairs, 95 based on Foata normal form. 103/1644 useless extension candidates. Maximal degree in co-relation 8737. Up to 1131 conditions per place. [2022-12-13 11:49:05,965 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 51 selfloop transitions, 5 changer transitions 55/127 dead transitions. [2022-12-13 11:49:05,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 127 transitions, 1136 flow [2022-12-13 11:49:05,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:49:05,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:49:05,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2022-12-13 11:49:05,967 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6302083333333334 [2022-12-13 11:49:05,967 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 390 flow. Second operand 6 states and 121 transitions. [2022-12-13 11:49:05,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 127 transitions, 1136 flow [2022-12-13 11:49:05,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 127 transitions, 875 flow, removed 45 selfloop flow, removed 10 redundant places. [2022-12-13 11:49:05,997 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 301 flow [2022-12-13 11:49:05,997 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=301, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2022-12-13 11:49:05,998 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -18 predicate places. [2022-12-13 11:49:05,998 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:49:05,998 INFO L89 Accepts]: Start accepts. Operand has 60 places, 55 transitions, 301 flow [2022-12-13 11:49:05,998 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:49:05,999 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:49:05,999 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 55 transitions, 301 flow [2022-12-13 11:49:05,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 55 transitions, 301 flow [2022-12-13 11:49:06,029 INFO L130 PetriNetUnfolder]: 237/551 cut-off events. [2022-12-13 11:49:06,029 INFO L131 PetriNetUnfolder]: For 532/553 co-relation queries the response was YES. [2022-12-13 11:49:06,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1576 conditions, 551 events. 237/551 cut-off events. For 532/553 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 3538 event pairs, 4 based on Foata normal form. 6/227 useless extension candidates. Maximal degree in co-relation 1556. Up to 262 conditions per place. [2022-12-13 11:49:06,034 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 55 transitions, 301 flow [2022-12-13 11:49:06,034 INFO L226 LiptonReduction]: Number of co-enabled transitions 568 [2022-12-13 11:49:06,160 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:49:06,161 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-13 11:49:06,161 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 304 flow [2022-12-13 11:49:06,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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 11:49:06,161 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:49:06,161 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 11:49:06,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:49:06,161 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:49:06,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:06,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1760567058, now seen corresponding path program 1 times [2022-12-13 11:49:06,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:06,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961223861] [2022-12-13 11:49:06,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:06,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:06,332 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 11:49:06,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:06,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961223861] [2022-12-13 11:49:06,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961223861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:06,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:06,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:49:06,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739465508] [2022-12-13 11:49:06,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:06,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:49:06,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:06,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:49:06,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:49:06,334 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 11:49:06,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 304 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 11:49:06,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:49:06,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 11:49:06,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:49:06,539 INFO L130 PetriNetUnfolder]: 1003/1902 cut-off events. [2022-12-13 11:49:06,539 INFO L131 PetriNetUnfolder]: For 3275/3393 co-relation queries the response was YES. [2022-12-13 11:49:06,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6656 conditions, 1902 events. 1003/1902 cut-off events. For 3275/3393 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 12133 event pairs, 145 based on Foata normal form. 134/1574 useless extension candidates. Maximal degree in co-relation 6633. Up to 730 conditions per place. [2022-12-13 11:49:06,546 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 39 selfloop transitions, 4 changer transitions 53/107 dead transitions. [2022-12-13 11:49:06,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 107 transitions, 744 flow [2022-12-13 11:49:06,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:49:06,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:49:06,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-12-13 11:49:06,547 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.575 [2022-12-13 11:49:06,547 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 304 flow. Second operand 5 states and 92 transitions. [2022-12-13 11:49:06,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 107 transitions, 744 flow [2022-12-13 11:49:06,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 107 transitions, 734 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-13 11:49:06,569 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 251 flow [2022-12-13 11:49:06,570 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=251, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2022-12-13 11:49:06,571 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -16 predicate places. [2022-12-13 11:49:06,571 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:49:06,571 INFO L89 Accepts]: Start accepts. Operand has 62 places, 45 transitions, 251 flow [2022-12-13 11:49:06,572 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:49:06,572 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:49:06,573 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 45 transitions, 251 flow [2022-12-13 11:49:06,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 45 transitions, 251 flow [2022-12-13 11:49:06,589 INFO L130 PetriNetUnfolder]: 100/241 cut-off events. [2022-12-13 11:49:06,590 INFO L131 PetriNetUnfolder]: For 607/629 co-relation queries the response was YES. [2022-12-13 11:49:06,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 241 events. 100/241 cut-off events. For 607/629 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1297 event pairs, 1 based on Foata normal form. 6/112 useless extension candidates. Maximal degree in co-relation 740. Up to 118 conditions per place. [2022-12-13 11:49:06,592 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 45 transitions, 251 flow [2022-12-13 11:49:06,592 INFO L226 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-13 11:49:07,356 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:49:07,357 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 786 [2022-12-13 11:49:07,357 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 239 flow [2022-12-13 11:49:07,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 11:49:07,357 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:49:07,357 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:07,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:49:07,358 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:49:07,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:07,358 INFO L85 PathProgramCache]: Analyzing trace with hash -401597687, now seen corresponding path program 1 times [2022-12-13 11:49:07,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:07,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843335251] [2022-12-13 11:49:07,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:07,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:49:07,435 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:49:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:49:07,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:49:07,513 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:49:07,513 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 11:49:07,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 11:49:07,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 11:49:07,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 11:49:07,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 11:49:07,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 11:49:07,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:49:07,517 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:07,525 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:49:07,525 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:49:07,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:49:07 BasicIcfg [2022-12-13 11:49:07,592 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:49:07,592 INFO L158 Benchmark]: Toolchain (without parser) took 16119.23ms. Allocated memory was 180.4MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 146.8MB in the beginning and 1.1GB in the end (delta: -988.1MB). Peak memory consumption was 855.6MB. Max. memory is 8.0GB. [2022-12-13 11:49:07,592 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory is still 110.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:49:07,593 INFO L158 Benchmark]: CACSL2BoogieTranslator took 536.21ms. Allocated memory is still 180.4MB. Free memory was 146.5MB in the beginning and 137.8MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-12-13 11:49:07,593 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.57ms. Allocated memory is still 180.4MB. Free memory was 137.8MB in the beginning and 135.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 11:49:07,593 INFO L158 Benchmark]: Boogie Preprocessor took 18.55ms. Allocated memory is still 180.4MB. Free memory was 135.2MB in the beginning and 133.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 11:49:07,593 INFO L158 Benchmark]: RCFGBuilder took 462.76ms. Allocated memory is still 180.4MB. Free memory was 133.1MB in the beginning and 136.4MB in the end (delta: -3.3MB). Peak memory consumption was 18.7MB. Max. memory is 8.0GB. [2022-12-13 11:49:07,593 INFO L158 Benchmark]: TraceAbstraction took 15045.22ms. Allocated memory was 180.4MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 135.4MB in the beginning and 1.1GB in the end (delta: -999.5MB). Peak memory consumption was 843.9MB. Max. memory is 8.0GB. [2022-12-13 11:49:07,594 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.09ms. Allocated memory is still 127.9MB. Free memory is still 110.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 536.21ms. Allocated memory is still 180.4MB. Free memory was 146.5MB in the beginning and 137.8MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.57ms. Allocated memory is still 180.4MB. Free memory was 137.8MB in the beginning and 135.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.55ms. Allocated memory is still 180.4MB. Free memory was 135.2MB in the beginning and 133.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 462.76ms. Allocated memory is still 180.4MB. Free memory was 133.1MB in the beginning and 136.4MB in the end (delta: -3.3MB). Peak memory consumption was 18.7MB. Max. memory is 8.0GB. * TraceAbstraction took 15045.22ms. Allocated memory was 180.4MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 135.4MB in the beginning and 1.1GB in the end (delta: -999.5MB). Peak memory consumption was 843.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 119 PlacesBefore, 78 PlacesAfterwards, 111 TransitionsBefore, 68 TransitionsAfterwards, 2240 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 41 TrivialYvCompositions, 43 ConcurrentYvCompositions, 5 ChoiceCompositions, 92 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4167, independent: 3976, independent conditional: 3976, independent unconditional: 0, dependent: 191, dependent conditional: 191, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4167, independent: 3976, independent conditional: 0, independent unconditional: 3976, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4167, independent: 3976, independent conditional: 0, independent unconditional: 3976, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4167, independent: 3976, independent conditional: 0, independent unconditional: 3976, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2210, independent: 2140, independent conditional: 0, independent unconditional: 2140, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2210, independent: 2120, independent conditional: 0, independent unconditional: 2120, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 90, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 208, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 187, dependent conditional: 0, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4167, independent: 1836, independent conditional: 0, independent unconditional: 1836, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 2210, unknown conditional: 0, unknown unconditional: 2210] , Statistics on independence cache: Total cache size (in pairs): 4273, Positive cache size: 4203, Positive conditional cache size: 0, Positive unconditional cache size: 4203, Negative cache size: 70, Negative conditional cache size: 0, Negative unconditional cache size: 70, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 45 PlacesBefore, 45 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 754 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 335, independent: 295, independent conditional: 295, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 335, independent: 295, independent conditional: 34, independent unconditional: 261, dependent: 40, dependent conditional: 9, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 335, independent: 295, independent conditional: 34, independent unconditional: 261, dependent: 40, dependent conditional: 9, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 335, independent: 295, independent conditional: 34, independent unconditional: 261, dependent: 40, dependent conditional: 9, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 263, independent: 234, independent conditional: 31, independent unconditional: 203, dependent: 29, dependent conditional: 4, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 263, independent: 221, independent conditional: 0, independent unconditional: 221, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 29, dependent conditional: 4, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 137, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 125, dependent conditional: 60, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 335, independent: 61, independent conditional: 3, independent unconditional: 58, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 263, unknown conditional: 35, unknown unconditional: 228] , Statistics on independence cache: Total cache size (in pairs): 263, Positive cache size: 234, Positive conditional cache size: 31, Positive unconditional cache size: 203, Negative cache size: 29, Negative conditional cache size: 4, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 830 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 249, independent: 221, independent conditional: 221, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 249, independent: 221, independent conditional: 21, independent unconditional: 200, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 249, independent: 221, independent conditional: 0, independent unconditional: 221, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 249, independent: 221, independent conditional: 0, independent unconditional: 221, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 66, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 66, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 30, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 249, independent: 161, independent conditional: 0, independent unconditional: 161, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 66, unknown conditional: 0, unknown unconditional: 66] , Statistics on independence cache: Total cache size (in pairs): 329, Positive cache size: 294, Positive conditional cache size: 31, Positive unconditional cache size: 263, Negative cache size: 35, Negative conditional cache size: 4, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 876 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 274, independent: 241, independent conditional: 241, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 274, independent: 241, independent conditional: 14, independent unconditional: 227, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 274, independent: 241, independent conditional: 0, independent unconditional: 241, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 274, independent: 241, independent conditional: 0, independent unconditional: 241, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 15, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 274, independent: 226, independent conditional: 0, independent unconditional: 226, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 344, Positive cache size: 309, Positive conditional cache size: 31, Positive unconditional cache size: 278, Negative cache size: 35, Negative conditional cache size: 4, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 878 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 281, independent: 243, independent conditional: 243, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 281, independent: 243, independent conditional: 29, independent unconditional: 214, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 281, independent: 243, independent conditional: 0, independent unconditional: 243, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 281, independent: 243, independent conditional: 0, independent unconditional: 243, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 281, independent: 241, independent conditional: 0, independent unconditional: 241, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 346, Positive cache size: 311, Positive conditional cache size: 31, Positive unconditional cache size: 280, Negative cache size: 35, Negative conditional cache size: 4, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 29, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 1080 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 186, independent: 150, independent conditional: 150, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 186, independent: 150, independent conditional: 0, independent unconditional: 150, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 186, independent: 150, independent conditional: 0, independent unconditional: 150, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 186, independent: 150, independent conditional: 0, independent unconditional: 150, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 186, independent: 150, independent conditional: 0, independent unconditional: 150, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 346, Positive cache size: 311, Positive conditional cache size: 31, Positive unconditional cache size: 280, Negative cache size: 35, Negative conditional cache size: 4, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 63 PlacesBefore, 63 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 1284 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 235, independent: 201, independent conditional: 201, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 235, independent: 201, independent conditional: 12, independent unconditional: 189, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 235, independent: 201, independent conditional: 0, independent unconditional: 201, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 235, independent: 201, independent conditional: 0, independent unconditional: 201, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 235, independent: 197, independent conditional: 0, independent unconditional: 197, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 350, Positive cache size: 315, Positive conditional cache size: 31, Positive unconditional cache size: 284, Negative cache size: 35, Negative conditional cache size: 4, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 1198 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 198, independent: 157, independent conditional: 157, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 198, independent: 157, independent conditional: 72, independent unconditional: 85, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 198, independent: 157, independent conditional: 72, independent unconditional: 85, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 198, independent: 157, independent conditional: 72, independent unconditional: 85, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 33, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 198, independent: 153, independent conditional: 69, independent unconditional: 84, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 6, unknown conditional: 3, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 356, Positive cache size: 319, Positive conditional cache size: 34, Positive unconditional cache size: 285, Negative cache size: 37, Negative conditional cache size: 4, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 66 PlacesBefore, 63 PlacesAfterwards, 57 TransitionsBefore, 54 TransitionsAfterwards, 654 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 365, independent: 301, independent conditional: 301, independent unconditional: 0, dependent: 64, dependent conditional: 64, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 365, independent: 301, independent conditional: 88, independent unconditional: 213, dependent: 64, dependent conditional: 22, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 409, independent: 301, independent conditional: 75, independent unconditional: 226, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 409, independent: 301, independent conditional: 75, independent unconditional: 226, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 13, independent conditional: 3, independent unconditional: 10, 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: 16, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 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: 28, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 409, independent: 288, independent conditional: 72, independent unconditional: 216, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 16, unknown conditional: 3, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 446, Positive cache size: 406, Positive conditional cache size: 43, Positive unconditional cache size: 363, Negative cache size: 40, Negative conditional cache size: 4, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 79, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 59 PlacesBefore, 59 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 568 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 146, independent: 122, independent conditional: 122, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 146, independent: 122, independent conditional: 50, independent unconditional: 72, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 146, independent: 122, independent conditional: 50, independent unconditional: 72, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 146, independent: 122, independent conditional: 50, independent unconditional: 72, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 17, independent conditional: 9, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 146, independent: 105, independent conditional: 41, independent unconditional: 64, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 18, unknown conditional: 9, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 487, Positive cache size: 446, Positive conditional cache size: 52, Positive unconditional cache size: 394, Negative cache size: 41, Negative conditional cache size: 4, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 56 PlacesBefore, 53 PlacesAfterwards, 45 TransitionsBefore, 42 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 247, independent: 227, independent conditional: 227, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 247, independent: 227, independent conditional: 164, independent unconditional: 63, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 257, independent: 227, independent conditional: 143, independent unconditional: 84, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 257, independent: 227, independent conditional: 143, independent unconditional: 84, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, independent: 22, independent conditional: 15, independent unconditional: 7, 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: 25, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 69, independent: 43, independent conditional: 43, independent unconditional: 0, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 257, independent: 205, independent conditional: 128, independent unconditional: 77, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 25, unknown conditional: 15, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 528, Positive cache size: 484, Positive conditional cache size: 67, Positive unconditional cache size: 417, Negative cache size: 44, Negative conditional cache size: 4, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 31, Maximal queried relation: 1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t633; [L849] FCALL, FORK 0 pthread_create(&t633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t633, ((void *)0), P0, ((void *)0))=-3, t633={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L850] 0 pthread_t t634; [L851] FCALL, FORK 0 pthread_create(&t634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t634, ((void *)0), P1, ((void *)0))=-2, t633={5:0}, t634={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t635; [L853] FCALL, FORK 0 pthread_create(&t635, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t635, ((void *)0), P2, ((void *)0))=-1, t633={5:0}, t634={6:0}, t635={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 [L761] 1 x = 1 [L764] 1 __unbuffered_p0_EAX = x [L767] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 y = 1 [L787] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L804] 3 z = 2 [L807] 3 __unbuffered_p2_EAX = z [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=255, x=1, y=1, z=2] [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=255, x=1, y=1, z=2] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=255, x=1, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=255, x=1, y=1, z=2] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=255, x=1, y=1, z=2] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=255, x=1, y=1, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L866] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=255, x=1, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 849]: 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: 851]: 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, 144 locations, 6 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: 14.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 351 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 351 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 980 IncrementalHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 19 mSDtfsCounter, 980 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=542occurred in iteration=7, InterpolantAutomatonStates: 43, 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.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 865 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 11:49:07,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...