./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe015_rmo.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49d4ee6b-32f0-44c8-8646-eedcd917db17/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49d4ee6b-32f0-44c8-8646-eedcd917db17/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_49d4ee6b-32f0-44c8-8646-eedcd917db17/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49d4ee6b-32f0-44c8-8646-eedcd917db17/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe015_rmo.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49d4ee6b-32f0-44c8-8646-eedcd917db17/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_49d4ee6b-32f0-44c8-8646-eedcd917db17/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 fa1630ab5b9ca06d45588653daa6fff0d3a2fbd0851a9f5c3999782c5c51eba5 --- 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 13:12:49,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 13:12:49,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 13:12:49,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 13:12:49,374 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 13:12:49,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 13:12:49,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 13:12:49,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 13:12:49,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 13:12:49,377 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 13:12:49,378 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 13:12:49,379 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 13:12:49,379 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 13:12:49,380 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 13:12:49,380 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 13:12:49,381 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 13:12:49,382 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 13:12:49,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 13:12:49,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 13:12:49,384 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 13:12:49,385 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 13:12:49,386 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 13:12:49,387 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 13:12:49,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 13:12:49,390 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 13:12:49,390 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 13:12:49,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 13:12:49,391 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 13:12:49,391 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 13:12:49,392 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 13:12:49,392 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 13:12:49,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 13:12:49,393 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 13:12:49,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 13:12:49,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 13:12:49,394 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 13:12:49,394 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 13:12:49,395 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 13:12:49,395 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 13:12:49,395 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 13:12:49,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 13:12:49,396 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49d4ee6b-32f0-44c8-8646-eedcd917db17/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 13:12:49,410 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 13:12:49,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 13:12:49,411 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 13:12:49,411 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 13:12:49,411 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 13:12:49,411 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 13:12:49,411 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 13:12:49,412 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 13:12:49,412 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 13:12:49,412 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 13:12:49,412 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 13:12:49,412 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 13:12:49,412 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 13:12:49,412 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 13:12:49,412 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 13:12:49,412 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 13:12:49,412 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 13:12:49,413 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 13:12:49,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 13:12:49,413 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 13:12:49,413 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 13:12:49,413 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 13:12:49,413 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 13:12:49,413 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 13:12:49,413 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 13:12:49,414 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 13:12:49,414 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 13:12:49,414 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 13:12:49,414 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 13:12:49,414 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 13:12:49,414 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 13:12:49,414 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 13:12:49,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:12:49,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 13:12:49,414 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 13:12:49,415 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 13:12:49,415 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 13:12:49,415 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 13:12:49,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 13:12:49,415 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 13:12:49,415 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 13:12:49,415 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_49d4ee6b-32f0-44c8-8646-eedcd917db17/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_49d4ee6b-32f0-44c8-8646-eedcd917db17/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 -> fa1630ab5b9ca06d45588653daa6fff0d3a2fbd0851a9f5c3999782c5c51eba5 [2022-12-14 13:12:49,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 13:12:49,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 13:12:49,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 13:12:49,591 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 13:12:49,591 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 13:12:49,593 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49d4ee6b-32f0-44c8-8646-eedcd917db17/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread-wmm/safe015_rmo.i [2022-12-14 13:12:52,164 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 13:12:52,365 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 13:12:52,366 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49d4ee6b-32f0-44c8-8646-eedcd917db17/sv-benchmarks/c/pthread-wmm/safe015_rmo.i [2022-12-14 13:12:52,375 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49d4ee6b-32f0-44c8-8646-eedcd917db17/bin/utaipan-gh47qXpMRh/data/b4f09cf64/6472909ed9b84f56b5c9635030975a46/FLAGacc115239 [2022-12-14 13:12:52,385 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49d4ee6b-32f0-44c8-8646-eedcd917db17/bin/utaipan-gh47qXpMRh/data/b4f09cf64/6472909ed9b84f56b5c9635030975a46 [2022-12-14 13:12:52,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 13:12:52,390 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 13:12:52,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 13:12:52,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 13:12:52,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 13:12:52,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:12:52" (1/1) ... [2022-12-14 13:12:52,397 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fbb0f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:12:52, skipping insertion in model container [2022-12-14 13:12:52,397 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:12:52" (1/1) ... [2022-12-14 13:12:52,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 13:12:52,439 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 13:12:52,597 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_49d4ee6b-32f0-44c8-8646-eedcd917db17/sv-benchmarks/c/pthread-wmm/safe015_rmo.i[988,1001] [2022-12-14 13:12:52,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:12:52,809 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 13:12:52,821 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_49d4ee6b-32f0-44c8-8646-eedcd917db17/sv-benchmarks/c/pthread-wmm/safe015_rmo.i[988,1001] [2022-12-14 13:12:52,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:12:52,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:12:52,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:12:52,901 INFO L208 MainTranslator]: Completed translation [2022-12-14 13:12:52,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:12:52 WrapperNode [2022-12-14 13:12:52,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 13:12:52,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 13:12:52,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 13:12:52,903 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 13:12:52,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:12:52" (1/1) ... [2022-12-14 13:12:52,926 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:12:52" (1/1) ... [2022-12-14 13:12:52,950 INFO L138 Inliner]: procedures = 176, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 166 [2022-12-14 13:12:52,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 13:12:52,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 13:12:52,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 13:12:52,952 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 13:12:52,961 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:12:52" (1/1) ... [2022-12-14 13:12:52,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:12:52" (1/1) ... [2022-12-14 13:12:52,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:12:52" (1/1) ... [2022-12-14 13:12:52,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:12:52" (1/1) ... [2022-12-14 13:12:52,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:12:52" (1/1) ... [2022-12-14 13:12:52,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:12:52" (1/1) ... [2022-12-14 13:12:52,981 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:12:52" (1/1) ... [2022-12-14 13:12:52,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:12:52" (1/1) ... [2022-12-14 13:12:52,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 13:12:52,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 13:12:52,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 13:12:52,988 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 13:12:52,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:12:52" (1/1) ... [2022-12-14 13:12:52,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:12:53,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49d4ee6b-32f0-44c8-8646-eedcd917db17/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:12:53,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49d4ee6b-32f0-44c8-8646-eedcd917db17/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 13:12:53,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49d4ee6b-32f0-44c8-8646-eedcd917db17/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 13:12:53,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 13:12:53,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 13:12:53,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 13:12:53,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 13:12:53,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 13:12:53,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 13:12:53,052 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-14 13:12:53,052 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-14 13:12:53,052 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-14 13:12:53,052 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-14 13:12:53,052 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-14 13:12:53,053 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-14 13:12:53,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 13:12:53,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 13:12:53,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 13:12:53,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 13:12:53,055 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 13:12:53,170 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 13:12:53,172 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 13:12:53,573 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 13:12:53,765 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 13:12:53,766 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 13:12:53,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:12:53 BoogieIcfgContainer [2022-12-14 13:12:53,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 13:12:53,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 13:12:53,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 13:12:53,772 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 13:12:53,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:12:52" (1/3) ... [2022-12-14 13:12:53,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eed4f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:12:53, skipping insertion in model container [2022-12-14 13:12:53,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:12:52" (2/3) ... [2022-12-14 13:12:53,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eed4f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:12:53, skipping insertion in model container [2022-12-14 13:12:53,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:12:53" (3/3) ... [2022-12-14 13:12:53,775 INFO L112 eAbstractionObserver]: Analyzing ICFG safe015_rmo.i [2022-12-14 13:12:53,783 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 13:12:53,791 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 13:12:53,791 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 13:12:53,791 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 13:12:53,838 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-14 13:12:53,864 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 13:12:53,878 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 131 transitions, 277 flow [2022-12-14 13:12:53,881 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 131 transitions, 277 flow [2022-12-14 13:12:53,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 131 transitions, 277 flow [2022-12-14 13:12:53,941 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-14 13:12:53,942 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-14 13:12:53,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-14 13:12:53,950 INFO L119 LiptonReduction]: Number of co-enabled transitions 1852 [2022-12-14 13:13:00,933 INFO L134 LiptonReduction]: Checked pairs total: 4933 [2022-12-14 13:13:00,933 INFO L136 LiptonReduction]: Total number of compositions: 116 [2022-12-14 13:13:00,939 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 26 transitions, 67 flow [2022-12-14 13:13:00,974 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 550 states, 549 states have (on average 3.265938069216758) internal successors, (1793), 549 states have internal predecessors, (1793), 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 13:13:00,987 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 13:13:00,992 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;@a7aeaa5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 13:13:00,992 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-14 13:13:00,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 550 states, 549 states have (on average 3.265938069216758) internal successors, (1793), 549 states have internal predecessors, (1793), 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 13:13:00,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 13:13:00,998 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:13:00,998 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:13:00,999 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:13:01,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:13:01,002 INFO L85 PathProgramCache]: Analyzing trace with hash 573425080, now seen corresponding path program 1 times [2022-12-14 13:13:01,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:13:01,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416391931] [2022-12-14 13:13:01,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:13:01,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:13:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:13:01,163 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 13:13:01,163 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:13:01,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416391931] [2022-12-14 13:13:01,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416391931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:13:01,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:13:01,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:13:01,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369780964] [2022-12-14 13:13:01,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:13:01,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 13:13:01,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:13:01,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 13:13:01,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 13:13:01,187 INFO L87 Difference]: Start difference. First operand has 550 states, 549 states have (on average 3.265938069216758) internal successors, (1793), 549 states have internal predecessors, (1793), 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 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 13:13:01,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:13:01,254 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2022-12-14 13:13:01,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 13:13:01,256 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2022-12-14 13:13:01,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:13:01,268 INFO L225 Difference]: With dead ends: 550 [2022-12-14 13:13:01,268 INFO L226 Difference]: Without dead ends: 550 [2022-12-14 13:13:01,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 13:13:01,271 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:13:01,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:13:01,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-12-14 13:13:01,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2022-12-14 13:13:01,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 3.083788706739526) internal successors, (1693), 549 states have internal predecessors, (1693), 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 13:13:01,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1693 transitions. [2022-12-14 13:13:01,335 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1693 transitions. Word has length 8 [2022-12-14 13:13:01,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:13:01,336 INFO L495 AbstractCegarLoop]: Abstraction has 550 states and 1693 transitions. [2022-12-14 13:13:01,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 13:13:01,336 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1693 transitions. [2022-12-14 13:13:01,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 13:13:01,337 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:13:01,337 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:13:01,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 13:13:01,338 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:13:01,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:13:01,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1304487020, now seen corresponding path program 1 times [2022-12-14 13:13:01,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:13:01,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127085457] [2022-12-14 13:13:01,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:13:01,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:13:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:13:01,658 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 13:13:01,658 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:13:01,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127085457] [2022-12-14 13:13:01,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127085457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:13:01,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:13:01,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:13:01,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261911916] [2022-12-14 13:13:01,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:13:01,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:13:01,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:13:01,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:13:01,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:13:01,661 INFO L87 Difference]: Start difference. First operand 550 states and 1693 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 13:13:01,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:13:01,793 INFO L93 Difference]: Finished difference Result 630 states and 1862 transitions. [2022-12-14 13:13:01,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:13:01,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-12-14 13:13:01,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:13:01,797 INFO L225 Difference]: With dead ends: 630 [2022-12-14 13:13:01,798 INFO L226 Difference]: Without dead ends: 530 [2022-12-14 13:13:01,798 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 13:13:01,799 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 24 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:13:01,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 8 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:13:01,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-12-14 13:13:01,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2022-12-14 13:13:01,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 3.056710775047259) internal successors, (1617), 529 states have internal predecessors, (1617), 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 13:13:01,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1617 transitions. [2022-12-14 13:13:01,825 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1617 transitions. Word has length 10 [2022-12-14 13:13:01,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:13:01,825 INFO L495 AbstractCegarLoop]: Abstraction has 530 states and 1617 transitions. [2022-12-14 13:13:01,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 13:13:01,825 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1617 transitions. [2022-12-14 13:13:01,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 13:13:01,827 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:13:01,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:13:01,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 13:13:01,827 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:13:01,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:13:01,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1784409563, now seen corresponding path program 1 times [2022-12-14 13:13:01,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:13:01,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376190051] [2022-12-14 13:13:01,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:13:01,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:13:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:13:02,086 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 13:13:02,087 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:13:02,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376190051] [2022-12-14 13:13:02,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376190051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:13:02,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:13:02,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:13:02,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66713854] [2022-12-14 13:13:02,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:13:02,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:13:02,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:13:02,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:13:02,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:13:02,089 INFO L87 Difference]: Start difference. First operand 530 states and 1617 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:13:02,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:13:02,212 INFO L93 Difference]: Finished difference Result 575 states and 1698 transitions. [2022-12-14 13:13:02,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:13:02,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 13:13:02,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:13:02,215 INFO L225 Difference]: With dead ends: 575 [2022-12-14 13:13:02,215 INFO L226 Difference]: Without dead ends: 500 [2022-12-14 13:13:02,215 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 13:13:02,216 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 22 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:13:02,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 10 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:13:02,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2022-12-14 13:13:02,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2022-12-14 13:13:02,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 499 states have (on average 3.032064128256513) internal successors, (1513), 499 states have internal predecessors, (1513), 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 13:13:02,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1513 transitions. [2022-12-14 13:13:02,228 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1513 transitions. Word has length 11 [2022-12-14 13:13:02,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:13:02,228 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 1513 transitions. [2022-12-14 13:13:02,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:13:02,228 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1513 transitions. [2022-12-14 13:13:02,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 13:13:02,229 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:13:02,229 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:13:02,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 13:13:02,229 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:13:02,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:13:02,230 INFO L85 PathProgramCache]: Analyzing trace with hash -517859827, now seen corresponding path program 1 times [2022-12-14 13:13:02,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:13:02,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875530471] [2022-12-14 13:13:02,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:13:02,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:13:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:13:03,410 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 13:13:03,411 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:13:03,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875530471] [2022-12-14 13:13:03,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875530471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:13:03,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:13:03,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 13:13:03,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558613491] [2022-12-14 13:13:03,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:13:03,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 13:13:03,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:13:03,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 13:13:03,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:13:03,413 INFO L87 Difference]: Start difference. First operand 500 states and 1513 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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 13:13:03,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:13:03,587 INFO L93 Difference]: Finished difference Result 545 states and 1594 transitions. [2022-12-14 13:13:03,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:13:03,588 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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 13:13:03,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:13:03,591 INFO L225 Difference]: With dead ends: 545 [2022-12-14 13:13:03,591 INFO L226 Difference]: Without dead ends: 470 [2022-12-14 13:13:03,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-12-14 13:13:03,592 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 36 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:13:03,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 8 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:13:03,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-12-14 13:13:03,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2022-12-14 13:13:03,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 3.0042643923240937) internal successors, (1409), 469 states have internal predecessors, (1409), 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 13:13:03,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1409 transitions. [2022-12-14 13:13:03,606 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1409 transitions. Word has length 12 [2022-12-14 13:13:03,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:13:03,606 INFO L495 AbstractCegarLoop]: Abstraction has 470 states and 1409 transitions. [2022-12-14 13:13:03,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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 13:13:03,607 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1409 transitions. [2022-12-14 13:13:03,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 13:13:03,607 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:13:03,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:13:03,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 13:13:03,608 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:13:03,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:13:03,608 INFO L85 PathProgramCache]: Analyzing trace with hash 807196600, now seen corresponding path program 1 times [2022-12-14 13:13:03,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:13:03,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478916448] [2022-12-14 13:13:03,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:13:03,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:13:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:13:04,230 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 13:13:04,230 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:13:04,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478916448] [2022-12-14 13:13:04,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478916448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:13:04,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:13:04,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 13:13:04,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373105692] [2022-12-14 13:13:04,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:13:04,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 13:13:04,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:13:04,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 13:13:04,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:13:04,232 INFO L87 Difference]: Start difference. First operand 470 states and 1409 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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 13:13:04,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:13:04,484 INFO L93 Difference]: Finished difference Result 654 states and 1963 transitions. [2022-12-14 13:13:04,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 13:13:04,484 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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 13:13:04,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:13:04,487 INFO L225 Difference]: With dead ends: 654 [2022-12-14 13:13:04,487 INFO L226 Difference]: Without dead ends: 594 [2022-12-14 13:13:04,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-14 13:13:04,488 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 39 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:13:04,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 13 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:13:04,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-12-14 13:13:04,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 534. [2022-12-14 13:13:04,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 3.026266416510319) internal successors, (1613), 533 states have internal predecessors, (1613), 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 13:13:04,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 1613 transitions. [2022-12-14 13:13:04,500 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 1613 transitions. Word has length 13 [2022-12-14 13:13:04,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:13:04,500 INFO L495 AbstractCegarLoop]: Abstraction has 534 states and 1613 transitions. [2022-12-14 13:13:04,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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 13:13:04,500 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 1613 transitions. [2022-12-14 13:13:04,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 13:13:04,501 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:13:04,501 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:13:04,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 13:13:04,501 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:13:04,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:13:04,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1563152428, now seen corresponding path program 2 times [2022-12-14 13:13:04,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:13:04,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145579890] [2022-12-14 13:13:04,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:13:04,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:13:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:13:05,202 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 13:13:05,202 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:13:05,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145579890] [2022-12-14 13:13:05,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145579890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:13:05,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:13:05,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 13:13:05,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479463208] [2022-12-14 13:13:05,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:13:05,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 13:13:05,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:13:05,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 13:13:05,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-14 13:13:05,204 INFO L87 Difference]: Start difference. First operand 534 states and 1613 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 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 13:13:05,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:13:05,465 INFO L93 Difference]: Finished difference Result 630 states and 1863 transitions. [2022-12-14 13:13:05,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 13:13:05,466 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 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 13:13:05,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:13:05,469 INFO L225 Difference]: With dead ends: 630 [2022-12-14 13:13:05,469 INFO L226 Difference]: Without dead ends: 570 [2022-12-14 13:13:05,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-12-14 13:13:05,470 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 49 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:13:05,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 13 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:13:05,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2022-12-14 13:13:05,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 440. [2022-12-14 13:13:05,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 2.9726651480637813) internal successors, (1305), 439 states have internal predecessors, (1305), 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 13:13:05,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1305 transitions. [2022-12-14 13:13:05,487 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1305 transitions. Word has length 13 [2022-12-14 13:13:05,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:13:05,487 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 1305 transitions. [2022-12-14 13:13:05,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 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 13:13:05,487 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1305 transitions. [2022-12-14 13:13:05,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 13:13:05,488 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:13:05,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:13:05,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 13:13:05,489 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:13:05,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:13:05,489 INFO L85 PathProgramCache]: Analyzing trace with hash 2121028328, now seen corresponding path program 1 times [2022-12-14 13:13:05,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:13:05,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760099244] [2022-12-14 13:13:05,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:13:05,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:13:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:13:05,685 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 13:13:05,685 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:13:05,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760099244] [2022-12-14 13:13:05,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760099244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:13:05,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:13:05,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:13:05,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903178992] [2022-12-14 13:13:05,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:13:05,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:13:05,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:13:05,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:13:05,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:13:05,687 INFO L87 Difference]: Start difference. First operand 440 states and 1305 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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 13:13:05,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:13:05,782 INFO L93 Difference]: Finished difference Result 412 states and 1076 transitions. [2022-12-14 13:13:05,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 13:13:05,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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 13:13:05,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:13:05,784 INFO L225 Difference]: With dead ends: 412 [2022-12-14 13:13:05,784 INFO L226 Difference]: Without dead ends: 312 [2022-12-14 13:13:05,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:13:05,785 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 38 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:13:05,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 6 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:13:05,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-12-14 13:13:05,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2022-12-14 13:13:05,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 2.54983922829582) internal successors, (793), 311 states have internal predecessors, (793), 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 13:13:05,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 793 transitions. [2022-12-14 13:13:05,794 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 793 transitions. Word has length 14 [2022-12-14 13:13:05,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:13:05,794 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 793 transitions. [2022-12-14 13:13:05,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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 13:13:05,795 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 793 transitions. [2022-12-14 13:13:05,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 13:13:05,795 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:13:05,796 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:13:05,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 13:13:05,796 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:13:05,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:13:05,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1878114128, now seen corresponding path program 1 times [2022-12-14 13:13:05,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:13:05,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268888715] [2022-12-14 13:13:05,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:13:05,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:13:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:13:05,997 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 13:13:05,998 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:13:05,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268888715] [2022-12-14 13:13:05,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268888715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:13:05,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:13:05,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:13:05,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821928549] [2022-12-14 13:13:05,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:13:05,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:13:05,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:13:05,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:13:05,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:13:05,999 INFO L87 Difference]: Start difference. First operand 312 states and 793 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:13:06,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:13:06,100 INFO L93 Difference]: Finished difference Result 244 states and 564 transitions. [2022-12-14 13:13:06,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:13:06,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 13:13:06,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:13:06,102 INFO L225 Difference]: With dead ends: 244 [2022-12-14 13:13:06,102 INFO L226 Difference]: Without dead ends: 192 [2022-12-14 13:13:06,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 13:13:06,103 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 67 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:13:06,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 8 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:13:06,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-12-14 13:13:06,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2022-12-14 13:13:06,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 2.2670157068062826) internal successors, (433), 191 states have internal predecessors, (433), 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 13:13:06,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 433 transitions. [2022-12-14 13:13:06,108 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 433 transitions. Word has length 16 [2022-12-14 13:13:06,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:13:06,108 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 433 transitions. [2022-12-14 13:13:06,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:13:06,109 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 433 transitions. [2022-12-14 13:13:06,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 13:13:06,109 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:13:06,109 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:13:06,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 13:13:06,110 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:13:06,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:13:06,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1977244839, now seen corresponding path program 1 times [2022-12-14 13:13:06,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:13:06,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052828937] [2022-12-14 13:13:06,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:13:06,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:13:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:13:06,843 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 13:13:06,844 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:13:06,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052828937] [2022-12-14 13:13:06,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052828937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:13:06,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:13:06,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 13:13:06,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016299636] [2022-12-14 13:13:06,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:13:06,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 13:13:06,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:13:06,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 13:13:06,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-14 13:13:06,845 INFO L87 Difference]: Start difference. First operand 192 states and 433 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 13:13:07,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:13:07,094 INFO L93 Difference]: Finished difference Result 386 states and 852 transitions. [2022-12-14 13:13:07,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 13:13:07,095 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 18 [2022-12-14 13:13:07,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:13:07,096 INFO L225 Difference]: With dead ends: 386 [2022-12-14 13:13:07,096 INFO L226 Difference]: Without dead ends: 277 [2022-12-14 13:13:07,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-12-14 13:13:07,096 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 53 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:13:07,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 17 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:13:07,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-12-14 13:13:07,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 230. [2022-12-14 13:13:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 2.2139737991266375) internal successors, (507), 229 states have internal predecessors, (507), 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 13:13:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 507 transitions. [2022-12-14 13:13:07,101 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 507 transitions. Word has length 18 [2022-12-14 13:13:07,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:13:07,101 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 507 transitions. [2022-12-14 13:13:07,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 13:13:07,101 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 507 transitions. [2022-12-14 13:13:07,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 13:13:07,101 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:13:07,101 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:13:07,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 13:13:07,102 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:13:07,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:13:07,102 INFO L85 PathProgramCache]: Analyzing trace with hash 342229239, now seen corresponding path program 2 times [2022-12-14 13:13:07,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:13:07,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117027671] [2022-12-14 13:13:07,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:13:07,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:13:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:13:07,607 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 13:13:07,608 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:13:07,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117027671] [2022-12-14 13:13:07,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117027671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:13:07,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:13:07,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 13:13:07,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151353824] [2022-12-14 13:13:07,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:13:07,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 13:13:07,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:13:07,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 13:13:07,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:13:07,609 INFO L87 Difference]: Start difference. First operand 230 states and 507 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 13:13:07,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:13:07,834 INFO L93 Difference]: Finished difference Result 403 states and 877 transitions. [2022-12-14 13:13:07,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 13:13:07,835 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2022-12-14 13:13:07,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:13:07,836 INFO L225 Difference]: With dead ends: 403 [2022-12-14 13:13:07,836 INFO L226 Difference]: Without dead ends: 302 [2022-12-14 13:13:07,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-12-14 13:13:07,836 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 37 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:13:07,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 11 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:13:07,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-12-14 13:13:07,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 192. [2022-12-14 13:13:07,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 2.1465968586387434) internal successors, (410), 191 states have internal predecessors, (410), 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 13:13:07,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 410 transitions. [2022-12-14 13:13:07,840 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 410 transitions. Word has length 18 [2022-12-14 13:13:07,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:13:07,840 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 410 transitions. [2022-12-14 13:13:07,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 13:13:07,841 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 410 transitions. [2022-12-14 13:13:07,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 13:13:07,841 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:13:07,841 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:13:07,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 13:13:07,841 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:13:07,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:13:07,842 INFO L85 PathProgramCache]: Analyzing trace with hash 157133060, now seen corresponding path program 1 times [2022-12-14 13:13:07,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:13:07,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89545603] [2022-12-14 13:13:07,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:13:07,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:13:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:13:07,962 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 13:13:07,963 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:13:07,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89545603] [2022-12-14 13:13:07,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89545603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:13:07,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:13:07,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:13:07,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500940240] [2022-12-14 13:13:07,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:13:07,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:13:07,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:13:07,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:13:07,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:13:07,964 INFO L87 Difference]: Start difference. First operand 192 states and 410 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 13:13:08,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:13:08,060 INFO L93 Difference]: Finished difference Result 270 states and 549 transitions. [2022-12-14 13:13:08,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:13:08,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2022-12-14 13:13:08,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:13:08,062 INFO L225 Difference]: With dead ends: 270 [2022-12-14 13:13:08,062 INFO L226 Difference]: Without dead ends: 184 [2022-12-14 13:13:08,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:13:08,062 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 17 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:13:08,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 7 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:13:08,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-12-14 13:13:08,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 178. [2022-12-14 13:13:08,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 2.0112994350282487) internal successors, (356), 177 states have internal predecessors, (356), 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 13:13:08,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 356 transitions. [2022-12-14 13:13:08,065 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 356 transitions. Word has length 18 [2022-12-14 13:13:08,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:13:08,066 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 356 transitions. [2022-12-14 13:13:08,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 13:13:08,066 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 356 transitions. [2022-12-14 13:13:08,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 13:13:08,066 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:13:08,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:13:08,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 13:13:08,067 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:13:08,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:13:08,067 INFO L85 PathProgramCache]: Analyzing trace with hash 569862311, now seen corresponding path program 3 times [2022-12-14 13:13:08,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:13:08,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607966389] [2022-12-14 13:13:08,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:13:08,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:13:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:13:08,296 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 13:13:08,296 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:13:08,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607966389] [2022-12-14 13:13:08,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607966389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:13:08,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:13:08,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:13:08,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240024169] [2022-12-14 13:13:08,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:13:08,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 13:13:08,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:13:08,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 13:13:08,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:13:08,298 INFO L87 Difference]: Start difference. First operand 178 states and 356 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 13:13:08,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:13:08,449 INFO L93 Difference]: Finished difference Result 296 states and 595 transitions. [2022-12-14 13:13:08,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 13:13:08,449 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2022-12-14 13:13:08,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:13:08,451 INFO L225 Difference]: With dead ends: 296 [2022-12-14 13:13:08,451 INFO L226 Difference]: Without dead ends: 201 [2022-12-14 13:13:08,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-14 13:13:08,452 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 32 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:13:08,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 9 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:13:08,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-12-14 13:13:08,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 187. [2022-12-14 13:13:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 1.9946236559139785) internal successors, (371), 186 states have internal predecessors, (371), 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 13:13:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 371 transitions. [2022-12-14 13:13:08,457 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 371 transitions. Word has length 18 [2022-12-14 13:13:08,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:13:08,457 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 371 transitions. [2022-12-14 13:13:08,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 13:13:08,457 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 371 transitions. [2022-12-14 13:13:08,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 13:13:08,458 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:13:08,458 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:13:08,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 13:13:08,458 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:13:08,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:13:08,458 INFO L85 PathProgramCache]: Analyzing trace with hash 589476915, now seen corresponding path program 4 times [2022-12-14 13:13:08,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:13:08,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723397962] [2022-12-14 13:13:08,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:13:08,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:13:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:13:08,635 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 13:13:08,635 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:13:08,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723397962] [2022-12-14 13:13:08,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723397962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:13:08,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:13:08,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 13:13:08,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379933038] [2022-12-14 13:13:08,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:13:08,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 13:13:08,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:13:08,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 13:13:08,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:13:08,637 INFO L87 Difference]: Start difference. First operand 187 states and 371 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 13:13:08,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:13:08,725 INFO L93 Difference]: Finished difference Result 163 states and 323 transitions. [2022-12-14 13:13:08,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 13:13:08,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2022-12-14 13:13:08,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:13:08,726 INFO L225 Difference]: With dead ends: 163 [2022-12-14 13:13:08,726 INFO L226 Difference]: Without dead ends: 63 [2022-12-14 13:13:08,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-12-14 13:13:08,726 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 75 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:13:08,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 5 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:13:08,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-12-14 13:13:08,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-12-14 13:13:08,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 62 states have internal predecessors, (107), 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 13:13:08,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 107 transitions. [2022-12-14 13:13:08,728 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 107 transitions. Word has length 18 [2022-12-14 13:13:08,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:13:08,728 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 107 transitions. [2022-12-14 13:13:08,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 13:13:08,728 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 107 transitions. [2022-12-14 13:13:08,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 13:13:08,728 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:13:08,728 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] [2022-12-14 13:13:08,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 13:13:08,729 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:13:08,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:13:08,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1751773482, now seen corresponding path program 1 times [2022-12-14 13:13:08,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:13:08,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581512566] [2022-12-14 13:13:08,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:13:08,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:13:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:13:09,542 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 13:13:09,542 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:13:09,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581512566] [2022-12-14 13:13:09,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581512566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:13:09,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:13:09,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 13:13:09,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438335006] [2022-12-14 13:13:09,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:13:09,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 13:13:09,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:13:09,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 13:13:09,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-14 13:13:09,544 INFO L87 Difference]: Start difference. First operand 63 states and 107 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 13:13:09,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:13:09,708 INFO L93 Difference]: Finished difference Result 92 states and 157 transitions. [2022-12-14 13:13:09,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 13:13:09,709 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 21 [2022-12-14 13:13:09,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:13:09,709 INFO L225 Difference]: With dead ends: 92 [2022-12-14 13:13:09,709 INFO L226 Difference]: Without dead ends: 64 [2022-12-14 13:13:09,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-14 13:13:09,710 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 29 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:13:09,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 8 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:13:09,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-12-14 13:13:09,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2022-12-14 13:13:09,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.6842105263157894) internal successors, (96), 57 states have internal predecessors, (96), 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 13:13:09,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 96 transitions. [2022-12-14 13:13:09,713 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 96 transitions. Word has length 21 [2022-12-14 13:13:09,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:13:09,713 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 96 transitions. [2022-12-14 13:13:09,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 13:13:09,713 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 96 transitions. [2022-12-14 13:13:09,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 13:13:09,713 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:13:09,714 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] [2022-12-14 13:13:09,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 13:13:09,714 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:13:09,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:13:09,714 INFO L85 PathProgramCache]: Analyzing trace with hash 609632576, now seen corresponding path program 2 times [2022-12-14 13:13:09,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:13:09,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244490770] [2022-12-14 13:13:09,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:13:09,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:13:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 13:13:09,765 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 13:13:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 13:13:09,827 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 13:13:09,827 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 13:13:09,828 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-14 13:13:09,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-14 13:13:09,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-14 13:13:09,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-14 13:13:09,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 13:13:09,831 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:13:09,835 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-14 13:13:09,835 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 13:13:09,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 01:13:09 BasicIcfg [2022-12-14 13:13:09,883 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 13:13:09,883 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 13:13:09,884 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 13:13:09,884 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 13:13:09,884 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:12:53" (3/4) ... [2022-12-14 13:13:09,885 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 13:13:09,942 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49d4ee6b-32f0-44c8-8646-eedcd917db17/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 13:13:09,942 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 13:13:09,943 INFO L158 Benchmark]: Toolchain (without parser) took 17553.46ms. Allocated memory was 195.0MB in the beginning and 394.3MB in the end (delta: 199.2MB). Free memory was 164.2MB in the beginning and 223.5MB in the end (delta: -59.4MB). Peak memory consumption was 142.2MB. Max. memory is 16.1GB. [2022-12-14 13:13:09,943 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 13:13:09,944 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.95ms. Allocated memory is still 195.0MB. Free memory was 164.2MB in the beginning and 135.5MB in the end (delta: 28.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-12-14 13:13:09,944 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.38ms. Allocated memory is still 195.0MB. Free memory was 135.5MB in the beginning and 132.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 13:13:09,944 INFO L158 Benchmark]: Boogie Preprocessor took 35.45ms. Allocated memory is still 195.0MB. Free memory was 132.7MB in the beginning and 130.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 13:13:09,944 INFO L158 Benchmark]: RCFGBuilder took 780.17ms. Allocated memory is still 195.0MB. Free memory was 130.2MB in the beginning and 112.6MB in the end (delta: 17.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-12-14 13:13:09,945 INFO L158 Benchmark]: TraceAbstraction took 16113.72ms. Allocated memory was 195.0MB in the beginning and 394.3MB in the end (delta: 199.2MB). Free memory was 112.6MB in the beginning and 238.2MB in the end (delta: -125.6MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. [2022-12-14 13:13:09,945 INFO L158 Benchmark]: Witness Printer took 59.01ms. Allocated memory is still 394.3MB. Free memory was 238.2MB in the beginning and 223.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-14 13:13:09,947 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 510.95ms. Allocated memory is still 195.0MB. Free memory was 164.2MB in the beginning and 135.5MB in the end (delta: 28.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.38ms. Allocated memory is still 195.0MB. Free memory was 135.5MB in the beginning and 132.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.45ms. Allocated memory is still 195.0MB. Free memory was 132.7MB in the beginning and 130.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 780.17ms. Allocated memory is still 195.0MB. Free memory was 130.2MB in the beginning and 112.6MB in the end (delta: 17.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 16113.72ms. Allocated memory was 195.0MB in the beginning and 394.3MB in the end (delta: 199.2MB). Free memory was 112.6MB in the beginning and 238.2MB in the end (delta: -125.6MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. * Witness Printer took 59.01ms. Allocated memory is still 394.3MB. Free memory was 238.2MB in the beginning and 223.5MB in the end (delta: 14.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: 7.1s, 139 PlacesBefore, 35 PlacesAfterwards, 131 TransitionsBefore, 26 TransitionsAfterwards, 1852 CoEnabledTransitionPairs, 8 FixpointIterations, 59 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 116 TotalNumberOfCompositions, 4933 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2178, independent: 1972, independent conditional: 0, independent unconditional: 1972, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1250, independent: 1197, independent conditional: 0, independent unconditional: 1197, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1250, independent: 1179, independent conditional: 0, independent unconditional: 1179, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 71, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 482, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 466, dependent conditional: 0, dependent unconditional: 466, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2178, independent: 775, independent conditional: 0, independent unconditional: 775, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 1250, unknown conditional: 0, unknown unconditional: 1250] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 84, Positive conditional cache size: 0, Positive unconditional cache size: 84, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L852] 0 pthread_t t2133; [L853] FCALL, FORK 0 pthread_create(&t2133, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2133, ((void *)0), P0, ((void *)0))=-2, t2133={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L854] 0 pthread_t t2134; [L855] FCALL, FORK 0 pthread_create(&t2134, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2134, ((void *)0), P1, ((void *)0))=-1, t2133={7:0}, t2134={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L856] 0 pthread_t t2135; [L857] FCALL, FORK 0 pthread_create(&t2135, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2135, ((void *)0), P2, ((void *)0))=0, t2133={7:0}, t2134={8:0}, t2135={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L809] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L810] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L811] 3 x$flush_delayed = weak$$choice2 [L812] EXPR 3 \read(x) [L812] 3 x$mem_tmp = x [L813] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] EXPR 3 \read(x) [L813] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L814] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L815] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L816] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L817] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L819] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L821] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L822] EXPR 3 \read(x) [L822] 3 __unbuffered_p2_EAX = x [L823] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L823] 3 x = x$flush_delayed ? x$mem_tmp : x [L824] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L827] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L830] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L830] EXPR 3 \read(x) [L830] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L830] 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) [L831] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L832] 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 [L833] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L834] 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_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 3 return 0; [L759] 1 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=4, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !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) [L768] EXPR 1 \read(x) [L768] EXPR 1 !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) [L768] 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) [L769] 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)) [L770] 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)) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 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)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 1 \read(x) [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L789] 2 x = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L792] 2 x = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] EXPR 2 \read(x) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L795] 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) [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 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 [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L799] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L861] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L861] RET 0 assume_abort_if_not(main$tmp_guard0) [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L863] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L863] EXPR 0 \read(x) [L863] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L863] 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) [L864] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L865] 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 [L866] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L867] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2133={7:0}, t2134={8:0}, t2135={5:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 x$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(x) [L873] 0 x$mem_tmp = x [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L874] EXPR 0 \read(x) [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L874] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L876] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L877] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L878] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L880] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L882] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L882] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L882] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L883] EXPR 0 \read(x) [L883] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2) [L884] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L884] EXPR 0 \read(x) [L884] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L884] 0 x = x$flush_delayed ? x$mem_tmp : x [L885] 0 x$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 855]: 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: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 156 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 16.0s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 518 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 518 mSDsluCounter, 125 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1349 IncrementalHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 45 mSDtfsCounter, 1349 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=550occurred in iteration=0, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 373 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 2067 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 13:13:09,965 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49d4ee6b-32f0-44c8-8646-eedcd917db17/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