./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix036.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1694551-df45-47ab-91bf-71c47bf08635/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1694551-df45-47ab-91bf-71c47bf08635/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1694551-df45-47ab-91bf-71c47bf08635/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1694551-df45-47ab-91bf-71c47bf08635/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix036.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1694551-df45-47ab-91bf-71c47bf08635/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1694551-df45-47ab-91bf-71c47bf08635/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e3d3e405a2d3cb3ab8b02ed87788ef59412b7b81517118cc37c044f334087868 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 08:52:38,889 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 08:52:38,891 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 08:52:38,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 08:52:38,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 08:52:38,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 08:52:38,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 08:52:38,908 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 08:52:38,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 08:52:38,910 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 08:52:38,910 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 08:52:38,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 08:52:38,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 08:52:38,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 08:52:38,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 08:52:38,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 08:52:38,914 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 08:52:38,915 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 08:52:38,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 08:52:38,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 08:52:38,920 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 08:52:38,921 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 08:52:38,922 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 08:52:38,923 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 08:52:38,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 08:52:38,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 08:52:38,926 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 08:52:38,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 08:52:38,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 08:52:38,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 08:52:38,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 08:52:38,928 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 08:52:38,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 08:52:38,929 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 08:52:38,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 08:52:38,930 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 08:52:38,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 08:52:38,931 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 08:52:38,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 08:52:38,932 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 08:52:38,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 08:52:38,934 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1694551-df45-47ab-91bf-71c47bf08635/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 08:52:38,951 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 08:52:38,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 08:52:38,951 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 08:52:38,951 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 08:52:38,952 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 08:52:38,952 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 08:52:38,952 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 08:52:38,953 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 08:52:38,953 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 08:52:38,953 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 08:52:38,953 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 08:52:38,953 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 08:52:38,954 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 08:52:38,954 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 08:52:38,954 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 08:52:38,954 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 08:52:38,954 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 08:52:38,955 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 08:52:38,955 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 08:52:38,955 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 08:52:38,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 08:52:38,956 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 08:52:38,956 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 08:52:38,956 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 08:52:38,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 08:52:38,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 08:52:38,956 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 08:52:38,957 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 08:52:38,957 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 08:52:38,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 08:52:38,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 08:52:38,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 08:52:38,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 08:52:38,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 08:52:38,958 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 08:52:38,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 08:52:38,958 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 08:52:38,958 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 08:52:38,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 08:52:38,959 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 08:52:38,959 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 08:52:38,959 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1694551-df45-47ab-91bf-71c47bf08635/bin/utaipan-gh47qXpMRh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1694551-df45-47ab-91bf-71c47bf08635/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e3d3e405a2d3cb3ab8b02ed87788ef59412b7b81517118cc37c044f334087868 [2022-12-14 08:52:39,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 08:52:39,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 08:52:39,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 08:52:39,149 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 08:52:39,149 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 08:52:39,151 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1694551-df45-47ab-91bf-71c47bf08635/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread-wmm/mix036.oepc.i [2022-12-14 08:52:41,754 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 08:52:41,952 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 08:52:41,952 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1694551-df45-47ab-91bf-71c47bf08635/sv-benchmarks/c/pthread-wmm/mix036.oepc.i [2022-12-14 08:52:41,962 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1694551-df45-47ab-91bf-71c47bf08635/bin/utaipan-gh47qXpMRh/data/156d1d80f/c9e9db81cc18457398408fc2cab91f3c/FLAG602cc01f3 [2022-12-14 08:52:41,973 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1694551-df45-47ab-91bf-71c47bf08635/bin/utaipan-gh47qXpMRh/data/156d1d80f/c9e9db81cc18457398408fc2cab91f3c [2022-12-14 08:52:41,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 08:52:41,976 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 08:52:41,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 08:52:41,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 08:52:41,980 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 08:52:41,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:52:41" (1/1) ... [2022-12-14 08:52:41,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25ac08e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:52:41, skipping insertion in model container [2022-12-14 08:52:41,982 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:52:41" (1/1) ... [2022-12-14 08:52:41,988 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 08:52:42,016 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 08:52:42,132 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1694551-df45-47ab-91bf-71c47bf08635/sv-benchmarks/c/pthread-wmm/mix036.oepc.i[945,958] [2022-12-14 08:52:42,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 08:52:42,297 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 08:52:42,305 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1694551-df45-47ab-91bf-71c47bf08635/sv-benchmarks/c/pthread-wmm/mix036.oepc.i[945,958] [2022-12-14 08:52:42,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 08:52:42,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 08:52:42,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 08:52:42,364 INFO L208 MainTranslator]: Completed translation [2022-12-14 08:52:42,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:52:42 WrapperNode [2022-12-14 08:52:42,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 08:52:42,366 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 08:52:42,366 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 08:52:42,366 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 08:52:42,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:52:42" (1/1) ... [2022-12-14 08:52:42,385 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:52:42" (1/1) ... [2022-12-14 08:52:42,407 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2022-12-14 08:52:42,407 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 08:52:42,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 08:52:42,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 08:52:42,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 08:52:42,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:52:42" (1/1) ... [2022-12-14 08:52:42,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:52:42" (1/1) ... [2022-12-14 08:52:42,420 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:52:42" (1/1) ... [2022-12-14 08:52:42,420 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:52:42" (1/1) ... [2022-12-14 08:52:42,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:52:42" (1/1) ... [2022-12-14 08:52:42,430 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:52:42" (1/1) ... [2022-12-14 08:52:42,432 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:52:42" (1/1) ... [2022-12-14 08:52:42,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:52:42" (1/1) ... [2022-12-14 08:52:42,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 08:52:42,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 08:52:42,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 08:52:42,438 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 08:52:42,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:52:42" (1/1) ... [2022-12-14 08:52:42,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 08:52:42,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1694551-df45-47ab-91bf-71c47bf08635/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:52:42,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1694551-df45-47ab-91bf-71c47bf08635/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 08:52:42,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1694551-df45-47ab-91bf-71c47bf08635/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 08:52:42,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 08:52:42,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 08:52:42,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 08:52:42,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 08:52:42,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 08:52:42,505 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-14 08:52:42,505 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-14 08:52:42,505 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-14 08:52:42,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-14 08:52:42,506 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-14 08:52:42,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-14 08:52:42,506 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-14 08:52:42,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-14 08:52:42,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 08:52:42,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 08:52:42,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 08:52:42,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 08:52:42,508 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 08:52:42,628 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 08:52:42,630 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 08:52:42,899 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 08:52:43,003 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 08:52:43,004 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 08:52:43,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:52:43 BoogieIcfgContainer [2022-12-14 08:52:43,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 08:52:43,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 08:52:43,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 08:52:43,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 08:52:43,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 08:52:41" (1/3) ... [2022-12-14 08:52:43,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce3d704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 08:52:43, skipping insertion in model container [2022-12-14 08:52:43,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:52:42" (2/3) ... [2022-12-14 08:52:43,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce3d704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 08:52:43, skipping insertion in model container [2022-12-14 08:52:43,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:52:43" (3/3) ... [2022-12-14 08:52:43,012 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036.oepc.i [2022-12-14 08:52:43,018 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 08:52:43,026 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 08:52:43,026 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-14 08:52:43,026 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 08:52:43,070 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-14 08:52:43,094 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 08:52:43,105 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 141 transitions, 302 flow [2022-12-14 08:52:43,107 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 141 transitions, 302 flow [2022-12-14 08:52:43,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 302 flow [2022-12-14 08:52:43,148 INFO L130 PetriNetUnfolder]: 2/137 cut-off events. [2022-12-14 08:52:43,149 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-14 08:52:43,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 2/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-12-14 08:52:43,155 INFO L119 LiptonReduction]: Number of co-enabled transitions 3518 [2022-12-14 08:52:46,822 INFO L134 LiptonReduction]: Checked pairs total: 9890 [2022-12-14 08:52:46,822 INFO L136 LiptonReduction]: Total number of compositions: 121 [2022-12-14 08:52:46,828 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 35 transitions, 90 flow [2022-12-14 08:52:46,966 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4274 states, 4271 states have (on average 4.015921329899321) internal successors, (17152), 4273 states have internal predecessors, (17152), 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-14 08:52:46,979 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 08:52:46,984 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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;@1741f750, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 08:52:46,984 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-14 08:52:46,995 INFO L276 IsEmpty]: Start isEmpty. Operand has 4274 states, 4271 states have (on average 4.015921329899321) internal successors, (17152), 4273 states have internal predecessors, (17152), 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-14 08:52:46,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 08:52:46,999 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:52:46,999 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 08:52:46,999 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 08:52:47,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:52:47,003 INFO L85 PathProgramCache]: Analyzing trace with hash 581917, now seen corresponding path program 1 times [2022-12-14 08:52:47,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:52:47,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568055739] [2022-12-14 08:52:47,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:52:47,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:52:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:52:47,261 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-14 08:52:47,262 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:52:47,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568055739] [2022-12-14 08:52:47,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568055739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:52:47,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:52:47,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 08:52:47,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124907225] [2022-12-14 08:52:47,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:52:47,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:52:47,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:52:47,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:52:47,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:52:47,296 INFO L87 Difference]: Start difference. First operand has 4274 states, 4271 states have (on average 4.015921329899321) internal successors, (17152), 4273 states have internal predecessors, (17152), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-14 08:52:47,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:52:47,450 INFO L93 Difference]: Finished difference Result 3462 states and 13465 transitions. [2022-12-14 08:52:47,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:52:47,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Word has length 3 [2022-12-14 08:52:47,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:52:47,493 INFO L225 Difference]: With dead ends: 3462 [2022-12-14 08:52:47,493 INFO L226 Difference]: Without dead ends: 3312 [2022-12-14 08:52:47,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:52:47,497 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:52:47,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 6 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:52:47,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states. [2022-12-14 08:52:47,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3312. [2022-12-14 08:52:47,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3312 states, 3311 states have (on average 3.9112050739957716) internal successors, (12950), 3311 states have internal predecessors, (12950), 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-14 08:52:47,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 12950 transitions. [2022-12-14 08:52:47,694 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 12950 transitions. Word has length 3 [2022-12-14 08:52:47,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:52:47,694 INFO L495 AbstractCegarLoop]: Abstraction has 3312 states and 12950 transitions. [2022-12-14 08:52:47,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-14 08:52:47,694 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 12950 transitions. [2022-12-14 08:52:47,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 08:52:47,696 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:52:47,696 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:52:47,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 08:52:47,696 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 08:52:47,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:52:47,697 INFO L85 PathProgramCache]: Analyzing trace with hash 398036346, now seen corresponding path program 1 times [2022-12-14 08:52:47,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:52:47,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624512663] [2022-12-14 08:52:47,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:52:47,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:52:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:52:47,860 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-14 08:52:47,860 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:52:47,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624512663] [2022-12-14 08:52:47,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624512663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:52:47,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:52:47,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 08:52:47,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501981830] [2022-12-14 08:52:47,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:52:47,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:52:47,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:52:47,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:52:47,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:52:47,863 INFO L87 Difference]: Start difference. First operand 3312 states and 12950 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:52:47,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:52:47,971 INFO L93 Difference]: Finished difference Result 3062 states and 11850 transitions. [2022-12-14 08:52:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:52:47,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 08:52:47,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:52:47,996 INFO L225 Difference]: With dead ends: 3062 [2022-12-14 08:52:47,997 INFO L226 Difference]: Without dead ends: 3062 [2022-12-14 08:52:47,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:52:47,998 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:52:47,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 6 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:52:48,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2022-12-14 08:52:48,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 3062. [2022-12-14 08:52:48,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3062 states, 3061 states have (on average 3.8712838941522376) internal successors, (11850), 3061 states have internal predecessors, (11850), 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-14 08:52:48,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 11850 transitions. [2022-12-14 08:52:48,110 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 11850 transitions. Word has length 11 [2022-12-14 08:52:48,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:52:48,111 INFO L495 AbstractCegarLoop]: Abstraction has 3062 states and 11850 transitions. [2022-12-14 08:52:48,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:52:48,111 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 11850 transitions. [2022-12-14 08:52:48,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 08:52:48,114 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:52:48,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:52:48,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 08:52:48,114 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 08:52:48,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:52:48,115 INFO L85 PathProgramCache]: Analyzing trace with hash 258147483, now seen corresponding path program 1 times [2022-12-14 08:52:48,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:52:48,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89432697] [2022-12-14 08:52:48,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:52:48,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:52:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:52:48,263 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-14 08:52:48,263 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:52:48,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89432697] [2022-12-14 08:52:48,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89432697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:52:48,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:52:48,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:52:48,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092030929] [2022-12-14 08:52:48,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:52:48,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:52:48,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:52:48,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:52:48,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:52:48,265 INFO L87 Difference]: Start difference. First operand 3062 states and 11850 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:52:48,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:52:48,413 INFO L93 Difference]: Finished difference Result 2980 states and 10435 transitions. [2022-12-14 08:52:48,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:52:48,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 08:52:48,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:52:48,423 INFO L225 Difference]: With dead ends: 2980 [2022-12-14 08:52:48,423 INFO L226 Difference]: Without dead ends: 2230 [2022-12-14 08:52:48,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:52:48,424 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 44 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:52:48,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 15 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:52:48,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2022-12-14 08:52:48,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 2230. [2022-12-14 08:52:48,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2230 states, 2229 states have (on average 3.44997756841633) internal successors, (7690), 2229 states have internal predecessors, (7690), 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-14 08:52:48,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 7690 transitions. [2022-12-14 08:52:48,529 INFO L78 Accepts]: Start accepts. Automaton has 2230 states and 7690 transitions. Word has length 13 [2022-12-14 08:52:48,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:52:48,529 INFO L495 AbstractCegarLoop]: Abstraction has 2230 states and 7690 transitions. [2022-12-14 08:52:48,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:52:48,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 7690 transitions. [2022-12-14 08:52:48,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 08:52:48,532 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:52:48,532 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:52:48,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 08:52:48,532 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 08:52:48,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:52:48,533 INFO L85 PathProgramCache]: Analyzing trace with hash 569374663, now seen corresponding path program 1 times [2022-12-14 08:52:48,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:52:48,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449566149] [2022-12-14 08:52:48,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:52:48,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:52:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:52:48,757 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-14 08:52:48,757 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:52:48,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449566149] [2022-12-14 08:52:48,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449566149] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:52:48,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:52:48,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:52:48,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40564951] [2022-12-14 08:52:48,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:52:48,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 08:52:48,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:52:48,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 08:52:48,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:52:48,759 INFO L87 Difference]: Start difference. First operand 2230 states and 7690 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-14 08:52:48,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:52:48,931 INFO L93 Difference]: Finished difference Result 1844 states and 5875 transitions. [2022-12-14 08:52:48,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 08:52:48,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) Word has length 16 [2022-12-14 08:52:48,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:52:48,939 INFO L225 Difference]: With dead ends: 1844 [2022-12-14 08:52:48,939 INFO L226 Difference]: Without dead ends: 1414 [2022-12-14 08:52:48,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 08:52:48,940 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 63 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:52:48,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 21 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 08:52:48,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2022-12-14 08:52:48,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1414. [2022-12-14 08:52:48,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1414 states, 1413 states have (on average 3.132342533616419) internal successors, (4426), 1413 states have internal predecessors, (4426), 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-14 08:52:48,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 4426 transitions. [2022-12-14 08:52:48,965 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 4426 transitions. Word has length 16 [2022-12-14 08:52:48,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:52:48,965 INFO L495 AbstractCegarLoop]: Abstraction has 1414 states and 4426 transitions. [2022-12-14 08:52:48,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-14 08:52:48,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 4426 transitions. [2022-12-14 08:52:48,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 08:52:48,967 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:52:48,967 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:52:48,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 08:52:48,968 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 08:52:48,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:52:48,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1688092815, now seen corresponding path program 1 times [2022-12-14 08:52:48,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:52:48,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723923484] [2022-12-14 08:52:48,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:52:48,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:52:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:52:49,439 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-14 08:52:49,440 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:52:49,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723923484] [2022-12-14 08:52:49,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723923484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:52:49,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:52:49,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:52:49,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486944499] [2022-12-14 08:52:49,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:52:49,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 08:52:49,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:52:49,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 08:52:49,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 08:52:49,441 INFO L87 Difference]: Start difference. First operand 1414 states and 4426 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:52:49,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:52:49,701 INFO L93 Difference]: Finished difference Result 2560 states and 7752 transitions. [2022-12-14 08:52:49,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 08:52:49,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 08:52:49,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:52:49,708 INFO L225 Difference]: With dead ends: 2560 [2022-12-14 08:52:49,708 INFO L226 Difference]: Without dead ends: 2375 [2022-12-14 08:52:49,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-14 08:52:49,709 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 105 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:52:49,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 21 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 08:52:49,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2375 states. [2022-12-14 08:52:49,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2375 to 1950. [2022-12-14 08:52:49,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1950 states, 1949 states have (on average 3.100051308363263) internal successors, (6042), 1949 states have internal predecessors, (6042), 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-14 08:52:49,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 6042 transitions. [2022-12-14 08:52:49,771 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 6042 transitions. Word has length 20 [2022-12-14 08:52:49,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:52:49,771 INFO L495 AbstractCegarLoop]: Abstraction has 1950 states and 6042 transitions. [2022-12-14 08:52:49,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:52:49,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 6042 transitions. [2022-12-14 08:52:49,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 08:52:49,774 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:52:49,774 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:52:49,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 08:52:49,774 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 08:52:49,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:52:49,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1552248035, now seen corresponding path program 2 times [2022-12-14 08:52:49,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:52:49,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896275821] [2022-12-14 08:52:49,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:52:49,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:52:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:52:49,954 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-14 08:52:49,954 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:52:49,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896275821] [2022-12-14 08:52:49,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896275821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:52:49,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:52:49,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 08:52:49,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334114209] [2022-12-14 08:52:49,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:52:49,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 08:52:49,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:52:49,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 08:52:49,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 08:52:49,956 INFO L87 Difference]: Start difference. First operand 1950 states and 6042 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:52:50,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:52:50,150 INFO L93 Difference]: Finished difference Result 1747 states and 5361 transitions. [2022-12-14 08:52:50,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 08:52:50,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 08:52:50,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:52:50,159 INFO L225 Difference]: With dead ends: 1747 [2022-12-14 08:52:50,159 INFO L226 Difference]: Without dead ends: 1557 [2022-12-14 08:52:50,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:52:50,160 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 83 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:52:50,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 24 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 08:52:50,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2022-12-14 08:52:50,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1533. [2022-12-14 08:52:50,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1532 states have (on average 3.1148825065274153) internal successors, (4772), 1532 states have internal predecessors, (4772), 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-14 08:52:50,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 4772 transitions. [2022-12-14 08:52:50,186 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 4772 transitions. Word has length 20 [2022-12-14 08:52:50,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:52:50,187 INFO L495 AbstractCegarLoop]: Abstraction has 1533 states and 4772 transitions. [2022-12-14 08:52:50,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:52:50,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 4772 transitions. [2022-12-14 08:52:50,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 08:52:50,189 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:52:50,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:52:50,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 08:52:50,190 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 08:52:50,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:52:50,190 INFO L85 PathProgramCache]: Analyzing trace with hash -320086589, now seen corresponding path program 1 times [2022-12-14 08:52:50,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:52:50,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126197334] [2022-12-14 08:52:50,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:52:50,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:52:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:52:50,722 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-14 08:52:50,722 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:52:50,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126197334] [2022-12-14 08:52:50,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126197334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:52:50,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:52:50,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 08:52:50,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882901318] [2022-12-14 08:52:50,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:52:50,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 08:52:50,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:52:50,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 08:52:50,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:52:50,724 INFO L87 Difference]: Start difference. First operand 1533 states and 4772 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:52:51,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:52:51,069 INFO L93 Difference]: Finished difference Result 2057 states and 6262 transitions. [2022-12-14 08:52:51,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 08:52:51,070 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 08:52:51,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:52:51,077 INFO L225 Difference]: With dead ends: 2057 [2022-12-14 08:52:51,078 INFO L226 Difference]: Without dead ends: 1998 [2022-12-14 08:52:51,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-12-14 08:52:51,079 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 114 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 08:52:51,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 26 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 08:52:51,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2022-12-14 08:52:51,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1397. [2022-12-14 08:52:51,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1397 states, 1396 states have (on average 3.1131805157593124) internal successors, (4346), 1396 states have internal predecessors, (4346), 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-14 08:52:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 4346 transitions. [2022-12-14 08:52:51,113 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 4346 transitions. Word has length 24 [2022-12-14 08:52:51,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:52:51,113 INFO L495 AbstractCegarLoop]: Abstraction has 1397 states and 4346 transitions. [2022-12-14 08:52:51,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:52:51,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 4346 transitions. [2022-12-14 08:52:51,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 08:52:51,116 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:52:51,116 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:52:51,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 08:52:51,116 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 08:52:51,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:52:51,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1509139099, now seen corresponding path program 2 times [2022-12-14 08:52:51,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:52:51,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105261083] [2022-12-14 08:52:51,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:52:51,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:52:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:52:51,395 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-14 08:52:51,395 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:52:51,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105261083] [2022-12-14 08:52:51,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105261083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:52:51,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:52:51,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:52:51,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213238941] [2022-12-14 08:52:51,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:52:51,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 08:52:51,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:52:51,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 08:52:51,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:52:51,396 INFO L87 Difference]: Start difference. First operand 1397 states and 4346 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:52:51,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:52:51,594 INFO L93 Difference]: Finished difference Result 2164 states and 6549 transitions. [2022-12-14 08:52:51,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 08:52:51,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 08:52:51,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:52:51,598 INFO L225 Difference]: With dead ends: 2164 [2022-12-14 08:52:51,599 INFO L226 Difference]: Without dead ends: 1886 [2022-12-14 08:52:51,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 08:52:51,599 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 36 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:52:51,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 30 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 08:52:51,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2022-12-14 08:52:51,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1441. [2022-12-14 08:52:51,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1441 states, 1440 states have (on average 3.098611111111111) internal successors, (4462), 1440 states have internal predecessors, (4462), 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-14 08:52:51,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 4462 transitions. [2022-12-14 08:52:51,624 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 4462 transitions. Word has length 24 [2022-12-14 08:52:51,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:52:51,625 INFO L495 AbstractCegarLoop]: Abstraction has 1441 states and 4462 transitions. [2022-12-14 08:52:51,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:52:51,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 4462 transitions. [2022-12-14 08:52:51,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 08:52:51,629 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:52:51,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:52:51,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 08:52:51,629 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 08:52:51,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:52:51,630 INFO L85 PathProgramCache]: Analyzing trace with hash -199271827, now seen corresponding path program 1 times [2022-12-14 08:52:51,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:52:51,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071025636] [2022-12-14 08:52:51,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:52:51,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:52:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:52:52,116 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-14 08:52:52,116 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:52:52,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071025636] [2022-12-14 08:52:52,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071025636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:52:52,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:52:52,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 08:52:52,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570891450] [2022-12-14 08:52:52,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:52:52,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 08:52:52,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:52:52,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 08:52:52,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:52:52,118 INFO L87 Difference]: Start difference. First operand 1441 states and 4462 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:52:52,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:52:52,338 INFO L93 Difference]: Finished difference Result 2184 states and 6516 transitions. [2022-12-14 08:52:52,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 08:52:52,338 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 08:52:52,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:52:52,345 INFO L225 Difference]: With dead ends: 2184 [2022-12-14 08:52:52,345 INFO L226 Difference]: Without dead ends: 2064 [2022-12-14 08:52:52,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-14 08:52:52,346 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 57 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:52:52,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 33 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 08:52:52,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2022-12-14 08:52:52,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 1567. [2022-12-14 08:52:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1566 states have (on average 3.0721583652618136) internal successors, (4811), 1566 states have internal predecessors, (4811), 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-14 08:52:52,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 4811 transitions. [2022-12-14 08:52:52,380 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 4811 transitions. Word has length 24 [2022-12-14 08:52:52,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:52:52,380 INFO L495 AbstractCegarLoop]: Abstraction has 1567 states and 4811 transitions. [2022-12-14 08:52:52,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:52:52,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 4811 transitions. [2022-12-14 08:52:52,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 08:52:52,383 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:52:52,383 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:52:52,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 08:52:52,383 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 08:52:52,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:52:52,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1786924723, now seen corresponding path program 3 times [2022-12-14 08:52:52,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:52:52,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133192155] [2022-12-14 08:52:52,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:52:52,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:52:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:52:52,564 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-14 08:52:52,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:52:52,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133192155] [2022-12-14 08:52:52,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133192155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:52:52,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:52:52,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 08:52:52,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132707268] [2022-12-14 08:52:52,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:52:52,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 08:52:52,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:52:52,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 08:52:52,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:52:52,565 INFO L87 Difference]: Start difference. First operand 1567 states and 4811 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:52:52,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:52:52,729 INFO L93 Difference]: Finished difference Result 1531 states and 4734 transitions. [2022-12-14 08:52:52,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 08:52:52,729 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 08:52:52,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:52:52,732 INFO L225 Difference]: With dead ends: 1531 [2022-12-14 08:52:52,732 INFO L226 Difference]: Without dead ends: 1191 [2022-12-14 08:52:52,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-14 08:52:52,733 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 96 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:52:52,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 21 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:52:52,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2022-12-14 08:52:52,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1127. [2022-12-14 08:52:52,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 1126 states have (on average 3.104795737122558) internal successors, (3496), 1126 states have internal predecessors, (3496), 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-14 08:52:52,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 3496 transitions. [2022-12-14 08:52:52,748 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 3496 transitions. Word has length 24 [2022-12-14 08:52:52,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:52:52,748 INFO L495 AbstractCegarLoop]: Abstraction has 1127 states and 3496 transitions. [2022-12-14 08:52:52,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:52:52,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 3496 transitions. [2022-12-14 08:52:52,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 08:52:52,750 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:52:52,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:52:52,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 08:52:52,751 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 08:52:52,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:52:52,751 INFO L85 PathProgramCache]: Analyzing trace with hash -533164917, now seen corresponding path program 1 times [2022-12-14 08:52:52,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:52:52,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902130193] [2022-12-14 08:52:52,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:52:52,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:52:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:52:52,930 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-14 08:52:52,930 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:52:52,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902130193] [2022-12-14 08:52:52,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902130193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:52:52,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:52:52,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:52:52,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142719177] [2022-12-14 08:52:52,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:52:52,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:52:52,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:52:52,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:52:52,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:52:52,932 INFO L87 Difference]: Start difference. First operand 1127 states and 3496 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-14 08:52:53,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:52:53,038 INFO L93 Difference]: Finished difference Result 1689 states and 5178 transitions. [2022-12-14 08:52:53,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:52:53,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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) Word has length 28 [2022-12-14 08:52:53,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:52:53,040 INFO L225 Difference]: With dead ends: 1689 [2022-12-14 08:52:53,040 INFO L226 Difference]: Without dead ends: 807 [2022-12-14 08:52:53,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:52:53,041 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:52:53,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 10 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:52:53,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2022-12-14 08:52:53,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 807. [2022-12-14 08:52:53,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 806 states have (on average 2.9528535980148884) internal successors, (2380), 806 states have internal predecessors, (2380), 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-14 08:52:53,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 2380 transitions. [2022-12-14 08:52:53,051 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 2380 transitions. Word has length 28 [2022-12-14 08:52:53,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:52:53,051 INFO L495 AbstractCegarLoop]: Abstraction has 807 states and 2380 transitions. [2022-12-14 08:52:53,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-14 08:52:53,052 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 2380 transitions. [2022-12-14 08:52:53,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 08:52:53,053 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:52:53,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:52:53,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 08:52:53,054 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 08:52:53,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:52:53,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1131395471, now seen corresponding path program 2 times [2022-12-14 08:52:53,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:52:53,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234850714] [2022-12-14 08:52:53,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:52:53,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:52:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:52:53,811 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-14 08:52:53,811 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:52:53,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234850714] [2022-12-14 08:52:53,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234850714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:52:53,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:52:53,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 08:52:53,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332573052] [2022-12-14 08:52:53,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:52:53,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 08:52:53,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:52:53,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 08:52:53,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 08:52:53,813 INFO L87 Difference]: Start difference. First operand 807 states and 2380 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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-14 08:52:54,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:52:54,114 INFO L93 Difference]: Finished difference Result 1170 states and 3365 transitions. [2022-12-14 08:52:54,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 08:52:54,115 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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) Word has length 28 [2022-12-14 08:52:54,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:52:54,117 INFO L225 Difference]: With dead ends: 1170 [2022-12-14 08:52:54,117 INFO L226 Difference]: Without dead ends: 1072 [2022-12-14 08:52:54,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-14 08:52:54,118 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 88 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:52:54,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 22 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 08:52:54,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2022-12-14 08:52:54,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 787. [2022-12-14 08:52:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 2.9389312977099236) internal successors, (2310), 786 states have internal predecessors, (2310), 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-14 08:52:54,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 2310 transitions. [2022-12-14 08:52:54,129 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 2310 transitions. Word has length 28 [2022-12-14 08:52:54,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:52:54,129 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 2310 transitions. [2022-12-14 08:52:54,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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-14 08:52:54,129 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 2310 transitions. [2022-12-14 08:52:54,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 08:52:54,130 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:52:54,131 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:52:54,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 08:52:54,131 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 08:52:54,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:52:54,131 INFO L85 PathProgramCache]: Analyzing trace with hash 890157835, now seen corresponding path program 3 times [2022-12-14 08:52:54,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:52:54,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255548659] [2022-12-14 08:52:54,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:52:54,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:52:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:52:54,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:52:54,522 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:52:54,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255548659] [2022-12-14 08:52:54,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255548659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:52:54,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:52:54,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 08:52:54,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197898162] [2022-12-14 08:52:54,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:52:54,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 08:52:54,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:52:54,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 08:52:54,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-14 08:52:54,523 INFO L87 Difference]: Start difference. First operand 787 states and 2310 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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-14 08:52:54,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:52:54,791 INFO L93 Difference]: Finished difference Result 987 states and 2796 transitions. [2022-12-14 08:52:54,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 08:52:54,792 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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) Word has length 28 [2022-12-14 08:52:54,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:52:54,794 INFO L225 Difference]: With dead ends: 987 [2022-12-14 08:52:54,795 INFO L226 Difference]: Without dead ends: 860 [2022-12-14 08:52:54,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-12-14 08:52:54,795 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 58 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:52:54,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 30 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 08:52:54,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-12-14 08:52:54,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 727. [2022-12-14 08:52:54,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 726 states have (on average 2.922865013774105) internal successors, (2122), 726 states have internal predecessors, (2122), 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-14 08:52:54,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 2122 transitions. [2022-12-14 08:52:54,806 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 2122 transitions. Word has length 28 [2022-12-14 08:52:54,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:52:54,806 INFO L495 AbstractCegarLoop]: Abstraction has 727 states and 2122 transitions. [2022-12-14 08:52:54,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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-14 08:52:54,806 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 2122 transitions. [2022-12-14 08:52:54,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 08:52:54,807 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:52:54,807 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:52:54,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 08:52:54,807 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 08:52:54,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:52:54,808 INFO L85 PathProgramCache]: Analyzing trace with hash 83610167, now seen corresponding path program 4 times [2022-12-14 08:52:54,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:52:54,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183298726] [2022-12-14 08:52:54,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:52:54,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:52:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 08:52:54,845 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 08:52:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 08:52:54,927 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 08:52:54,927 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 08:52:54,928 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-14 08:52:54,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-14 08:52:54,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-14 08:52:54,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-14 08:52:54,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-14 08:52:54,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-14 08:52:54,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-14 08:52:54,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 08:52:54,931 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1] [2022-12-14 08:52:54,935 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-14 08:52:54,935 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 08:52:54,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 08:52:54 BasicIcfg [2022-12-14 08:52:54,983 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 08:52:54,984 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 08:52:54,984 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 08:52:54,984 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 08:52:54,984 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:52:43" (3/4) ... [2022-12-14 08:52:54,985 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 08:52:55,045 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1694551-df45-47ab-91bf-71c47bf08635/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 08:52:55,045 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 08:52:55,046 INFO L158 Benchmark]: Toolchain (without parser) took 13070.34ms. Allocated memory was 140.5MB in the beginning and 375.4MB in the end (delta: 234.9MB). Free memory was 104.7MB in the beginning and 248.8MB in the end (delta: -144.1MB). Peak memory consumption was 91.3MB. Max. memory is 16.1GB. [2022-12-14 08:52:55,046 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory was 83.5MB in the beginning and 83.5MB in the end (delta: 28.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 08:52:55,046 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.59ms. Allocated memory is still 140.5MB. Free memory was 104.7MB in the beginning and 76.0MB in the end (delta: 28.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-14 08:52:55,046 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.49ms. Allocated memory is still 140.5MB. Free memory was 76.0MB in the beginning and 73.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 08:52:55,047 INFO L158 Benchmark]: Boogie Preprocessor took 29.79ms. Allocated memory is still 140.5MB. Free memory was 73.8MB in the beginning and 71.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 08:52:55,047 INFO L158 Benchmark]: RCFGBuilder took 567.66ms. Allocated memory is still 140.5MB. Free memory was 71.7MB in the beginning and 83.4MB in the end (delta: -11.8MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2022-12-14 08:52:55,047 INFO L158 Benchmark]: TraceAbstraction took 11976.28ms. Allocated memory was 140.5MB in the beginning and 375.4MB in the end (delta: 234.9MB). Free memory was 82.7MB in the beginning and 265.6MB in the end (delta: -182.9MB). Peak memory consumption was 242.6MB. Max. memory is 16.1GB. [2022-12-14 08:52:55,047 INFO L158 Benchmark]: Witness Printer took 61.84ms. Allocated memory is still 375.4MB. Free memory was 265.6MB in the beginning and 248.8MB in the end (delta: 16.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-14 08:52:55,048 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.15ms. Allocated memory is still 109.1MB. Free memory was 83.5MB in the beginning and 83.5MB in the end (delta: 28.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.59ms. Allocated memory is still 140.5MB. Free memory was 104.7MB in the beginning and 76.0MB in the end (delta: 28.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.49ms. Allocated memory is still 140.5MB. Free memory was 76.0MB in the beginning and 73.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.79ms. Allocated memory is still 140.5MB. Free memory was 73.8MB in the beginning and 71.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 567.66ms. Allocated memory is still 140.5MB. Free memory was 71.7MB in the beginning and 83.4MB in the end (delta: -11.8MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11976.28ms. Allocated memory was 140.5MB in the beginning and 375.4MB in the end (delta: 234.9MB). Free memory was 82.7MB in the beginning and 265.6MB in the end (delta: -182.9MB). Peak memory consumption was 242.6MB. Max. memory is 16.1GB. * Witness Printer took 61.84ms. Allocated memory is still 375.4MB. Free memory was 265.6MB in the beginning and 248.8MB in the end (delta: 16.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 152 PlacesBefore, 47 PlacesAfterwards, 141 TransitionsBefore, 35 TransitionsAfterwards, 3518 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 121 TotalNumberOfCompositions, 9890 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5168, independent: 4921, independent conditional: 0, independent unconditional: 4921, dependent: 247, dependent conditional: 0, dependent unconditional: 247, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2762, independent: 2672, independent conditional: 0, independent unconditional: 2672, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2762, independent: 2641, independent conditional: 0, independent unconditional: 2641, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 121, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 403, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 368, dependent conditional: 0, dependent unconditional: 368, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5168, independent: 2249, independent conditional: 0, independent unconditional: 2249, dependent: 157, dependent conditional: 0, dependent unconditional: 157, unknown: 2762, unknown conditional: 0, unknown unconditional: 2762] , Statistics on independence cache: Total cache size (in pairs): 322, Positive cache size: 287, Positive conditional cache size: 0, Positive unconditional cache size: 287, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool b$flush_delayed; [L726] 0 int b$mem_tmp; [L727] 0 _Bool b$r_buff0_thd0; [L728] 0 _Bool b$r_buff0_thd1; [L729] 0 _Bool b$r_buff0_thd2; [L730] 0 _Bool b$r_buff0_thd3; [L731] 0 _Bool b$r_buff0_thd4; [L732] 0 _Bool b$r_buff1_thd0; [L733] 0 _Bool b$r_buff1_thd1; [L734] 0 _Bool b$r_buff1_thd2; [L735] 0 _Bool b$r_buff1_thd3; [L736] 0 _Bool b$r_buff1_thd4; [L737] 0 _Bool b$read_delayed; [L738] 0 int *b$read_delayed_var; [L739] 0 int b$w_buff0; [L740] 0 _Bool b$w_buff0_used; [L741] 0 int b$w_buff1; [L742] 0 _Bool b$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t937; [L874] FCALL, FORK 0 pthread_create(&t937, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t937, ((void *)0), P0, ((void *)0))=-3, t937={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 b$w_buff1 = b$w_buff0 [L757] 1 b$w_buff0 = 1 [L758] 1 b$w_buff1_used = b$w_buff0_used [L759] 1 b$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L761] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L762] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L763] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L764] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L765] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L766] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t938; [L876] FCALL, FORK 0 pthread_create(&t938, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t938, ((void *)0), P1, ((void *)0))=-2, t937={5:0}, t938={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t939; [L878] FCALL, FORK 0 pthread_create(&t939, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t939, ((void *)0), P2, ((void *)0))=-1, t937={5:0}, t938={6:0}, t939={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L806] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L812] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L813] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L814] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L815] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L816] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L879] 0 pthread_t t940; [L880] FCALL, FORK 0 pthread_create(&t940, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t940, ((void *)0), P3, ((void *)0))=0, t937={5:0}, t938={6:0}, t939={7:0}, t940={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L826] 4 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L829] 4 a = 1 [L832] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 b$flush_delayed = weak$$choice2 [L838] 4 b$mem_tmp = b [L839] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L840] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L841] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L842] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L843] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L845] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = b [L847] 4 b = b$flush_delayed ? b$mem_tmp : b [L848] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L772] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L773] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L774] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L775] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L776] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L851] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L852] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L853] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L854] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L855] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L884] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L884] RET 0 assume_abort_if_not(main$tmp_guard0) [L886] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L887] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L888] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L889] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L890] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t937={5:0}, t938={6:0}, t939={7:0}, t940={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L895] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 880]: 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: 874]: 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: 876]: 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: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 179 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 11.8s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 802 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 802 mSDsluCounter, 265 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 178 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2399 IncrementalHoareTripleChecker+Invalid, 2470 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 87 mSDtfsCounter, 2399 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4274occurred in iteration=0, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 2474 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 2730 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-14 08:52:55,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1694551-df45-47ab-91bf-71c47bf08635/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE