./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.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_72c13044-00e3-4011-b45b-9449679c4166/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c13044-00e3-4011-b45b-9449679c4166/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_72c13044-00e3-4011-b45b-9449679c4166/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c13044-00e3-4011-b45b-9449679c4166/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c13044-00e3-4011-b45b-9449679c4166/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_72c13044-00e3-4011-b45b-9449679c4166/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 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420 --- 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 03:17:36,607 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 03:17:36,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 03:17:36,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 03:17:36,623 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 03:17:36,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 03:17:36,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 03:17:36,626 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 03:17:36,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 03:17:36,628 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 03:17:36,628 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 03:17:36,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 03:17:36,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 03:17:36,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 03:17:36,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 03:17:36,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 03:17:36,632 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 03:17:36,633 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 03:17:36,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 03:17:36,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 03:17:36,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 03:17:36,638 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 03:17:36,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 03:17:36,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 03:17:36,644 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 03:17:36,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 03:17:36,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 03:17:36,645 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 03:17:36,646 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 03:17:36,646 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 03:17:36,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 03:17:36,647 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 03:17:36,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 03:17:36,648 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 03:17:36,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 03:17:36,649 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 03:17:36,649 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 03:17:36,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 03:17:36,650 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 03:17:36,650 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 03:17:36,651 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 03:17:36,651 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c13044-00e3-4011-b45b-9449679c4166/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 03:17:36,667 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 03:17:36,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 03:17:36,667 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 03:17:36,667 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 03:17:36,668 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 03:17:36,668 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 03:17:36,668 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 03:17:36,668 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 03:17:36,668 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 03:17:36,668 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 03:17:36,668 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 03:17:36,669 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 03:17:36,669 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 03:17:36,669 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 03:17:36,669 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 03:17:36,669 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 03:17:36,669 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 03:17:36,669 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 03:17:36,670 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 03:17:36,670 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 03:17:36,670 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 03:17:36,670 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 03:17:36,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 03:17:36,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 03:17:36,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 03:17:36,671 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 03:17:36,671 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 03:17:36,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 03:17:36,671 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 03:17:36,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 03:17:36,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 03:17:36,671 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 03:17:36,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 03:17:36,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 03:17:36,672 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 03:17:36,672 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 03:17:36,672 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 03:17:36,672 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 03:17:36,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 03:17:36,672 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 03:17:36,672 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 03:17:36,672 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_72c13044-00e3-4011-b45b-9449679c4166/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_72c13044-00e3-4011-b45b-9449679c4166/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 -> 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420 [2022-12-14 03:17:36,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 03:17:36,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 03:17:36,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 03:17:36,858 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 03:17:36,858 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 03:17:36,859 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c13044-00e3-4011-b45b-9449679c4166/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i [2022-12-14 03:17:39,377 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 03:17:39,569 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 03:17:39,570 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c13044-00e3-4011-b45b-9449679c4166/sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i [2022-12-14 03:17:39,579 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c13044-00e3-4011-b45b-9449679c4166/bin/utaipan-gh47qXpMRh/data/14066252c/41d525aeb03b438a970d5be936f6491a/FLAG3f917434a [2022-12-14 03:17:39,933 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c13044-00e3-4011-b45b-9449679c4166/bin/utaipan-gh47qXpMRh/data/14066252c/41d525aeb03b438a970d5be936f6491a [2022-12-14 03:17:39,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 03:17:39,936 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 03:17:39,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 03:17:39,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 03:17:39,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 03:17:39,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:17:39" (1/1) ... [2022-12-14 03:17:39,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d331aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:17:39, skipping insertion in model container [2022-12-14 03:17:39,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:17:39" (1/1) ... [2022-12-14 03:17:39,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 03:17:39,984 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 03:17:40,110 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_72c13044-00e3-4011-b45b-9449679c4166/sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i[1001,1014] [2022-12-14 03:17:40,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 03:17:40,257 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 03:17:40,266 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_72c13044-00e3-4011-b45b-9449679c4166/sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i[1001,1014] [2022-12-14 03:17:40,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:17:40,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:17:40,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 03:17:40,327 INFO L208 MainTranslator]: Completed translation [2022-12-14 03:17:40,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:17:40 WrapperNode [2022-12-14 03:17:40,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 03:17:40,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 03:17:40,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 03:17:40,329 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 03:17:40,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:17:40" (1/1) ... [2022-12-14 03:17:40,347 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:17:40" (1/1) ... [2022-12-14 03:17:40,365 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-14 03:17:40,365 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 03:17:40,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 03:17:40,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 03:17:40,366 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 03:17:40,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:17:40" (1/1) ... [2022-12-14 03:17:40,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:17:40" (1/1) ... [2022-12-14 03:17:40,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:17:40" (1/1) ... [2022-12-14 03:17:40,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:17:40" (1/1) ... [2022-12-14 03:17:40,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:17:40" (1/1) ... [2022-12-14 03:17:40,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:17:40" (1/1) ... [2022-12-14 03:17:40,385 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:17:40" (1/1) ... [2022-12-14 03:17:40,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:17:40" (1/1) ... [2022-12-14 03:17:40,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 03:17:40,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 03:17:40,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 03:17:40,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 03:17:40,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:17:40" (1/1) ... [2022-12-14 03:17:40,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 03:17:40,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c13044-00e3-4011-b45b-9449679c4166/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:17:40,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c13044-00e3-4011-b45b-9449679c4166/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 03:17:40,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c13044-00e3-4011-b45b-9449679c4166/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 03:17:40,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 03:17:40,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 03:17:40,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 03:17:40,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 03:17:40,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 03:17:40,452 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-14 03:17:40,452 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-14 03:17:40,452 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-14 03:17:40,452 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-14 03:17:40,452 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-14 03:17:40,452 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-14 03:17:40,452 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-14 03:17:40,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-14 03:17:40,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 03:17:40,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 03:17:40,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 03:17:40,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 03:17:40,455 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 03:17:40,568 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 03:17:40,571 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 03:17:40,861 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 03:17:40,972 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 03:17:40,972 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 03:17:40,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:17:40 BoogieIcfgContainer [2022-12-14 03:17:40,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 03:17:40,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 03:17:40,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 03:17:40,981 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 03:17:40,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:17:39" (1/3) ... [2022-12-14 03:17:40,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f336da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:17:40, skipping insertion in model container [2022-12-14 03:17:40,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:17:40" (2/3) ... [2022-12-14 03:17:40,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f336da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:17:40, skipping insertion in model container [2022-12-14 03:17:40,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:17:40" (3/3) ... [2022-12-14 03:17:40,984 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_power.opt_tso.opt.i [2022-12-14 03:17:40,992 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 03:17:41,000 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 03:17:41,000 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-14 03:17:41,000 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 03:17:41,046 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-14 03:17:41,074 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 03:17:41,086 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 137 transitions, 294 flow [2022-12-14 03:17:41,089 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 137 transitions, 294 flow [2022-12-14 03:17:41,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-12-14 03:17:41,140 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-12-14 03:17:41,140 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-14 03:17:41,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-12-14 03:17:41,148 INFO L119 LiptonReduction]: Number of co-enabled transitions 3232 [2022-12-14 03:17:44,246 INFO L134 LiptonReduction]: Checked pairs total: 8600 [2022-12-14 03:17:44,246 INFO L136 LiptonReduction]: Total number of compositions: 116 [2022-12-14 03:17:44,251 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 35 transitions, 90 flow [2022-12-14 03:17:44,393 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4138 states, 4135 states have (on average 4.126723095525998) internal successors, (17064), 4137 states have internal predecessors, (17064), 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 03:17:44,409 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 03:17:44,414 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;@4901d3c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 03:17:44,414 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-14 03:17:44,425 INFO L276 IsEmpty]: Start isEmpty. Operand has 4138 states, 4135 states have (on average 4.126723095525998) internal successors, (17064), 4137 states have internal predecessors, (17064), 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 03:17:44,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 03:17:44,429 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:17:44,430 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 03:17:44,430 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 03:17:44,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:17:44,434 INFO L85 PathProgramCache]: Analyzing trace with hash 536489759, now seen corresponding path program 1 times [2022-12-14 03:17:44,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:17:44,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736641470] [2022-12-14 03:17:44,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:17:44,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:17:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:17:44,748 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 03:17:44,749 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:17:44,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736641470] [2022-12-14 03:17:44,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736641470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:17:44,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:17:44,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 03:17:44,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006475662] [2022-12-14 03:17:44,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:17:44,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 03:17:44,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:17:44,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 03:17:44,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 03:17:44,795 INFO L87 Difference]: Start difference. First operand has 4138 states, 4135 states have (on average 4.126723095525998) internal successors, (17064), 4137 states have internal predecessors, (17064), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 03:17:44,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:17:44,959 INFO L93 Difference]: Finished difference Result 3370 states and 13144 transitions. [2022-12-14 03:17:44,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 03:17:44,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-12-14 03:17:44,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:17:45,000 INFO L225 Difference]: With dead ends: 3370 [2022-12-14 03:17:45,001 INFO L226 Difference]: Without dead ends: 3250 [2022-12-14 03:17:45,002 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 03:17:45,004 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 17 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:17:45,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 8 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:17:45,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2022-12-14 03:17:45,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 3250. [2022-12-14 03:17:45,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3250 states, 3249 states have (on average 3.920590951061865) internal successors, (12738), 3249 states have internal predecessors, (12738), 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 03:17:45,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3250 states to 3250 states and 12738 transitions. [2022-12-14 03:17:45,213 INFO L78 Accepts]: Start accepts. Automaton has 3250 states and 12738 transitions. Word has length 5 [2022-12-14 03:17:45,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:17:45,213 INFO L495 AbstractCegarLoop]: Abstraction has 3250 states and 12738 transitions. [2022-12-14 03:17:45,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 03:17:45,214 INFO L276 IsEmpty]: Start isEmpty. Operand 3250 states and 12738 transitions. [2022-12-14 03:17:45,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 03:17:45,217 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:17:45,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:17:45,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 03:17:45,217 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 03:17:45,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:17:45,218 INFO L85 PathProgramCache]: Analyzing trace with hash 448505887, now seen corresponding path program 1 times [2022-12-14 03:17:45,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:17:45,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076442506] [2022-12-14 03:17:45,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:17:45,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:17:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:17:45,444 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 03:17:45,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:17:45,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076442506] [2022-12-14 03:17:45,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076442506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:17:45,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:17:45,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 03:17:45,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46018016] [2022-12-14 03:17:45,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:17:45,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 03:17:45,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:17:45,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 03:17:45,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 03:17:45,447 INFO L87 Difference]: Start difference. First operand 3250 states and 12738 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 03:17:45,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:17:45,727 INFO L93 Difference]: Finished difference Result 5994 states and 22490 transitions. [2022-12-14 03:17:45,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 03:17:45,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2022-12-14 03:17:45,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:17:45,765 INFO L225 Difference]: With dead ends: 5994 [2022-12-14 03:17:45,765 INFO L226 Difference]: Without dead ends: 4884 [2022-12-14 03:17:45,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 03:17:45,766 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 37 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 03:17:45,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 15 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 03:17:45,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4884 states. [2022-12-14 03:17:45,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4884 to 4188. [2022-12-14 03:17:45,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4188 states, 4187 states have (on average 3.8535944590398854) internal successors, (16135), 4187 states have internal predecessors, (16135), 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 03:17:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4188 states to 4188 states and 16135 transitions. [2022-12-14 03:17:45,939 INFO L78 Accepts]: Start accepts. Automaton has 4188 states and 16135 transitions. Word has length 12 [2022-12-14 03:17:45,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:17:45,940 INFO L495 AbstractCegarLoop]: Abstraction has 4188 states and 16135 transitions. [2022-12-14 03:17:45,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 03:17:45,941 INFO L276 IsEmpty]: Start isEmpty. Operand 4188 states and 16135 transitions. [2022-12-14 03:17:45,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 03:17:45,943 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:17:45,943 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:17:45,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 03:17:45,944 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 03:17:45,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:17:45,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1018773098, now seen corresponding path program 1 times [2022-12-14 03:17:45,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:17:45,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344183933] [2022-12-14 03:17:45,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:17:45,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:17:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:17:46,104 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 03:17:46,104 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:17:46,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344183933] [2022-12-14 03:17:46,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344183933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:17:46,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:17:46,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 03:17:46,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346790653] [2022-12-14 03:17:46,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:17:46,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 03:17:46,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:17:46,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 03:17:46,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 03:17:46,107 INFO L87 Difference]: Start difference. First operand 4188 states and 16135 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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 03:17:46,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:17:46,353 INFO L93 Difference]: Finished difference Result 5128 states and 18977 transitions. [2022-12-14 03:17:46,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 03:17:46,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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 03:17:46,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:17:46,388 INFO L225 Difference]: With dead ends: 5128 [2022-12-14 03:17:46,388 INFO L226 Difference]: Without dead ends: 4308 [2022-12-14 03:17:46,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 03:17:46,390 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 03:17:46,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 17 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 03:17:46,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4308 states. [2022-12-14 03:17:46,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4308 to 3408. [2022-12-14 03:17:46,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3408 states, 3407 states have (on average 3.8294687408277075) internal successors, (13047), 3407 states have internal predecessors, (13047), 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 03:17:46,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3408 states to 3408 states and 13047 transitions. [2022-12-14 03:17:46,500 INFO L78 Accepts]: Start accepts. Automaton has 3408 states and 13047 transitions. Word has length 13 [2022-12-14 03:17:46,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:17:46,500 INFO L495 AbstractCegarLoop]: Abstraction has 3408 states and 13047 transitions. [2022-12-14 03:17:46,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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 03:17:46,500 INFO L276 IsEmpty]: Start isEmpty. Operand 3408 states and 13047 transitions. [2022-12-14 03:17:46,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 03:17:46,502 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:17:46,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:17:46,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 03:17:46,502 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 03:17:46,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:17:46,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1517156703, now seen corresponding path program 1 times [2022-12-14 03:17:46,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:17:46,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260035346] [2022-12-14 03:17:46,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:17:46,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:17:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:17:46,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 03:17:46,722 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:17:46,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260035346] [2022-12-14 03:17:46,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260035346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:17:46,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:17:46,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 03:17:46,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371069636] [2022-12-14 03:17:46,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:17:46,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 03:17:46,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:17:46,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 03:17:46,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 03:17:46,724 INFO L87 Difference]: Start difference. First operand 3408 states and 13047 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 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 03:17:46,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:17:46,810 INFO L93 Difference]: Finished difference Result 2512 states and 8575 transitions. [2022-12-14 03:17:46,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 03:17:46,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 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 14 [2022-12-14 03:17:46,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:17:46,818 INFO L225 Difference]: With dead ends: 2512 [2022-12-14 03:17:46,819 INFO L226 Difference]: Without dead ends: 2512 [2022-12-14 03:17:46,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 03:17:46,820 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:17:46,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 8 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:17:46,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2512 states. [2022-12-14 03:17:46,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2512 to 2512. [2022-12-14 03:17:46,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2512 states, 2511 states have (on average 3.414974113898845) internal successors, (8575), 2511 states have internal predecessors, (8575), 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 03:17:46,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2512 states to 2512 states and 8575 transitions. [2022-12-14 03:17:46,868 INFO L78 Accepts]: Start accepts. Automaton has 2512 states and 8575 transitions. Word has length 14 [2022-12-14 03:17:46,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:17:46,868 INFO L495 AbstractCegarLoop]: Abstraction has 2512 states and 8575 transitions. [2022-12-14 03:17:46,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 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 03:17:46,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2512 states and 8575 transitions. [2022-12-14 03:17:46,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 03:17:46,871 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:17:46,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:17:46,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 03:17:46,871 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 03:17:46,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:17:46,871 INFO L85 PathProgramCache]: Analyzing trace with hash 384818412, now seen corresponding path program 1 times [2022-12-14 03:17:46,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:17:46,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689800925] [2022-12-14 03:17:46,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:17:46,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:17:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:17:47,047 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 03:17:47,047 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:17:47,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689800925] [2022-12-14 03:17:47,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689800925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:17:47,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:17:47,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 03:17:47,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031258186] [2022-12-14 03:17:47,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:17:47,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 03:17:47,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:17:47,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 03:17:47,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 03:17:47,049 INFO L87 Difference]: Start difference. First operand 2512 states and 8575 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 03:17:47,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:17:47,142 INFO L93 Difference]: Finished difference Result 1516 states and 4607 transitions. [2022-12-14 03:17:47,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 03:17:47,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2022-12-14 03:17:47,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:17:47,149 INFO L225 Difference]: With dead ends: 1516 [2022-12-14 03:17:47,150 INFO L226 Difference]: Without dead ends: 1516 [2022-12-14 03:17:47,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 03:17:47,151 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 38 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:17:47,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 12 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:17:47,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2022-12-14 03:17:47,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1504. [2022-12-14 03:17:47,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1503 states have (on average 3.035928143712575) internal successors, (4563), 1503 states have internal predecessors, (4563), 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 03:17:47,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 4563 transitions. [2022-12-14 03:17:47,203 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 4563 transitions. Word has length 17 [2022-12-14 03:17:47,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:17:47,204 INFO L495 AbstractCegarLoop]: Abstraction has 1504 states and 4563 transitions. [2022-12-14 03:17:47,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 03:17:47,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 4563 transitions. [2022-12-14 03:17:47,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 03:17:47,207 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:17:47,207 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 03:17:47,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 03:17:47,207 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 03:17:47,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:17:47,207 INFO L85 PathProgramCache]: Analyzing trace with hash -984755901, now seen corresponding path program 1 times [2022-12-14 03:17:47,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:17:47,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587522512] [2022-12-14 03:17:47,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:17:47,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:17:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:17:47,357 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 03:17:47,358 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:17:47,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587522512] [2022-12-14 03:17:47,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587522512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:17:47,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:17:47,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 03:17:47,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765178246] [2022-12-14 03:17:47,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:17:47,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 03:17:47,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:17:47,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 03:17:47,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 03:17:47,359 INFO L87 Difference]: Start difference. First operand 1504 states and 4563 transitions. Second operand has 5 states, 4 states have (on average 5.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 03:17:47,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:17:47,498 INFO L93 Difference]: Finished difference Result 2113 states and 6236 transitions. [2022-12-14 03:17:47,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 03:17:47,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.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 03:17:47,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:17:47,505 INFO L225 Difference]: With dead ends: 2113 [2022-12-14 03:17:47,505 INFO L226 Difference]: Without dead ends: 1540 [2022-12-14 03:17:47,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 03:17:47,506 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 42 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:17:47,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 29 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:17:47,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2022-12-14 03:17:47,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1474. [2022-12-14 03:17:47,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1473 states have (on average 2.9504412763068566) internal successors, (4346), 1473 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 03:17:47,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 4346 transitions. [2022-12-14 03:17:47,534 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 4346 transitions. Word has length 20 [2022-12-14 03:17:47,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:17:47,534 INFO L495 AbstractCegarLoop]: Abstraction has 1474 states and 4346 transitions. [2022-12-14 03:17:47,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.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 03:17:47,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 4346 transitions. [2022-12-14 03:17:47,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 03:17:47,536 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:17:47,536 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 03:17:47,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 03:17:47,537 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 03:17:47,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:17:47,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1216723989, now seen corresponding path program 2 times [2022-12-14 03:17:47,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:17:47,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41036745] [2022-12-14 03:17:47,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:17:47,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:17:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:17:47,680 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 03:17:47,680 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:17:47,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41036745] [2022-12-14 03:17:47,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41036745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:17:47,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:17:47,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 03:17:47,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317814392] [2022-12-14 03:17:47,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:17:47,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 03:17:47,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:17:47,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 03:17:47,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 03:17:47,681 INFO L87 Difference]: Start difference. First operand 1474 states and 4346 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 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 03:17:47,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:17:47,791 INFO L93 Difference]: Finished difference Result 1078 states and 3196 transitions. [2022-12-14 03:17:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 03:17:47,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 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 03:17:47,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:17:47,795 INFO L225 Difference]: With dead ends: 1078 [2022-12-14 03:17:47,795 INFO L226 Difference]: Without dead ends: 1066 [2022-12-14 03:17:47,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 03:17:47,796 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 40 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:17:47,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 16 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:17:47,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2022-12-14 03:17:47,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1000. [2022-12-14 03:17:47,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 999 states have (on average 2.95995995995996) internal successors, (2957), 999 states have internal predecessors, (2957), 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 03:17:47,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 2957 transitions. [2022-12-14 03:17:47,820 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 2957 transitions. Word has length 20 [2022-12-14 03:17:47,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:17:47,820 INFO L495 AbstractCegarLoop]: Abstraction has 1000 states and 2957 transitions. [2022-12-14 03:17:47,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 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 03:17:47,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 2957 transitions. [2022-12-14 03:17:47,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 03:17:47,823 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:17:47,823 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 03:17:47,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 03:17:47,823 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 03:17:47,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:17:47,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1329491021, now seen corresponding path program 1 times [2022-12-14 03:17:47,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:17:47,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356228063] [2022-12-14 03:17:47,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:17:47,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:17:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:17:48,197 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 03:17:48,197 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:17:48,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356228063] [2022-12-14 03:17:48,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356228063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:17:48,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:17:48,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 03:17:48,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381361382] [2022-12-14 03:17:48,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:17:48,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 03:17:48,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:17:48,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 03:17:48,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 03:17:48,199 INFO L87 Difference]: Start difference. First operand 1000 states and 2957 transitions. Second operand has 6 states, 5 states have (on average 4.8) 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 03:17:48,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:17:48,544 INFO L93 Difference]: Finished difference Result 2175 states and 6209 transitions. [2022-12-14 03:17:48,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 03:17:48,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) 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 03:17:48,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:17:48,550 INFO L225 Difference]: With dead ends: 2175 [2022-12-14 03:17:48,550 INFO L226 Difference]: Without dead ends: 2000 [2022-12-14 03:17:48,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-14 03:17:48,551 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 60 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 03:17:48,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 54 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 03:17:48,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2022-12-14 03:17:48,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1186. [2022-12-14 03:17:48,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 1185 states have (on average 2.946835443037975) internal successors, (3492), 1185 states have internal predecessors, (3492), 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 03:17:48,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 3492 transitions. [2022-12-14 03:17:48,593 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 3492 transitions. Word has length 24 [2022-12-14 03:17:48,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:17:48,593 INFO L495 AbstractCegarLoop]: Abstraction has 1186 states and 3492 transitions. [2022-12-14 03:17:48,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) 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 03:17:48,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 3492 transitions. [2022-12-14 03:17:48,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 03:17:48,598 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:17:48,598 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 03:17:48,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 03:17:48,598 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 03:17:48,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:17:48,599 INFO L85 PathProgramCache]: Analyzing trace with hash -695962957, now seen corresponding path program 2 times [2022-12-14 03:17:48,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:17:48,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200539857] [2022-12-14 03:17:48,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:17:48,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:17:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:17:49,128 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 03:17:49,128 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:17:49,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200539857] [2022-12-14 03:17:49,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200539857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:17:49,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:17:49,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 03:17:49,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869774569] [2022-12-14 03:17:49,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:17:49,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 03:17:49,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:17:49,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 03:17:49,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-14 03:17:49,130 INFO L87 Difference]: Start difference. First operand 1186 states and 3492 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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 03:17:49,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:17:49,436 INFO L93 Difference]: Finished difference Result 1826 states and 5107 transitions. [2022-12-14 03:17:49,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 03:17:49,437 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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 03:17:49,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:17:49,441 INFO L225 Difference]: With dead ends: 1826 [2022-12-14 03:17:49,441 INFO L226 Difference]: Without dead ends: 1574 [2022-12-14 03:17:49,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-12-14 03:17:49,441 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 91 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 03:17:49,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 57 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 03:17:49,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2022-12-14 03:17:49,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1110. [2022-12-14 03:17:49,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 1109 states have (on average 2.8872858431018935) internal successors, (3202), 1109 states have internal predecessors, (3202), 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 03:17:49,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 3202 transitions. [2022-12-14 03:17:49,461 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 3202 transitions. Word has length 24 [2022-12-14 03:17:49,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:17:49,461 INFO L495 AbstractCegarLoop]: Abstraction has 1110 states and 3202 transitions. [2022-12-14 03:17:49,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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 03:17:49,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 3202 transitions. [2022-12-14 03:17:49,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 03:17:49,463 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:17:49,463 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 03:17:49,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 03:17:49,463 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 03:17:49,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:17:49,464 INFO L85 PathProgramCache]: Analyzing trace with hash 985482931, now seen corresponding path program 3 times [2022-12-14 03:17:49,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:17:49,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799915272] [2022-12-14 03:17:49,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:17:49,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:17:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:17:49,595 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 03:17:49,595 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:17:49,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799915272] [2022-12-14 03:17:49,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799915272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:17:49,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:17:49,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 03:17:49,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821387314] [2022-12-14 03:17:49,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:17:49,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 03:17:49,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:17:49,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 03:17:49,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 03:17:49,597 INFO L87 Difference]: Start difference. First operand 1110 states and 3202 transitions. Second operand has 6 states, 6 states have (on average 4.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 03:17:49,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:17:49,709 INFO L93 Difference]: Finished difference Result 1040 states and 3065 transitions. [2022-12-14 03:17:49,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 03:17:49,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.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 03:17:49,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:17:49,711 INFO L225 Difference]: With dead ends: 1040 [2022-12-14 03:17:49,711 INFO L226 Difference]: Without dead ends: 541 [2022-12-14 03:17:49,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 03:17:49,712 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 96 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:17:49,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 14 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:17:49,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2022-12-14 03:17:49,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 451. [2022-12-14 03:17:49,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 450 states have (on average 2.7155555555555555) internal successors, (1222), 450 states have internal predecessors, (1222), 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 03:17:49,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 1222 transitions. [2022-12-14 03:17:49,720 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 1222 transitions. Word has length 24 [2022-12-14 03:17:49,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:17:49,720 INFO L495 AbstractCegarLoop]: Abstraction has 451 states and 1222 transitions. [2022-12-14 03:17:49,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.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 03:17:49,720 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 1222 transitions. [2022-12-14 03:17:49,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 03:17:49,721 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:17:49,721 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 03:17:49,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 03:17:49,721 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 03:17:49,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:17:49,722 INFO L85 PathProgramCache]: Analyzing trace with hash 121551793, now seen corresponding path program 1 times [2022-12-14 03:17:49,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:17:49,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889054148] [2022-12-14 03:17:49,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:17:49,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:17:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:17:50,190 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 03:17:50,191 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:17:50,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889054148] [2022-12-14 03:17:50,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889054148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:17:50,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:17:50,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 03:17:50,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381059634] [2022-12-14 03:17:50,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:17:50,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 03:17:50,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:17:50,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 03:17:50,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-14 03:17:50,192 INFO L87 Difference]: Start difference. First operand 451 states and 1222 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 03:17:50,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:17:50,560 INFO L93 Difference]: Finished difference Result 949 states and 2567 transitions. [2022-12-14 03:17:50,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 03:17:50,560 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 03:17:50,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:17:50,561 INFO L225 Difference]: With dead ends: 949 [2022-12-14 03:17:50,562 INFO L226 Difference]: Without dead ends: 841 [2022-12-14 03:17:50,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-12-14 03:17:50,562 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 102 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 03:17:50,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 45 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 03:17:50,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2022-12-14 03:17:50,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 475. [2022-12-14 03:17:50,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 474 states have (on average 2.7130801687763713) internal successors, (1286), 474 states have internal predecessors, (1286), 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 03:17:50,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1286 transitions. [2022-12-14 03:17:50,570 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1286 transitions. Word has length 28 [2022-12-14 03:17:50,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:17:50,570 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 1286 transitions. [2022-12-14 03:17:50,570 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 03:17:50,570 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1286 transitions. [2022-12-14 03:17:50,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 03:17:50,571 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:17:50,571 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 03:17:50,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 03:17:50,572 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 03:17:50,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:17:50,572 INFO L85 PathProgramCache]: Analyzing trace with hash 755079857, now seen corresponding path program 2 times [2022-12-14 03:17:50,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:17:50,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138995374] [2022-12-14 03:17:50,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:17:50,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:17:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:17:51,342 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 03:17:51,342 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:17:51,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138995374] [2022-12-14 03:17:51,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138995374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:17:51,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:17:51,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 03:17:51,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720477965] [2022-12-14 03:17:51,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:17:51,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 03:17:51,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:17:51,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 03:17:51,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-14 03:17:51,343 INFO L87 Difference]: Start difference. First operand 475 states and 1286 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 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 03:17:51,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:17:51,696 INFO L93 Difference]: Finished difference Result 494 states and 1321 transitions. [2022-12-14 03:17:51,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 03:17:51,697 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 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 03:17:51,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:17:51,698 INFO L225 Difference]: With dead ends: 494 [2022-12-14 03:17:51,698 INFO L226 Difference]: Without dead ends: 361 [2022-12-14 03:17:51,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-12-14 03:17:51,699 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 56 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 03:17:51,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 50 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 03:17:51,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-12-14 03:17:51,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 293. [2022-12-14 03:17:51,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 2.671232876712329) internal successors, (780), 292 states have internal predecessors, (780), 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 03:17:51,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 780 transitions. [2022-12-14 03:17:51,705 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 780 transitions. Word has length 28 [2022-12-14 03:17:51,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:17:51,705 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 780 transitions. [2022-12-14 03:17:51,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 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 03:17:51,705 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 780 transitions. [2022-12-14 03:17:51,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 03:17:51,706 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:17:51,706 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 03:17:51,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 03:17:51,706 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-14 03:17:51,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:17:51,706 INFO L85 PathProgramCache]: Analyzing trace with hash -943481935, now seen corresponding path program 3 times [2022-12-14 03:17:51,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:17:51,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065861520] [2022-12-14 03:17:51,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:17:51,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:17:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 03:17:51,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 03:17:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 03:17:51,789 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 03:17:51,790 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 03:17:51,790 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-14 03:17:51,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-14 03:17:51,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-14 03:17:51,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-14 03:17:51,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-14 03:17:51,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-14 03:17:51,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-14 03:17:51,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 03:17:51,794 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1] [2022-12-14 03:17:51,798 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-14 03:17:51,798 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 03:17:51,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 03:17:51 BasicIcfg [2022-12-14 03:17:51,845 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 03:17:51,846 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 03:17:51,846 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 03:17:51,846 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 03:17:51,846 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:17:40" (3/4) ... [2022-12-14 03:17:51,848 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 03:17:51,909 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c13044-00e3-4011-b45b-9449679c4166/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 03:17:51,909 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 03:17:51,910 INFO L158 Benchmark]: Toolchain (without parser) took 11973.90ms. Allocated memory was 123.7MB in the beginning and 398.5MB in the end (delta: 274.7MB). Free memory was 90.4MB in the beginning and 138.8MB in the end (delta: -48.5MB). Peak memory consumption was 227.9MB. Max. memory is 16.1GB. [2022-12-14 03:17:51,910 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 123.7MB. Free memory is still 65.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 03:17:51,910 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.21ms. Allocated memory is still 123.7MB. Free memory was 90.4MB in the beginning and 62.7MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-14 03:17:51,910 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.47ms. Allocated memory is still 123.7MB. Free memory was 62.7MB in the beginning and 60.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 03:17:51,911 INFO L158 Benchmark]: Boogie Preprocessor took 23.16ms. Allocated memory is still 123.7MB. Free memory was 60.1MB in the beginning and 58.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 03:17:51,911 INFO L158 Benchmark]: RCFGBuilder took 585.75ms. Allocated memory was 123.7MB in the beginning and 153.1MB in the end (delta: 29.4MB). Free memory was 58.0MB in the beginning and 100.1MB in the end (delta: -42.0MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2022-12-14 03:17:51,911 INFO L158 Benchmark]: TraceAbstraction took 10867.63ms. Allocated memory was 153.1MB in the beginning and 398.5MB in the end (delta: 245.4MB). Free memory was 100.1MB in the beginning and 154.6MB in the end (delta: -54.5MB). Peak memory consumption was 191.8MB. Max. memory is 16.1GB. [2022-12-14 03:17:51,911 INFO L158 Benchmark]: Witness Printer took 63.70ms. Allocated memory is still 398.5MB. Free memory was 154.6MB in the beginning and 138.8MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-14 03:17:51,912 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.13ms. Allocated memory is still 123.7MB. Free memory is still 65.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.21ms. Allocated memory is still 123.7MB. Free memory was 90.4MB in the beginning and 62.7MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.47ms. Allocated memory is still 123.7MB. Free memory was 62.7MB in the beginning and 60.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.16ms. Allocated memory is still 123.7MB. Free memory was 60.1MB in the beginning and 58.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 585.75ms. Allocated memory was 123.7MB in the beginning and 153.1MB in the end (delta: 29.4MB). Free memory was 58.0MB in the beginning and 100.1MB in the end (delta: -42.0MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10867.63ms. Allocated memory was 153.1MB in the beginning and 398.5MB in the end (delta: 245.4MB). Free memory was 100.1MB in the beginning and 154.6MB in the end (delta: -54.5MB). Peak memory consumption was 191.8MB. Max. memory is 16.1GB. * Witness Printer took 63.70ms. Allocated memory is still 398.5MB. Free memory was 154.6MB in the beginning and 138.8MB in the end (delta: 15.7MB). 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.2s, 148 PlacesBefore, 47 PlacesAfterwards, 137 TransitionsBefore, 35 TransitionsAfterwards, 3232 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 116 TotalNumberOfCompositions, 8600 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4119, independent: 3904, independent conditional: 0, independent unconditional: 3904, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2223, independent: 2172, independent conditional: 0, independent unconditional: 2172, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2223, independent: 2146, independent conditional: 0, independent unconditional: 2146, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 77, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 262, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4119, independent: 1732, independent conditional: 0, independent unconditional: 1732, dependent: 164, dependent conditional: 0, dependent unconditional: 164, unknown: 2223, unknown conditional: 0, unknown unconditional: 2223] , Statistics on independence cache: Total cache size (in pairs): 255, Positive cache size: 232, Positive conditional cache size: 0, Positive unconditional cache size: 232, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, 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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p3_EAX = 0; [L719] 0 int __unbuffered_p3_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff0_thd4; [L733] 0 _Bool x$r_buff1_thd0; [L734] 0 _Bool x$r_buff1_thd1; [L735] 0 _Bool x$r_buff1_thd2; [L736] 0 _Bool x$r_buff1_thd3; [L737] 0 _Bool x$r_buff1_thd4; [L738] 0 _Bool x$read_delayed; [L739] 0 int *x$read_delayed_var; [L740] 0 int x$w_buff0; [L741] 0 _Bool x$w_buff0_used; [L742] 0 int x$w_buff1; [L743] 0 _Bool x$w_buff1_used; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L862] 0 pthread_t t685; [L863] FCALL, FORK 0 pthread_create(&t685, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t685, ((void *)0), P0, ((void *)0))=-3, t685={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L864] 0 pthread_t t686; [L865] FCALL, FORK 0 pthread_create(&t686, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t686, ((void *)0), P1, ((void *)0))=-2, t685={5:0}, t686={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L781] 2 x$w_buff1 = x$w_buff0 [L782] 2 x$w_buff0 = 1 [L783] 2 x$w_buff1_used = x$w_buff0_used [L784] 2 x$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L786] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L787] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L788] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L789] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L790] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L791] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L794] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L866] 0 pthread_t t687; [L867] FCALL, FORK 0 pthread_create(&t687, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t687, ((void *)0), P2, ((void *)0))=-1, t685={5:0}, t686={6:0}, t687={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L811] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L814] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L817] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [L868] 0 pthread_t t688; [L869] FCALL, FORK 0 pthread_create(&t688, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t688, ((void *)0), P3, ((void *)0))=0, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L834] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L837] 4 __unbuffered_p3_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L753] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 x$flush_delayed = weak$$choice2 [L759] 1 x$mem_tmp = x [L760] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L761] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L762] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L763] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L764] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L766] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EAX = x [L768] 1 x = x$flush_delayed ? x$mem_tmp : x [L769] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L840] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L841] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L842] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L843] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L844] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L797] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L876] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L877] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L878] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L879] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L882] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 19]: 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: 867]: 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: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 173 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 655 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 655 mSDsluCounter, 325 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 221 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2071 IncrementalHoareTripleChecker+Invalid, 2136 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 104 mSDtfsCounter, 2071 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4188occurred in iteration=2, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 3542 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 257 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 2279 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-14 03:17:51,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c13044-00e3-4011-b45b-9449679c4166/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