./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi008.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_79c347f1-1516-4c39-92b6-45be3d040365/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c347f1-1516-4c39-92b6-45be3d040365/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c347f1-1516-4c39-92b6-45be3d040365/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c347f1-1516-4c39-92b6-45be3d040365/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c347f1-1516-4c39-92b6-45be3d040365/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c347f1-1516-4c39-92b6-45be3d040365/bin/utaipan-ByfvJB40ur --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 0d082f4414248fc35e1fa616a9787901263e0e45c6e6a28545f00aa25d14032e --- 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-38b53e6 [2022-11-26 00:05:38,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:05:38,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:05:38,229 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:05:38,229 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:05:38,231 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:05:38,232 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:05:38,234 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:05:38,240 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:05:38,245 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:05:38,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:05:38,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:05:38,250 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:05:38,255 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:05:38,258 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:05:38,260 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:05:38,262 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:05:38,263 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:05:38,265 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:05:38,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:05:38,273 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:05:38,276 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:05:38,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:05:38,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:05:38,290 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:05:38,290 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:05:38,290 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:05:38,293 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:05:38,293 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:05:38,294 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:05:38,294 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:05:38,295 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:05:38,297 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:05:38,297 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:05:38,300 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:05:38,300 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:05:38,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:05:38,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:05:38,301 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:05:38,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:05:38,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:05:38,305 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c347f1-1516-4c39-92b6-45be3d040365/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-26 00:05:38,347 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:05:38,347 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:05:38,348 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:05:38,348 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:05:38,349 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:05:38,349 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:05:38,350 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:05:38,350 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:05:38,350 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:05:38,350 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:05:38,352 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:05:38,352 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:05:38,352 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:05:38,352 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:05:38,353 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:05:38,353 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:05:38,353 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:05:38,353 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:05:38,354 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:05:38,354 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:05:38,355 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:05:38,355 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:05:38,355 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:05:38,355 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:05:38,355 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:05:38,356 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:05:38,356 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:05:38,357 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:05:38,357 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:05:38,357 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:05:38,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:05:38,358 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:05:38,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:05:38,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:05:38,359 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:05:38,359 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:05:38,359 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:05:38,359 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:05:38,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:05:38,360 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:05:38,360 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:05:38,360 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_79c347f1-1516-4c39-92b6-45be3d040365/bin/utaipan-ByfvJB40ur/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_79c347f1-1516-4c39-92b6-45be3d040365/bin/utaipan-ByfvJB40ur 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 -> 0d082f4414248fc35e1fa616a9787901263e0e45c6e6a28545f00aa25d14032e [2022-11-26 00:05:38,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:05:38,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:05:38,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:05:38,704 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:05:38,705 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:05:38,706 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c347f1-1516-4c39-92b6-45be3d040365/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/pthread-wmm/rfi008.opt.i [2022-11-26 00:05:41,783 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:05:42,053 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:05:42,054 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c347f1-1516-4c39-92b6-45be3d040365/sv-benchmarks/c/pthread-wmm/rfi008.opt.i [2022-11-26 00:05:42,068 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c347f1-1516-4c39-92b6-45be3d040365/bin/utaipan-ByfvJB40ur/data/291912998/cdf56493207b446da5605942fc710aaa/FLAGbe34d4113 [2022-11-26 00:05:42,083 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c347f1-1516-4c39-92b6-45be3d040365/bin/utaipan-ByfvJB40ur/data/291912998/cdf56493207b446da5605942fc710aaa [2022-11-26 00:05:42,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:05:42,093 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:05:42,095 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:05:42,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:05:42,102 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:05:42,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:05:42" (1/1) ... [2022-11-26 00:05:42,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9ff5ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:42, skipping insertion in model container [2022-11-26 00:05:42,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:05:42" (1/1) ... [2022-11-26 00:05:42,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:05:42,158 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:05:42,365 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_79c347f1-1516-4c39-92b6-45be3d040365/sv-benchmarks/c/pthread-wmm/rfi008.opt.i[987,1000] [2022-11-26 00:05:42,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:42,627 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:42,627 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:42,628 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:42,628 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:42,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:42,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:42,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:42,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:42,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:42,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:42,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:42,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:42,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:42,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:42,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:42,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:42,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:42,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:42,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:42,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:42,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:42,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:42,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:42,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:42,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:42,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:05:42,704 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:05:42,717 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_79c347f1-1516-4c39-92b6-45be3d040365/sv-benchmarks/c/pthread-wmm/rfi008.opt.i[987,1000] [2022-11-26 00:05:42,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:42,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:42,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:42,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:42,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:42,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:42,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:42,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:42,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:42,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:42,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:42,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:42,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:42,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:42,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:42,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:42,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:42,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:42,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:42,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:42,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:42,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:42,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:42,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:42,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:05:42,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:05:42,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:05:42,805 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:05:42,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:42 WrapperNode [2022-11-26 00:05:42,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:05:42,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:05:42,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:05:42,808 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:05:42,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:42" (1/1) ... [2022-11-26 00:05:42,849 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:42" (1/1) ... [2022-11-26 00:05:42,887 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2022-11-26 00:05:42,892 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:05:42,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:05:42,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:05:42,893 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:05:42,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:42" (1/1) ... [2022-11-26 00:05:42,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:42" (1/1) ... [2022-11-26 00:05:42,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:42" (1/1) ... [2022-11-26 00:05:42,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:42" (1/1) ... [2022-11-26 00:05:42,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:42" (1/1) ... [2022-11-26 00:05:42,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:42" (1/1) ... [2022-11-26 00:05:42,954 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:42" (1/1) ... [2022-11-26 00:05:42,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:42" (1/1) ... [2022-11-26 00:05:42,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:05:42,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:05:42,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:05:42,960 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:05:42,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:42" (1/1) ... [2022-11-26 00:05:42,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:05:42,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c347f1-1516-4c39-92b6-45be3d040365/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:05:43,012 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c347f1-1516-4c39-92b6-45be3d040365/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:05:43,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c347f1-1516-4c39-92b6-45be3d040365/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:05:43,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 00:05:43,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-26 00:05:43,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:05:43,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 00:05:43,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 00:05:43,090 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-26 00:05:43,090 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-26 00:05:43,090 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-26 00:05:43,091 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-26 00:05:43,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:05:43,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-26 00:05:43,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:05:43,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:05:43,093 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-26 00:05:43,291 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:05:43,308 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:05:43,631 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:05:43,842 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:05:43,842 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-26 00:05:43,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:05:43 BoogieIcfgContainer [2022-11-26 00:05:43,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:05:43,847 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:05:43,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:05:43,850 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:05:43,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:05:42" (1/3) ... [2022-11-26 00:05:43,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f4bfbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:05:43, skipping insertion in model container [2022-11-26 00:05:43,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:05:42" (2/3) ... [2022-11-26 00:05:43,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f4bfbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:05:43, skipping insertion in model container [2022-11-26 00:05:43,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:05:43" (3/3) ... [2022-11-26 00:05:43,854 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008.opt.i [2022-11-26 00:05:43,863 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-26 00:05:43,875 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:05:43,875 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-26 00:05:43,875 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-26 00:05:43,923 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-26 00:05:43,955 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-26 00:05:43,975 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 98 transitions, 206 flow [2022-11-26 00:05:43,983 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 98 transitions, 206 flow [2022-11-26 00:05:43,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 98 transitions, 206 flow [2022-11-26 00:05:44,052 INFO L130 PetriNetUnfolder]: 2/96 cut-off events. [2022-11-26 00:05:44,053 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-26 00:05:44,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-11-26 00:05:44,061 INFO L119 LiptonReduction]: Number of co-enabled transitions 1216 [2022-11-26 00:05:48,532 INFO L134 LiptonReduction]: Checked pairs total: 3325 [2022-11-26 00:05:48,533 INFO L136 LiptonReduction]: Total number of compositions: 91 [2022-11-26 00:05:48,541 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 22 transitions, 54 flow [2022-11-26 00:05:48,574 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 197 states, 194 states have (on average 2.618556701030928) internal successors, (508), 196 states have internal predecessors, (508), 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-11-26 00:05:48,593 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:05:48,599 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;@5020fd84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:05:48,599 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-26 00:05:48,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 197 states, 194 states have (on average 2.618556701030928) internal successors, (508), 196 states have internal predecessors, (508), 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-11-26 00:05:48,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-26 00:05:48,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:05:48,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-26 00:05:48,608 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-26 00:05:48,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:05:48,614 INFO L85 PathProgramCache]: Analyzing trace with hash 436190522, now seen corresponding path program 1 times [2022-11-26 00:05:48,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:05:48,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790622799] [2022-11-26 00:05:48,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:05:48,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:05:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:05:49,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:05:49,112 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:05:49,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790622799] [2022-11-26 00:05:49,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790622799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:05:49,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:05:49,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:05:49,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792628639] [2022-11-26 00:05:49,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:05:49,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:05:49,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:05:49,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:05:49,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:05:49,148 INFO L87 Difference]: Start difference. First operand has 197 states, 194 states have (on average 2.618556701030928) internal successors, (508), 196 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:49,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:05:49,238 INFO L93 Difference]: Finished difference Result 167 states and 394 transitions. [2022-11-26 00:05:49,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:05:49,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-26 00:05:49,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:05:49,249 INFO L225 Difference]: With dead ends: 167 [2022-11-26 00:05:49,249 INFO L226 Difference]: Without dead ends: 162 [2022-11-26 00:05:49,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:05:49,253 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 7 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:05:49,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:05:49,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-11-26 00:05:49,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-11-26 00:05:49,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.391304347826087) internal successors, (385), 161 states have internal predecessors, (385), 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-11-26 00:05:49,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 385 transitions. [2022-11-26 00:05:49,306 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 385 transitions. Word has length 5 [2022-11-26 00:05:49,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:05:49,308 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 385 transitions. [2022-11-26 00:05:49,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:49,311 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 385 transitions. [2022-11-26 00:05:49,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 00:05:49,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:05:49,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:05:49,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:05:49,313 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-26 00:05:49,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:05:49,313 INFO L85 PathProgramCache]: Analyzing trace with hash -2017467017, now seen corresponding path program 1 times [2022-11-26 00:05:49,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:05:49,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634078797] [2022-11-26 00:05:49,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:05:49,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:05:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:05:49,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:05:49,513 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:05:49,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634078797] [2022-11-26 00:05:49,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634078797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:05:49,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:05:49,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:05:49,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279343485] [2022-11-26 00:05:49,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:05:49,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:05:49,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:05:49,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:05:49,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:05:49,518 INFO L87 Difference]: Start difference. First operand 162 states and 385 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-11-26 00:05:49,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:05:49,633 INFO L93 Difference]: Finished difference Result 184 states and 414 transitions. [2022-11-26 00:05:49,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:05:49,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-11-26 00:05:49,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:05:49,636 INFO L225 Difference]: With dead ends: 184 [2022-11-26 00:05:49,636 INFO L226 Difference]: Without dead ends: 154 [2022-11-26 00:05:49,636 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-11-26 00:05:49,637 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:05:49,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 6 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:05:49,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-26 00:05:49,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2022-11-26 00:05:49,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 2.3594771241830066) internal successors, (361), 153 states have internal predecessors, (361), 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-11-26 00:05:49,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 361 transitions. [2022-11-26 00:05:49,655 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 361 transitions. Word has length 8 [2022-11-26 00:05:49,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:05:49,655 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 361 transitions. [2022-11-26 00:05:49,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-11-26 00:05:49,656 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 361 transitions. [2022-11-26 00:05:49,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 00:05:49,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:05:49,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:05:49,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:05:49,657 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-26 00:05:49,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:05:49,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1752281465, now seen corresponding path program 1 times [2022-11-26 00:05:49,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:05:49,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997934726] [2022-11-26 00:05:49,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:05:49,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:05:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:05:49,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:05:49,934 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:05:49,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997934726] [2022-11-26 00:05:49,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997934726] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:05:49,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:05:49,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:05:49,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693478515] [2022-11-26 00:05:49,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:05:49,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:05:49,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:05:49,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:05:49,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:05:49,942 INFO L87 Difference]: Start difference. First operand 154 states and 361 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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-11-26 00:05:50,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:05:50,057 INFO L93 Difference]: Finished difference Result 160 states and 362 transitions. [2022-11-26 00:05:50,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:05:50,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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-11-26 00:05:50,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:05:50,062 INFO L225 Difference]: With dead ends: 160 [2022-11-26 00:05:50,062 INFO L226 Difference]: Without dead ends: 142 [2022-11-26 00:05:50,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:05:50,063 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 22 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:05:50,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 5 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:05:50,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-11-26 00:05:50,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-11-26 00:05:50,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 2.3333333333333335) internal successors, (329), 141 states have internal predecessors, (329), 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-11-26 00:05:50,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 329 transitions. [2022-11-26 00:05:50,075 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 329 transitions. Word has length 10 [2022-11-26 00:05:50,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:05:50,075 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 329 transitions. [2022-11-26 00:05:50,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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-11-26 00:05:50,075 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 329 transitions. [2022-11-26 00:05:50,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 00:05:50,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:05:50,077 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:05:50,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 00:05:50,077 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-26 00:05:50,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:05:50,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1773075738, now seen corresponding path program 1 times [2022-11-26 00:05:50,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:05:50,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877563406] [2022-11-26 00:05:50,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:05:50,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:05:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:05:50,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:05:50,274 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:05:50,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877563406] [2022-11-26 00:05:50,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877563406] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:05:50,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:05:50,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:05:50,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850619179] [2022-11-26 00:05:50,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:05:50,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:05:50,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:05:50,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:05:50,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:05:50,277 INFO L87 Difference]: Start difference. First operand 142 states and 329 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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-11-26 00:05:50,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:05:50,378 INFO L93 Difference]: Finished difference Result 146 states and 324 transitions. [2022-11-26 00:05:50,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:05:50,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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-11-26 00:05:50,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:05:50,380 INFO L225 Difference]: With dead ends: 146 [2022-11-26 00:05:50,380 INFO L226 Difference]: Without dead ends: 126 [2022-11-26 00:05:50,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:05:50,381 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 21 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:05:50,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 6 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:05:50,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-26 00:05:50,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-11-26 00:05:50,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 2.28) internal successors, (285), 125 states have internal predecessors, (285), 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-11-26 00:05:50,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 285 transitions. [2022-11-26 00:05:50,405 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 285 transitions. Word has length 10 [2022-11-26 00:05:50,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:05:50,406 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 285 transitions. [2022-11-26 00:05:50,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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-11-26 00:05:50,406 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 285 transitions. [2022-11-26 00:05:50,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-26 00:05:50,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:05:50,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:05:50,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 00:05:50,408 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-26 00:05:50,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:05:50,409 INFO L85 PathProgramCache]: Analyzing trace with hash -332830730, now seen corresponding path program 1 times [2022-11-26 00:05:50,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:05:50,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072320689] [2022-11-26 00:05:50,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:05:50,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:05:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:05:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:05:50,615 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:05:50,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072320689] [2022-11-26 00:05:50,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072320689] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:05:50,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:05:50,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:05:50,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330639818] [2022-11-26 00:05:50,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:05:50,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:05:50,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:05:50,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:05:50,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:05:50,617 INFO L87 Difference]: Start difference. First operand 126 states and 285 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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-11-26 00:05:50,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:05:50,668 INFO L93 Difference]: Finished difference Result 74 states and 129 transitions. [2022-11-26 00:05:50,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:05:50,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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-11-26 00:05:50,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:05:50,671 INFO L225 Difference]: With dead ends: 74 [2022-11-26 00:05:50,671 INFO L226 Difference]: Without dead ends: 74 [2022-11-26 00:05:50,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:05:50,674 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 5 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:05:50,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:05:50,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-26 00:05:50,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-11-26 00:05:50,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.7671232876712328) internal successors, (129), 73 states have internal predecessors, (129), 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-11-26 00:05:50,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 129 transitions. [2022-11-26 00:05:50,693 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 129 transitions. Word has length 12 [2022-11-26 00:05:50,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:05:50,693 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 129 transitions. [2022-11-26 00:05:50,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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-11-26 00:05:50,693 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 129 transitions. [2022-11-26 00:05:50,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 00:05:50,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:05:50,694 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:05:50,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 00:05:50,695 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-26 00:05:50,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:05:50,695 INFO L85 PathProgramCache]: Analyzing trace with hash 354370980, now seen corresponding path program 1 times [2022-11-26 00:05:50,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:05:50,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121091232] [2022-11-26 00:05:50,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:05:50,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:05:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:05:50,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:05:50,960 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:05:50,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121091232] [2022-11-26 00:05:50,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121091232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:05:50,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:05:50,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:05:50,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803007980] [2022-11-26 00:05:50,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:05:50,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:05:50,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:05:50,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:05:50,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:05:50,963 INFO L87 Difference]: Start difference. First operand 74 states and 129 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-11-26 00:05:51,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:05:51,029 INFO L93 Difference]: Finished difference Result 46 states and 73 transitions. [2022-11-26 00:05:51,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:05:51,030 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-11-26 00:05:51,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:05:51,031 INFO L225 Difference]: With dead ends: 46 [2022-11-26 00:05:51,031 INFO L226 Difference]: Without dead ends: 46 [2022-11-26 00:05:51,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:05:51,035 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 13 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:05:51,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:05:51,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-26 00:05:51,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-26 00:05:51,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 45 states have internal predecessors, (73), 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-11-26 00:05:51,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 73 transitions. [2022-11-26 00:05:51,041 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 73 transitions. Word has length 14 [2022-11-26 00:05:51,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:05:51,041 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 73 transitions. [2022-11-26 00:05:51,043 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-11-26 00:05:51,043 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 73 transitions. [2022-11-26 00:05:51,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-26 00:05:51,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:05:51,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:05:51,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-26 00:05:51,044 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-26 00:05:51,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:05:51,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2081265778, now seen corresponding path program 1 times [2022-11-26 00:05:51,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:05:51,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287586563] [2022-11-26 00:05:51,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:05:51,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:05:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:05:51,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:05:51,346 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:05:51,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287586563] [2022-11-26 00:05:51,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287586563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:05:51,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:05:51,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:05:51,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789974611] [2022-11-26 00:05:51,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:05:51,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:05:51,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:05:51,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:05:51,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:05:51,349 INFO L87 Difference]: Start difference. First operand 46 states and 73 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:51,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:05:51,453 INFO L93 Difference]: Finished difference Result 61 states and 93 transitions. [2022-11-26 00:05:51,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:05:51,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-26 00:05:51,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:05:51,454 INFO L225 Difference]: With dead ends: 61 [2022-11-26 00:05:51,454 INFO L226 Difference]: Without dead ends: 26 [2022-11-26 00:05:51,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:05:51,455 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 16 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:05:51,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:05:51,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-26 00:05:51,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-26 00:05:51,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:51,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-11-26 00:05:51,457 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 17 [2022-11-26 00:05:51,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:05:51,457 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-11-26 00:05:51,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:05:51,458 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-11-26 00:05:51,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-26 00:05:51,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:05:51,458 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:05:51,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-26 00:05:51,459 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-26 00:05:51,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:05:51,459 INFO L85 PathProgramCache]: Analyzing trace with hash 12749358, now seen corresponding path program 2 times [2022-11-26 00:05:51,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:05:51,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275143314] [2022-11-26 00:05:51,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:05:51,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:05:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 00:05:51,528 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-26 00:05:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 00:05:51,626 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-26 00:05:51,627 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-26 00:05:51,628 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-11-26 00:05:51,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-26 00:05:51,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-26 00:05:51,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-11-26 00:05:51,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-26 00:05:51,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-26 00:05:51,633 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-11-26 00:05:51,638 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-26 00:05:51,639 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:05:51,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:05:51 BasicIcfg [2022-11-26 00:05:51,703 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:05:51,703 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:05:51,703 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:05:51,703 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:05:51,704 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:05:43" (3/4) ... [2022-11-26 00:05:51,706 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-26 00:05:51,827 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c347f1-1516-4c39-92b6-45be3d040365/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 00:05:51,827 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:05:51,828 INFO L158 Benchmark]: Toolchain (without parser) took 9734.81ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 137.0MB in the beginning and 186.6MB in the end (delta: -49.7MB). Peak memory consumption was 117.2MB. Max. memory is 16.1GB. [2022-11-26 00:05:51,828 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 134.2MB. Free memory was 74.5MB in the beginning and 74.3MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:05:51,828 INFO L158 Benchmark]: CACSL2BoogieTranslator took 711.66ms. Allocated memory is still 184.5MB. Free memory was 137.0MB in the beginning and 110.6MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-26 00:05:51,829 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.02ms. Allocated memory is still 184.5MB. Free memory was 110.6MB in the beginning and 108.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:05:51,829 INFO L158 Benchmark]: Boogie Preprocessor took 66.23ms. Allocated memory is still 184.5MB. Free memory was 108.1MB in the beginning and 106.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:05:51,830 INFO L158 Benchmark]: RCFGBuilder took 885.16ms. Allocated memory is still 184.5MB. Free memory was 106.0MB in the beginning and 124.4MB in the end (delta: -18.4MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2022-11-26 00:05:51,830 INFO L158 Benchmark]: TraceAbstraction took 7855.99ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 123.3MB in the beginning and 67.7MB in the end (delta: 55.6MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. [2022-11-26 00:05:51,830 INFO L158 Benchmark]: Witness Printer took 123.96ms. Allocated memory is still 222.3MB. Free memory was 67.7MB in the beginning and 186.6MB in the end (delta: -118.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-26 00:05:51,833 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.26ms. Allocated memory is still 134.2MB. Free memory was 74.5MB in the beginning and 74.3MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 711.66ms. Allocated memory is still 184.5MB. Free memory was 137.0MB in the beginning and 110.6MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.02ms. Allocated memory is still 184.5MB. Free memory was 110.6MB in the beginning and 108.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.23ms. Allocated memory is still 184.5MB. Free memory was 108.1MB in the beginning and 106.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 885.16ms. Allocated memory is still 184.5MB. Free memory was 106.0MB in the beginning and 124.4MB in the end (delta: -18.4MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7855.99ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 123.3MB in the beginning and 67.7MB in the end (delta: 55.6MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. * Witness Printer took 123.96ms. Allocated memory is still 222.3MB. Free memory was 67.7MB in the beginning and 186.6MB in the end (delta: -118.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 103 PlacesBefore, 28 PlacesAfterwards, 98 TransitionsBefore, 22 TransitionsAfterwards, 1216 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 91 TotalNumberOfCompositions, 3325 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1522, independent: 1385, independent conditional: 0, independent unconditional: 1385, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 910, independent: 866, independent conditional: 0, independent unconditional: 866, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 910, independent: 854, independent conditional: 0, independent unconditional: 854, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 56, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 428, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 408, dependent conditional: 0, dependent unconditional: 408, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1522, independent: 519, independent conditional: 0, independent unconditional: 519, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 910, unknown conditional: 0, unknown unconditional: 910] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 67, Positive conditional cache size: 0, Positive unconditional cache size: 67, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L826] 0 pthread_t t1723; [L827] FCALL, FORK 0 pthread_create(&t1723, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1723, ((void *)0), P0, ((void *)0))=-2, t1723={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L828] 0 pthread_t t1724; [L829] FCALL, FORK 0 pthread_create(&t1724, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1724, ((void *)0), P1, ((void *)0))=-1, t1723={5:0}, t1724={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff1 = y$w_buff0 [L775] 2 y$w_buff0 = 1 [L776] 2 y$w_buff1_used = y$w_buff0_used [L777] 2 y$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 2 y$flush_delayed = weak$$choice2 [L788] 2 y$mem_tmp = y [L789] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L790] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L791] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L792] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L793] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L795] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 __unbuffered_p1_EAX = y [L797] 2 y = y$flush_delayed ? y$mem_tmp : y [L798] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L801] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 y$flush_delayed = weak$$choice2 [L752] 1 y$mem_tmp = y [L753] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L754] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L755] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L756] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L757] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L759] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = y [L761] 1 y = y$flush_delayed ? y$mem_tmp : y [L762] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L804] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L805] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L806] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L807] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 2 return 0; [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1723={5:0}, t1724={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L842] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 829]: 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: 827]: 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 5 procedures, 117 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 100 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 343 IncrementalHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 18 mSDtfsCounter, 343 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred in iteration=0, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 351 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-11-26 00:05:51,863 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79c347f1-1516-4c39-92b6-45be3d040365/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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