./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/memcpy_using_uint64_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/memcpy_using_uint64_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R --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 Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d67b4b463cf9b59771b705723a66a102d698cbc5859334aa26ed48a8838f7285 --- 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-25 18:35:02,209 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:35:02,212 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:35:02,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:35:02,257 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:35:02,259 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:35:02,260 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:35:02,263 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:35:02,273 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:35:02,282 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:35:02,283 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:35:02,284 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:35:02,285 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:35:02,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:35:02,287 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:35:02,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:35:02,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:35:02,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:35:02,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:35:02,308 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:35:02,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:35:02,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:35:02,317 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:35:02,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:35:02,322 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:35:02,323 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:35:02,323 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:35:02,324 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:35:02,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:35:02,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:35:02,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:35:02,327 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:35:02,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:35:02,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:35:02,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:35:02,340 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:35:02,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:35:02,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:35:02,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:35:02,346 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:35:02,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:35:02,348 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-25 18:35:02,396 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:35:02,396 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:35:02,397 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:35:02,397 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:35:02,398 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:35:02,398 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:35:02,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:35:02,400 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:35:02,400 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:35:02,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:35:02,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:35:02,402 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:35:02,402 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:35:02,402 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:35:02,402 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:35:02,403 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:35:02,403 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:35:02,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:35:02,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:35:02,404 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:35:02,404 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:35:02,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:35:02,404 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:35:02,405 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:35:02,405 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:35:02,405 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:35:02,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:35:02,406 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:35:02,406 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:35:02,406 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:35:02,406 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:35:02,406 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/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_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d67b4b463cf9b59771b705723a66a102d698cbc5859334aa26ed48a8838f7285 [2022-11-25 18:35:02,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:35:02,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:35:02,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:35:02,834 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:35:02,835 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:35:02,836 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/aws-c-common/memcpy_using_uint64_harness.i [2022-11-25 18:35:06,589 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:35:07,229 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:35:07,231 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/sv-benchmarks/c/aws-c-common/memcpy_using_uint64_harness.i [2022-11-25 18:35:07,277 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/data/e5eb4209f/6c766a4efcb9432d882ac24e01ee4261/FLAG40232e973 [2022-11-25 18:35:07,306 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/data/e5eb4209f/6c766a4efcb9432d882ac24e01ee4261 [2022-11-25 18:35:07,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:35:07,314 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:35:07,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:35:07,317 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:35:07,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:35:07,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:35:07" (1/1) ... [2022-11-25 18:35:07,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@814e877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:35:07, skipping insertion in model container [2022-11-25 18:35:07,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:35:07" (1/1) ... [2022-11-25 18:35:07,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:35:07,447 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:35:07,782 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_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/sv-benchmarks/c/aws-c-common/memcpy_using_uint64_harness.i[4531,4544] [2022-11-25 18:35:07,791 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_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/sv-benchmarks/c/aws-c-common/memcpy_using_uint64_harness.i[4591,4604] [2022-11-25 18:35:08,762 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:35:08,763 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:35:08,763 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:35:08,764 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:35:08,766 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:35:08,785 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:35:08,786 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:35:08,788 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:35:08,789 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:35:08,792 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:35:08,793 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:35:08,794 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:35:08,795 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:35:08,865 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:35:08,865 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:35:08,866 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:35:08,877 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 18:35:08,883 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 18:35:08,886 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 18:35:09,011 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 18:35:09,013 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 18:35:09,014 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 18:35:09,016 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 18:35:09,018 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 18:35:09,020 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 18:35:09,021 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 18:35:09,022 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 18:35:09,023 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 18:35:09,024 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 18:35:09,025 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 18:35:09,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:35:09,140 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:35:09,167 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_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/sv-benchmarks/c/aws-c-common/memcpy_using_uint64_harness.i[4531,4544] [2022-11-25 18:35:09,168 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_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/sv-benchmarks/c/aws-c-common/memcpy_using_uint64_harness.i[4591,4604] [2022-11-25 18:35:09,230 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:35:09,230 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:35:09,231 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:35:09,232 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:35:09,233 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:35:09,246 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:35:09,246 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:35:09,248 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:35:09,249 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:35:09,251 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:35:09,252 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:35:09,253 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:35:09,254 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:35:09,265 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:35:09,265 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:35:09,266 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:35:09,272 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 18:35:09,281 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 18:35:09,282 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 18:35:09,290 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 18:35:09,291 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 18:35:09,293 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 18:35:09,294 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 18:35:09,295 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 18:35:09,297 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 18:35:09,298 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 18:35:09,299 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 18:35:09,300 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 18:35:09,300 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 18:35:09,301 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 18:35:09,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:35:09,593 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:35:09,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:35:09 WrapperNode [2022-11-25 18:35:09,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:35:09,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:35:09,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:35:09,596 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:35:09,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:35:09" (1/1) ... [2022-11-25 18:35:09,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:35:09" (1/1) ... [2022-11-25 18:35:09,785 INFO L138 Inliner]: procedures = 593, calls = 626, calls flagged for inlining = 39, calls inlined = 6, statements flattened = 136 [2022-11-25 18:35:09,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:35:09,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:35:09,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:35:09,799 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:35:09,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:35:09" (1/1) ... [2022-11-25 18:35:09,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:35:09" (1/1) ... [2022-11-25 18:35:09,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:35:09" (1/1) ... [2022-11-25 18:35:09,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:35:09" (1/1) ... [2022-11-25 18:35:09,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:35:09" (1/1) ... [2022-11-25 18:35:09,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:35:09" (1/1) ... [2022-11-25 18:35:09,874 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:35:09" (1/1) ... [2022-11-25 18:35:09,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:35:09" (1/1) ... [2022-11-25 18:35:09,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:35:09,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:35:09,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:35:09,883 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:35:09,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:35:09" (1/1) ... [2022-11-25 18:35:09,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:35:09,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:35:09,950 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:35:09,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:35:10,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:35:10,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 18:35:10,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 18:35:10,012 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 18:35:10,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:35:10,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:35:10,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:35:10,013 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 18:35:10,013 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 18:35:10,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:35:10,015 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-25 18:35:10,015 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-25 18:35:10,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:35:10,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:35:10,370 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:35:10,373 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:35:10,873 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:35:10,881 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:35:10,881 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-25 18:35:10,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:35:10 BoogieIcfgContainer [2022-11-25 18:35:10,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:35:10,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:35:10,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:35:10,898 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:35:10,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:35:07" (1/3) ... [2022-11-25 18:35:10,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5dedbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:35:10, skipping insertion in model container [2022-11-25 18:35:10,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:35:09" (2/3) ... [2022-11-25 18:35:10,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5dedbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:35:10, skipping insertion in model container [2022-11-25 18:35:10,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:35:10" (3/3) ... [2022-11-25 18:35:10,902 INFO L112 eAbstractionObserver]: Analyzing ICFG memcpy_using_uint64_harness.i [2022-11-25 18:35:10,928 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:35:10,929 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 18:35:10,996 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:35:11,005 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=PETRI_NET, 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;@56a47e88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:35:11,005 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 18:35:11,014 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 48 states have internal predecessors, (64), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 18:35:11,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-25 18:35:11,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:35:11,029 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:35:11,030 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:35:11,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:35:11,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1463681059, now seen corresponding path program 1 times [2022-11-25 18:35:11,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:35:11,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534459151] [2022-11-25 18:35:11,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:35:11,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:35:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:11,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 18:35:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:11,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:35:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:11,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:35:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:11,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:35:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:11,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 18:35:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:11,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:35:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:11,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-25 18:35:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:11,838 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-25 18:35:11,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:35:11,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534459151] [2022-11-25 18:35:11,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534459151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:35:11,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:35:11,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:35:11,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391529744] [2022-11-25 18:35:11,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:35:11,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:35:11,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:35:11,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:35:11,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:35:11,928 INFO L87 Difference]: Start difference. First operand has 63 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 48 states have internal predecessors, (64), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-25 18:35:11,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:35:11,989 INFO L93 Difference]: Finished difference Result 122 states and 176 transitions. [2022-11-25 18:35:11,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:35:11,992 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 66 [2022-11-25 18:35:11,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:35:12,003 INFO L225 Difference]: With dead ends: 122 [2022-11-25 18:35:12,003 INFO L226 Difference]: Without dead ends: 57 [2022-11-25 18:35:12,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:35:12,018 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:35:12,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:35:12,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-25 18:35:12,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-11-25 18:35:12,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 43 states have internal predecessors, (53), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-25 18:35:12,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2022-11-25 18:35:12,082 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 66 [2022-11-25 18:35:12,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:35:12,083 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2022-11-25 18:35:12,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-25 18:35:12,085 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2022-11-25 18:35:12,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-25 18:35:12,092 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:35:12,093 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:35:12,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:35:12,093 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:35:12,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:35:12,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1147031271, now seen corresponding path program 1 times [2022-11-25 18:35:12,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:35:12,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175433335] [2022-11-25 18:35:12,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:35:12,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:35:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:12,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 18:35:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:12,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-25 18:35:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:12,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:35:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:12,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:35:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:12,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-25 18:35:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:12,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:35:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:12,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-25 18:35:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:12,559 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-25 18:35:12,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:35:12,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175433335] [2022-11-25 18:35:12,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175433335] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:35:12,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:35:12,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:35:12,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546853846] [2022-11-25 18:35:12,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:35:12,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:35:12,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:35:12,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:35:12,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:35:12,575 INFO L87 Difference]: Start difference. First operand 57 states and 74 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-25 18:35:12,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:35:12,630 INFO L93 Difference]: Finished difference Result 112 states and 146 transitions. [2022-11-25 18:35:12,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:35:12,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 66 [2022-11-25 18:35:12,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:35:12,637 INFO L225 Difference]: With dead ends: 112 [2022-11-25 18:35:12,637 INFO L226 Difference]: Without dead ends: 59 [2022-11-25 18:35:12,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-25 18:35:12,641 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:35:12,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 142 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:35:12,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-25 18:35:12,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-11-25 18:35:12,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 43 states have (on average 1.255813953488372) internal successors, (54), 44 states have internal predecessors, (54), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-25 18:35:12,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2022-11-25 18:35:12,669 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 66 [2022-11-25 18:35:12,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:35:12,670 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2022-11-25 18:35:12,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-25 18:35:12,670 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2022-11-25 18:35:12,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-25 18:35:12,672 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:35:12,673 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:35:12,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:35:12,674 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:35:12,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:35:12,675 INFO L85 PathProgramCache]: Analyzing trace with hash 824593321, now seen corresponding path program 1 times [2022-11-25 18:35:12,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:35:12,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008169954] [2022-11-25 18:35:12,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:35:12,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:35:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:12,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:35:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:12,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:35:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:13,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 18:35:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:13,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 18:35:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:13,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 18:35:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:13,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 18:35:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:13,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 18:35:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-25 18:35:13,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:35:13,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008169954] [2022-11-25 18:35:13,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008169954] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:35:13,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326227005] [2022-11-25 18:35:13,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:35:13,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:35:13,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:35:13,088 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:35:13,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 18:35:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:13,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 18:35:13,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:35:13,500 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-25 18:35:13,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:35:13,605 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-25 18:35:13,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326227005] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:35:13,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:35:13,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-25 18:35:13,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335655496] [2022-11-25 18:35:13,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:35:13,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:35:13,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:35:13,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:35:13,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:35:13,619 INFO L87 Difference]: Start difference. First operand 58 states and 75 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-11-25 18:35:13,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:35:13,691 INFO L93 Difference]: Finished difference Result 117 states and 153 transitions. [2022-11-25 18:35:13,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:35:13,692 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 68 [2022-11-25 18:35:13,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:35:13,695 INFO L225 Difference]: With dead ends: 117 [2022-11-25 18:35:13,695 INFO L226 Difference]: Without dead ends: 64 [2022-11-25 18:35:13,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:35:13,700 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 2 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:35:13,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 212 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:35:13,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-25 18:35:13,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-25 18:35:13,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 50 states have internal predecessors, (60), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-25 18:35:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2022-11-25 18:35:13,718 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 68 [2022-11-25 18:35:13,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:35:13,718 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2022-11-25 18:35:13,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-11-25 18:35:13,719 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-11-25 18:35:13,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-25 18:35:13,720 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:35:13,721 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:35:13,737 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 18:35:13,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:35:13,930 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:35:13,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:35:13,931 INFO L85 PathProgramCache]: Analyzing trace with hash -615657745, now seen corresponding path program 2 times [2022-11-25 18:35:13,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:35:13,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519916086] [2022-11-25 18:35:13,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:35:13,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:35:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:14,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:35:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:14,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 18:35:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:14,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:35:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:14,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:35:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:14,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:35:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:14,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 18:35:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:14,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 18:35:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-25 18:35:14,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:35:14,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519916086] [2022-11-25 18:35:14,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519916086] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:35:14,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94713348] [2022-11-25 18:35:14,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:35:14,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:35:14,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:35:14,593 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:35:14,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:35:14,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 18:35:14,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:35:14,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 18:35:14,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:35:15,259 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-25 18:35:15,260 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:35:15,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94713348] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:35:15,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:35:15,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2022-11-25 18:35:15,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48731593] [2022-11-25 18:35:15,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:35:15,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:35:15,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:35:15,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:35:15,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:35:15,264 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-25 18:35:15,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:35:15,515 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2022-11-25 18:35:15,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:35:15,516 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 74 [2022-11-25 18:35:15,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:35:15,518 INFO L225 Difference]: With dead ends: 70 [2022-11-25 18:35:15,518 INFO L226 Difference]: Without dead ends: 66 [2022-11-25 18:35:15,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-25 18:35:15,519 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 87 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:35:15,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 238 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:35:15,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-25 18:35:15,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-11-25 18:35:15,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 states have internal predecessors, (61), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-25 18:35:15,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2022-11-25 18:35:15,531 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 74 [2022-11-25 18:35:15,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:35:15,533 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2022-11-25 18:35:15,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-25 18:35:15,534 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2022-11-25 18:35:15,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-25 18:35:15,536 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:35:15,536 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:35:15,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:35:15,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:35:15,744 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:35:15,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:35:15,744 INFO L85 PathProgramCache]: Analyzing trace with hash -694003548, now seen corresponding path program 1 times [2022-11-25 18:35:15,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:35:15,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359463157] [2022-11-25 18:35:15,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:35:15,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:35:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:16,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:35:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:16,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 18:35:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:16,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:35:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:16,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:35:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:16,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 18:35:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:16,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-25 18:35:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:16,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 18:35:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:16,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-25 18:35:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:16,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-25 18:35:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:16,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-25 18:35:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:16,218 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-25 18:35:16,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:35:16,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359463157] [2022-11-25 18:35:16,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359463157] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:35:16,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953462277] [2022-11-25 18:35:16,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:35:16,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:35:16,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:35:16,224 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:35:16,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:35:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:16,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 18:35:16,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:35:16,553 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-11-25 18:35:16,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:35:16,699 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-25 18:35:16,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953462277] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:35:16,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:35:16,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-25 18:35:16,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598698547] [2022-11-25 18:35:16,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:35:16,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 18:35:16,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:35:16,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 18:35:16,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:35:16,704 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-11-25 18:35:16,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:35:16,780 INFO L93 Difference]: Finished difference Result 133 states and 170 transitions. [2022-11-25 18:35:16,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 18:35:16,781 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 91 [2022-11-25 18:35:16,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:35:16,782 INFO L225 Difference]: With dead ends: 133 [2022-11-25 18:35:16,782 INFO L226 Difference]: Without dead ends: 78 [2022-11-25 18:35:16,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:35:16,784 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 2 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:35:16,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 352 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:35:16,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-25 18:35:16,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-25 18:35:16,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 63 states have internal predecessors, (73), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-25 18:35:16,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2022-11-25 18:35:16,795 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 91 [2022-11-25 18:35:16,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:35:16,796 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2022-11-25 18:35:16,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-11-25 18:35:16,796 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2022-11-25 18:35:16,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-25 18:35:16,798 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:35:16,798 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:35:16,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:35:17,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:35:17,009 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:35:17,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:35:17,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1419325160, now seen corresponding path program 2 times [2022-11-25 18:35:17,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:35:17,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050483024] [2022-11-25 18:35:17,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:35:17,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:35:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:17,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 18:35:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:17,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:35:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:17,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 18:35:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:17,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 18:35:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:17,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-25 18:35:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:17,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 18:35:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:17,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 18:35:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:17,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 18:35:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:17,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 18:35:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:17,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 18:35:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:17,757 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 2 proven. 100 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-25 18:35:17,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:35:17,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050483024] [2022-11-25 18:35:17,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050483024] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:35:17,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695141179] [2022-11-25 18:35:17,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:35:17,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:35:17,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:35:17,761 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:35:17,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:35:18,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:35:18,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:35:18,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 18:35:18,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:35:18,228 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-11-25 18:35:18,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:35:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 2 proven. 100 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-25 18:35:18,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695141179] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:35:18,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:35:18,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-11-25 18:35:18,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839372035] [2022-11-25 18:35:18,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:35:18,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-25 18:35:18,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:35:18,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-25 18:35:18,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-11-25 18:35:18,616 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand has 25 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-11-25 18:35:18,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:35:18,750 INFO L93 Difference]: Finished difference Result 157 states and 200 transitions. [2022-11-25 18:35:18,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 18:35:18,751 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 103 [2022-11-25 18:35:18,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:35:18,752 INFO L225 Difference]: With dead ends: 157 [2022-11-25 18:35:18,752 INFO L226 Difference]: Without dead ends: 102 [2022-11-25 18:35:18,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-11-25 18:35:18,754 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 2 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:35:18,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 212 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:35:18,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-25 18:35:18,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-11-25 18:35:18,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 87 states have (on average 1.1149425287356323) internal successors, (97), 87 states have internal predecessors, (97), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-25 18:35:18,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2022-11-25 18:35:18,769 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 103 [2022-11-25 18:35:18,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:35:18,770 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2022-11-25 18:35:18,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-11-25 18:35:18,770 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2022-11-25 18:35:18,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-25 18:35:18,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:35:18,773 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:35:18,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:35:18,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:35:18,987 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:35:18,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:35:18,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1263900672, now seen corresponding path program 3 times [2022-11-25 18:35:18,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:35:18,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854759108] [2022-11-25 18:35:18,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:35:18,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:35:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:20,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 18:35:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:20,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 18:35:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:20,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 18:35:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:20,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:35:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:20,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-25 18:35:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:20,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 18:35:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:20,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 18:35:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:20,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-25 18:35:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:20,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 18:35:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:20,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-25 18:35:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:20,844 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 2 proven. 484 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-25 18:35:20,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:35:20,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854759108] [2022-11-25 18:35:20,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854759108] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:35:20,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671982557] [2022-11-25 18:35:20,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:35:20,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:35:20,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:35:20,847 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:35:20,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 18:35:24,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-25 18:35:24,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:35:24,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-25 18:35:24,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:35:25,187 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2022-11-25 18:35:25,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:35:25,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671982557] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:35:25,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:35:25,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [25] total 33 [2022-11-25 18:35:25,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662875484] [2022-11-25 18:35:25,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:35:25,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:35:25,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:35:25,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:35:25,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=734, Unknown=0, NotChecked=0, Total=1056 [2022-11-25 18:35:25,191 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-25 18:35:25,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:35:25,718 INFO L93 Difference]: Finished difference Result 146 states and 174 transitions. [2022-11-25 18:35:25,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:35:25,719 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 127 [2022-11-25 18:35:25,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:35:25,720 INFO L225 Difference]: With dead ends: 146 [2022-11-25 18:35:25,721 INFO L226 Difference]: Without dead ends: 104 [2022-11-25 18:35:25,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=350, Invalid=982, Unknown=0, NotChecked=0, Total=1332 [2022-11-25 18:35:25,722 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 133 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:35:25,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 476 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 18:35:25,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-25 18:35:25,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2022-11-25 18:35:25,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 88 states have (on average 1.1136363636363635) internal successors, (98), 88 states have internal predecessors, (98), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-25 18:35:25,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2022-11-25 18:35:25,748 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 127 [2022-11-25 18:35:25,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:35:25,750 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2022-11-25 18:35:25,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-25 18:35:25,751 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2022-11-25 18:35:25,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-25 18:35:25,762 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:35:25,762 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:35:25,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 18:35:25,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-25 18:35:25,974 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:35:25,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:35:25,975 INFO L85 PathProgramCache]: Analyzing trace with hash 385852158, now seen corresponding path program 1 times [2022-11-25 18:35:25,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:35:25,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753264410] [2022-11-25 18:35:25,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:35:25,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:35:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:27,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 18:35:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:27,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 18:35:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:27,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 18:35:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:27,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:35:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:27,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 18:35:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:27,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-25 18:35:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:27,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-25 18:35:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:27,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-25 18:35:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:27,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-25 18:35:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:27,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-25 18:35:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:27,651 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 2 proven. 484 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-11-25 18:35:27,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:35:27,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753264410] [2022-11-25 18:35:27,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753264410] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:35:27,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001397497] [2022-11-25 18:35:27,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:35:27,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:35:27,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:35:27,657 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:35:27,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 18:35:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:28,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-25 18:35:28,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:35:28,270 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-11-25 18:35:28,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:35:29,640 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 2 proven. 484 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-11-25 18:35:29,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001397497] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:35:29,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:35:29,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-11-25 18:35:29,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349843175] [2022-11-25 18:35:29,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:35:29,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-25 18:35:29,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:35:29,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-25 18:35:29,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-11-25 18:35:29,646 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand has 49 states, 49 states have (on average 2.9183673469387754) internal successors, (143), 49 states have internal predecessors, (143), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-11-25 18:35:29,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:35:29,935 INFO L93 Difference]: Finished difference Result 207 states and 262 transitions. [2022-11-25 18:35:29,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-25 18:35:29,936 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.9183673469387754) internal successors, (143), 49 states have internal predecessors, (143), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2022-11-25 18:35:29,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:35:29,939 INFO L225 Difference]: With dead ends: 207 [2022-11-25 18:35:29,940 INFO L226 Difference]: Without dead ends: 151 [2022-11-25 18:35:29,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-11-25 18:35:29,943 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 2 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:35:29,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 562 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:35:29,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-25 18:35:29,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-11-25 18:35:29,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 136 states have (on average 1.0735294117647058) internal successors, (146), 136 states have internal predecessors, (146), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-25 18:35:29,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 167 transitions. [2022-11-25 18:35:29,982 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 167 transitions. Word has length 129 [2022-11-25 18:35:29,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:35:29,983 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 167 transitions. [2022-11-25 18:35:29,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.9183673469387754) internal successors, (143), 49 states have internal predecessors, (143), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-11-25 18:35:29,983 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 167 transitions. [2022-11-25 18:35:29,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-11-25 18:35:29,988 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:35:29,988 INFO L195 NwaCegarLoop]: trace histogram [46, 46, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:35:30,006 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-25 18:35:30,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:35:30,198 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:35:30,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:35:30,198 INFO L85 PathProgramCache]: Analyzing trace with hash -2057415474, now seen corresponding path program 2 times [2022-11-25 18:35:30,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:35:30,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201712080] [2022-11-25 18:35:30,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:35:30,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:35:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:34,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 18:35:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:34,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-25 18:35:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:34,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 18:35:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:34,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 18:35:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:34,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-25 18:35:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:34,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-25 18:35:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:34,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-25 18:35:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:34,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-25 18:35:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:34,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-25 18:35:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:34,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-25 18:35:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:34,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 2 proven. 2116 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-11-25 18:35:34,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:35:34,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201712080] [2022-11-25 18:35:34,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201712080] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:35:34,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971825179] [2022-11-25 18:35:34,735 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:35:34,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:35:34,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:35:34,741 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:35:34,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 18:35:35,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:35:35,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:35:35,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 1364 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-25 18:35:35,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:35:35,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-11-25 18:35:35,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:35:40,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 2 proven. 2116 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-11-25 18:35:40,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971825179] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:35:40,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:35:40,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2022-11-25 18:35:40,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784001209] [2022-11-25 18:35:40,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:35:40,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-11-25 18:35:40,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:35:40,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-11-25 18:35:40,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-11-25 18:35:40,192 INFO L87 Difference]: Start difference. First operand 151 states and 167 transitions. Second operand has 97 states, 97 states have (on average 2.463917525773196) internal successors, (239), 97 states have internal predecessors, (239), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-11-25 18:35:40,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:35:40,822 INFO L93 Difference]: Finished difference Result 303 states and 382 transitions. [2022-11-25 18:35:40,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-11-25 18:35:40,824 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 2.463917525773196) internal successors, (239), 97 states have internal predecessors, (239), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 177 [2022-11-25 18:35:40,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:35:40,825 INFO L225 Difference]: With dead ends: 303 [2022-11-25 18:35:40,826 INFO L226 Difference]: Without dead ends: 247 [2022-11-25 18:35:40,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-11-25 18:35:40,833 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 2 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:35:40,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 562 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:35:40,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-11-25 18:35:40,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2022-11-25 18:35:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 232 states have (on average 1.043103448275862) internal successors, (242), 232 states have internal predecessors, (242), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-25 18:35:40,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 263 transitions. [2022-11-25 18:35:40,868 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 263 transitions. Word has length 177 [2022-11-25 18:35:40,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:35:40,870 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 263 transitions. [2022-11-25 18:35:40,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 2.463917525773196) internal successors, (239), 97 states have internal predecessors, (239), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-11-25 18:35:40,870 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 263 transitions. [2022-11-25 18:35:40,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-11-25 18:35:40,877 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:35:40,877 INFO L195 NwaCegarLoop]: trace histogram [94, 94, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:35:40,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 18:35:41,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:35:41,094 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:35:41,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:35:41,095 INFO L85 PathProgramCache]: Analyzing trace with hash 959518830, now seen corresponding path program 3 times [2022-11-25 18:35:41,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:35:41,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149925879] [2022-11-25 18:35:41,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:35:41,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:35:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:54,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-25 18:35:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:54,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-11-25 18:35:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:54,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-11-25 18:35:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:54,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-25 18:35:54,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:54,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-11-25 18:35:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:54,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-11-25 18:35:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:54,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-11-25 18:35:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:54,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-11-25 18:35:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:54,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-11-25 18:35:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:54,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-11-25 18:35:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:35:54,925 INFO L134 CoverageAnalysis]: Checked inductivity of 8951 backedges. 2 proven. 8836 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-11-25 18:35:54,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:35:54,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149925879] [2022-11-25 18:35:54,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149925879] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:35:54,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801594323] [2022-11-25 18:35:54,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:35:54,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:35:54,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:35:54,928 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:35:54,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 18:35:58,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-11-25 18:35:58,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:35:58,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 132 conjunts are in the unsatisfiable core [2022-11-25 18:35:58,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:35:58,278 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:35:58,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 84 [2022-11-25 18:36:03,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 79 [2022-11-25 18:36:03,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 75 [2022-11-25 18:36:07,122 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_memcpy_using_uint64_impl_~src#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_memcpy_using_uint64_harness_~#d1~0#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_int| |v_ULTIMATE.start_memcpy_using_uint64_harness_~#d1~0#1.base_BEFORE_CALL_12|) 0) (select (select |c_#memory_int| |v_ULTIMATE.start_memcpy_using_uint64_impl_~src#1.base_BEFORE_CALL_1|) 0)) (not (= |v_ULTIMATE.start_memcpy_using_uint64_impl_~src#1.base_BEFORE_CALL_1| |v_ULTIMATE.start_memcpy_using_uint64_harness_~#d1~0#1.base_BEFORE_CALL_12|)))) is different from true [2022-11-25 18:36:09,550 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_memcpy_using_uint64_impl_~src#1.base_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_memcpy_using_uint64_harness_~#d1~0#1.base_BEFORE_CALL_13| Int)) (and (not (= |v_ULTIMATE.start_memcpy_using_uint64_impl_~src#1.base_BEFORE_CALL_2| |v_ULTIMATE.start_memcpy_using_uint64_harness_~#d1~0#1.base_BEFORE_CALL_13|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_memcpy_using_uint64_impl_~src#1.base_BEFORE_CALL_2|) 0) (select (select |c_#memory_int| |v_ULTIMATE.start_memcpy_using_uint64_harness_~#d1~0#1.base_BEFORE_CALL_13|) 0)))) is different from true [2022-11-25 18:36:11,937 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_memcpy_using_uint64_harness_~#d1~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_memcpy_using_uint64_impl_~src#1.base_BEFORE_CALL_3| Int)) (and (= (select (select |c_#memory_int| |v_ULTIMATE.start_memcpy_using_uint64_harness_~#d1~0#1.base_BEFORE_CALL_14|) 0) (select (select |c_#memory_int| |v_ULTIMATE.start_memcpy_using_uint64_impl_~src#1.base_BEFORE_CALL_3|) 0)) (not (= |v_ULTIMATE.start_memcpy_using_uint64_impl_~src#1.base_BEFORE_CALL_3| |v_ULTIMATE.start_memcpy_using_uint64_harness_~#d1~0#1.base_BEFORE_CALL_14|)))) is different from true [2022-11-25 18:36:12,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:36:12,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:36:12,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2022-11-25 18:36:12,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:36:12,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:36:12,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2022-11-25 18:36:12,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:36:12,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:36:12,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2022-11-25 18:36:13,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:36:13,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:36:13,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2022-11-25 18:36:13,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:36:13,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:36:13,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2022-11-25 18:36:13,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2022-11-25 18:36:16,839 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_2| Int) (|ULTIMATE.start_memcpy_using_uint64_impl_~s~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_2|) 0))) (and (not (= |ULTIMATE.start_memcpy_using_uint64_impl_~s~0#1.base| |v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_2|)) (= (select (select |c_#memory_int| |ULTIMATE.start_memcpy_using_uint64_impl_~s~0#1.base|) 0) .cse0) (not (= |ULTIMATE.start_memcpy_using_uint64_impl_~s~0#1.base| |v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_2|)) (not (= |v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_2| |v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_2|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_2|) 0) .cse0)))) is different from true [2022-11-25 18:36:19,973 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_3| Int) (|ULTIMATE.start_memcpy_using_uint64_impl_~s~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_3|) 0))) (and (not (= |ULTIMATE.start_memcpy_using_uint64_impl_~s~0#1.base| |v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_3|)) (not (= |v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_3| 0)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_3|) 0) .cse0) (not (= |v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_3| |v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_3|)) (not (= |v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_3| 0)) (not (= |ULTIMATE.start_memcpy_using_uint64_impl_~s~0#1.base| |v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_3|)) (= (select (select |c_#memory_int| |ULTIMATE.start_memcpy_using_uint64_impl_~s~0#1.base|) 0) .cse0)))) is different from true [2022-11-25 18:36:22,757 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_4| Int) (|ULTIMATE.start_memcpy_using_uint64_impl_~s~0#1.base| Int) (|v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_int| |v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_4|) 0))) (and (not (= |v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_4| 0)) (not (= |v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_4| |v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_4|)) (not (= |v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_4| 0)) (not (= |ULTIMATE.start_memcpy_using_uint64_impl_~s~0#1.base| |v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_4|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_4|) 0) .cse0) (not (= |ULTIMATE.start_memcpy_using_uint64_impl_~s~0#1.base| |v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_4|)) (= (select (select |c_#memory_int| |ULTIMATE.start_memcpy_using_uint64_impl_~s~0#1.base|) 0) .cse0)))) is different from true [2022-11-25 18:36:32,444 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:36:32,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 47 [2022-11-25 18:36:32,894 INFO L134 CoverageAnalysis]: Checked inductivity of 8951 backedges. 55 proven. 10 refuted. 0 times theorem prover too weak. 8851 trivial. 35 not checked. [2022-11-25 18:36:32,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:36:34,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801594323] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:36:34,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:36:34,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 30] total 125 [2022-11-25 18:36:34,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966946547] [2022-11-25 18:36:34,707 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:36:34,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 125 states [2022-11-25 18:36:34,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:36:34,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2022-11-25 18:36:34,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4746, Invalid=10522, Unknown=8, NotChecked=1494, Total=16770 [2022-11-25 18:36:34,718 INFO L87 Difference]: Start difference. First operand 247 states and 263 transitions. Second operand has 125 states, 124 states have (on average 2.306451612903226) internal successors, (286), 121 states have internal predecessors, (286), 7 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-11-25 18:36:50,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:36:52,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:36:54,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:36:56,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:37:02,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:37:04,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:37:06,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:37:08,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:37:12,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:37:22,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:37:24,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:37:34,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:37:36,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:37:38,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:38:11,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:38:11,792 INFO L93 Difference]: Finished difference Result 369 states and 416 transitions. [2022-11-25 18:38:11,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-11-25 18:38:11,793 INFO L78 Accepts]: Start accepts. Automaton has has 125 states, 124 states have (on average 2.306451612903226) internal successors, (286), 121 states have internal predecessors, (286), 7 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) Word has length 273 [2022-11-25 18:38:11,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:38:11,795 INFO L225 Difference]: With dead ends: 369 [2022-11-25 18:38:11,795 INFO L226 Difference]: Without dead ends: 291 [2022-11-25 18:38:11,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 263 SyntacticMatches, 7 SemanticMatches, 239 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 10479 ImplicationChecksByTransitivity, 98.6s TimeCoverageRelationStatistics Valid=14197, Invalid=40796, Unknown=21, NotChecked=2826, Total=57840 [2022-11-25 18:38:11,817 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 210 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 55 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 2457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 973 IncrementalHoareTripleChecker+Unchecked, 31.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:38:11,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 760 Invalid, 2457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1415 Invalid, 14 Unknown, 973 Unchecked, 31.3s Time] [2022-11-25 18:38:11,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-11-25 18:38:11,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 276. [2022-11-25 18:38:11,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 257 states have (on average 1.0700389105058365) internal successors, (275), 257 states have internal predecessors, (275), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 18:38:11,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 302 transitions. [2022-11-25 18:38:11,858 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 302 transitions. Word has length 273 [2022-11-25 18:38:11,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:38:11,859 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 302 transitions. [2022-11-25 18:38:11,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 125 states, 124 states have (on average 2.306451612903226) internal successors, (286), 121 states have internal predecessors, (286), 7 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-11-25 18:38:11,860 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 302 transitions. [2022-11-25 18:38:11,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-11-25 18:38:11,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:38:11,865 INFO L195 NwaCegarLoop]: trace histogram [95, 95, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:38:11,883 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 18:38:12,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 18:38:12,078 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:38:12,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:38:12,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1376359850, now seen corresponding path program 1 times [2022-11-25 18:38:12,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:38:12,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049932247] [2022-11-25 18:38:12,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:38:12,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:38:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:38:12,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 18:38:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:38:12,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-11-25 18:38:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:38:12,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-11-25 18:38:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:38:12,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-11-25 18:38:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:38:12,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-11-25 18:38:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:38:12,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-11-25 18:38:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:38:12,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-25 18:38:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:38:12,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-11-25 18:38:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:38:12,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-11-25 18:38:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:38:12,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-11-25 18:38:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:38:12,860 INFO L134 CoverageAnalysis]: Checked inductivity of 9140 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9138 trivial. 0 not checked. [2022-11-25 18:38:12,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:38:12,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049932247] [2022-11-25 18:38:12,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049932247] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:38:12,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:38:12,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:38:12,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406248384] [2022-11-25 18:38:12,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:38:12,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:38:12,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:38:12,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:38:12,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:38:12,865 INFO L87 Difference]: Start difference. First operand 276 states and 302 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-25 18:38:12,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:38:12,963 INFO L93 Difference]: Finished difference Result 350 states and 398 transitions. [2022-11-25 18:38:12,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:38:12,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 275 [2022-11-25 18:38:12,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:38:12,968 INFO L225 Difference]: With dead ends: 350 [2022-11-25 18:38:12,969 INFO L226 Difference]: Without dead ends: 301 [2022-11-25 18:38:12,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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-25 18:38:12,970 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:38:12,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 115 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:38:12,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-11-25 18:38:13,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 300. [2022-11-25 18:38:13,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 281 states have (on average 1.0640569395017794) internal successors, (299), 281 states have internal predecessors, (299), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 18:38:13,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 326 transitions. [2022-11-25 18:38:13,018 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 326 transitions. Word has length 275 [2022-11-25 18:38:13,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:38:13,019 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 326 transitions. [2022-11-25 18:38:13,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-25 18:38:13,020 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 326 transitions. [2022-11-25 18:38:13,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-11-25 18:38:13,025 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:38:13,025 INFO L195 NwaCegarLoop]: trace histogram [95, 95, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:38:13,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:38:13,025 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:38:13,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:38:13,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1474071456, now seen corresponding path program 1 times [2022-11-25 18:38:13,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:38:13,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931344273] [2022-11-25 18:38:13,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:38:13,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:38:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:38:24,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-25 18:38:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:38:24,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-11-25 18:38:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:38:24,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-11-25 18:38:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:38:24,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-11-25 18:38:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:38:24,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-11-25 18:38:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:38:24,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-11-25 18:38:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:38:24,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-25 18:38:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:38:24,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-11-25 18:38:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:38:24,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-11-25 18:38:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:38:24,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-11-25 18:38:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:38:24,475 INFO L134 CoverageAnalysis]: Checked inductivity of 9140 backedges. 2 proven. 9025 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-11-25 18:38:24,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:38:24,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931344273] [2022-11-25 18:38:24,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931344273] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:38:24,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286382446] [2022-11-25 18:38:24,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:38:24,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:38:24,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:38:24,478 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:38:24,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 18:38:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:38:25,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 2297 conjuncts, 97 conjunts are in the unsatisfiable core [2022-11-25 18:38:25,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:38:26,042 INFO L134 CoverageAnalysis]: Checked inductivity of 9140 backedges. 0 proven. 9025 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-11-25 18:38:26,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:38:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 9140 backedges. 2 proven. 9025 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-11-25 18:38:38,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286382446] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:38:38,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:38:38,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 163 [2022-11-25 18:38:38,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342275474] [2022-11-25 18:38:38,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:38:38,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 163 states [2022-11-25 18:38:38,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:38:38,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2022-11-25 18:38:38,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2022-11-25 18:38:38,276 INFO L87 Difference]: Start difference. First operand 300 states and 326 transitions. Second operand has 163 states, 163 states have (on average 2.2883435582822087) internal successors, (373), 163 states have internal predecessors, (373), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-11-25 18:38:39,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:38:39,352 INFO L93 Difference]: Finished difference Result 537 states and 653 transitions. [2022-11-25 18:38:39,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2022-11-25 18:38:39,356 INFO L78 Accepts]: Start accepts. Automaton has has 163 states, 163 states have (on average 2.2883435582822087) internal successors, (373), 163 states have internal predecessors, (373), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 275 [2022-11-25 18:38:39,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:38:39,359 INFO L225 Difference]: With dead ends: 537 [2022-11-25 18:38:39,359 INFO L226 Difference]: Without dead ends: 430 [2022-11-25 18:38:39,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 473 SyntacticMatches, 32 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2924 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2022-11-25 18:38:39,364 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 1 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:38:39,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 492 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 18:38:39,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-11-25 18:38:39,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2022-11-25 18:38:39,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 411 states have (on average 1.0437956204379562) internal successors, (429), 411 states have internal predecessors, (429), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 18:38:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 456 transitions. [2022-11-25 18:38:39,419 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 456 transitions. Word has length 275 [2022-11-25 18:38:39,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:38:39,419 INFO L495 AbstractCegarLoop]: Abstraction has 430 states and 456 transitions. [2022-11-25 18:38:39,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 163 states, 163 states have (on average 2.2883435582822087) internal successors, (373), 163 states have internal predecessors, (373), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-11-25 18:38:39,420 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 456 transitions. [2022-11-25 18:38:39,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2022-11-25 18:38:39,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:38:39,441 INFO L195 NwaCegarLoop]: trace histogram [160, 160, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:38:39,452 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-25 18:38:39,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 18:38:39,652 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:38:39,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:38:39,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1880722594, now seen corresponding path program 2 times [2022-11-25 18:38:39,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:38:39,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072276327] [2022-11-25 18:38:39,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:38:39,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:38:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:38:46,255 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 18:38:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:38:51,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 18:38:51,447 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 18:38:51,448 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 18:38:51,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 18:38:51,455 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1] [2022-11-25 18:38:51,462 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:38:51,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:38:51 BoogieIcfgContainer [2022-11-25 18:38:51,726 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:38:51,726 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:38:51,726 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:38:51,727 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:38:51,727 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:35:10" (3/4) ... [2022-11-25 18:38:51,731 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 18:38:51,731 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:38:51,732 INFO L158 Benchmark]: Toolchain (without parser) took 224418.28ms. Allocated memory was 130.0MB in the beginning and 966.8MB in the end (delta: 836.8MB). Free memory was 80.3MB in the beginning and 508.6MB in the end (delta: -428.3MB). Peak memory consumption was 409.8MB. Max. memory is 16.1GB. [2022-11-25 18:38:51,732 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 100.7MB. Free memory is still 50.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:38:51,734 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2277.56ms. Allocated memory was 130.0MB in the beginning and 180.4MB in the end (delta: 50.3MB). Free memory was 80.0MB in the beginning and 104.9MB in the end (delta: -24.9MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. [2022-11-25 18:38:51,734 INFO L158 Benchmark]: Boogie Procedure Inliner took 201.51ms. Allocated memory is still 180.4MB. Free memory was 104.9MB in the beginning and 99.9MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-25 18:38:51,735 INFO L158 Benchmark]: Boogie Preprocessor took 83.91ms. Allocated memory is still 180.4MB. Free memory was 99.9MB in the beginning and 97.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:38:51,736 INFO L158 Benchmark]: RCFGBuilder took 1003.40ms. Allocated memory is still 180.4MB. Free memory was 97.0MB in the beginning and 131.1MB in the end (delta: -34.1MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2022-11-25 18:38:51,740 INFO L158 Benchmark]: TraceAbstraction took 220833.08ms. Allocated memory was 180.4MB in the beginning and 966.8MB in the end (delta: 786.4MB). Free memory was 130.0MB in the beginning and 509.7MB in the end (delta: -379.7MB). Peak memory consumption was 590.3MB. Max. memory is 16.1GB. [2022-11-25 18:38:51,740 INFO L158 Benchmark]: Witness Printer took 5.18ms. Allocated memory is still 966.8MB. Free memory was 509.7MB in the beginning and 508.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:38:51,748 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.36ms. Allocated memory is still 100.7MB. Free memory is still 50.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2277.56ms. Allocated memory was 130.0MB in the beginning and 180.4MB in the end (delta: 50.3MB). Free memory was 80.0MB in the beginning and 104.9MB in the end (delta: -24.9MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 201.51ms. Allocated memory is still 180.4MB. Free memory was 104.9MB in the beginning and 99.9MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.91ms. Allocated memory is still 180.4MB. Free memory was 99.9MB in the beginning and 97.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1003.40ms. Allocated memory is still 180.4MB. Free memory was 97.0MB in the beginning and 131.1MB in the end (delta: -34.1MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * TraceAbstraction took 220833.08ms. Allocated memory was 180.4MB in the beginning and 966.8MB in the end (delta: 786.4MB). Free memory was 130.0MB in the beginning and 509.7MB in the end (delta: -379.7MB). Peak memory consumption was 590.3MB. Max. memory is 16.1GB. * Witness Printer took 5.18ms. Allocated memory is still 966.8MB. Free memory was 509.7MB in the beginning and 508.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 - UnprovableResult [Line: 224]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 5890. Possible FailurePath: [L5944] CALL memcpy_using_uint64_harness() [L5931] char s[160]; [L5932] char d1[160]; [L5933] char d2[160]; [L5934] int i = 0; VAL [d1={161:0}, d2={163:0}, i=0, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=1, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=2, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=3, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=4, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=5, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=6, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=7, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=8, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=9, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=10, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=11, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=12, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=13, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=14, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=15, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=16, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=17, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=18, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=19, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=20, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=21, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=22, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=23, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=24, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=25, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=26, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=27, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=28, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=29, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=30, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=31, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=32, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=33, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=34, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=35, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=36, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=37, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=38, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=39, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=40, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=41, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=42, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=43, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=44, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=45, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=46, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=47, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=48, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=49, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=50, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=51, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=52, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=53, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=54, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=55, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=56, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=57, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=58, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=59, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=60, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=61, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=62, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=63, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=64, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=65, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=66, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=67, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=68, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=69, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=70, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=71, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=72, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=73, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=74, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=75, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=76, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=77, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=78, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=79, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=80, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=81, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=82, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=83, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=84, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=85, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=86, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=87, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=88, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=89, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=90, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=91, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=92, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=93, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=94, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=95, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=96, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=97, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=98, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=99, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=100, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=101, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=102, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=103, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=104, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=105, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=106, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=107, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=108, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=109, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=110, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=111, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=112, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=113, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=114, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=115, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=116, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=117, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=118, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=119, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=120, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=121, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=122, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=123, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=124, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=125, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=126, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=127, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=128, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=129, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=130, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=131, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=132, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=133, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=134, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=135, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=136, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=137, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=138, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=139, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=140, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=141, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=142, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=143, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=144, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=145, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=146, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=147, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=148, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=149, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=150, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=151, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=152, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=153, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=154, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=155, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=156, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=157, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=158, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=159, s={162:0}] [L5934] COND TRUE i < 160 [L5935] s[i] = __VERIFIER_nondet_char() [L5934] i++ VAL [d1={161:0}, d2={163:0}, i=160, s={162:0}] [L5934] COND FALSE !(i < 160) VAL [d1={161:0}, d2={163:0}, i=160, s={162:0}] [L5938] unsigned size = __VERIFIER_nondet_uint(); [L5939] CALL assume_abort_if_not(size < 160) VAL [\old(cond)=1] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L5939] RET assume_abort_if_not(size < 160) VAL [d1={161:0}, d2={163:0}, i=160, s={162:0}, size=1] [L5940] CALL memcpy_impl(d1, s, size) [L5867] CALL assume_abort_if_not(dst != src || ((const char *)src >= (const char *)dst + n) || ((const char *)dst >= (const char *)src + n)) VAL [\old(cond)=1] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L5867] RET assume_abort_if_not(dst != src || ((const char *)src >= (const char *)dst + n) || ((const char *)dst >= (const char *)src + n)) VAL [dst={161:0}, n=1, src={162:0}] [L5871] CALL assume_abort_if_not((((n) == 0) || (src))) VAL [\old(cond)=1] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L5871] RET assume_abort_if_not((((n) == 0) || (src))) VAL [dst={161:0}, n=1, src={162:0}] [L5872] CALL assume_abort_if_not((((n) == 0) || (dst))) VAL [\old(cond)=1] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L5872] RET assume_abort_if_not((((n) == 0) || (dst))) VAL [dst={161:0}, n=1, src={162:0}] [L5874] unsigned long i = 0; VAL [dst={161:0}, i=0, n=1, src={162:0}] [L5874] COND TRUE i < n [L5875] EXPR ((const char *)src)[i] [L5875] ((char *)dst)[i] = ((const char *)src)[i] [L5874] ++i VAL [dst={161:0}, i=1, n=1, src={162:0}] [L5874] COND FALSE !(i < n) VAL [dst={161:0}, i=1, n=1, src={162:0}] [L5877] return dst; VAL [dst={161:0}, i=1, n=1, src={162:0}] [L5940] RET memcpy_impl(d1, s, size) [L5941] CALL memcpy_using_uint64_impl(d2, s, size) [L5882] CALL assume_abort_if_not(dst != src || ((const char *)src >= (const char *)dst + n) || ((const char *)dst >= (const char *)src + n)) VAL [\old(cond)=1] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L5882] RET assume_abort_if_not(dst != src || ((const char *)src >= (const char *)dst + n) || ((const char *)dst >= (const char *)src + n)) VAL [dst={163:0}, n=1, src={162:0}] [L5886] CALL assume_abort_if_not((((n) == 0) || (src))) VAL [\old(cond)=1] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L5886] RET assume_abort_if_not((((n) == 0) || (src))) VAL [dst={163:0}, n=1, src={162:0}] [L5887] CALL assume_abort_if_not((((n) == 0) || (dst))) VAL [\old(cond)=1] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L5887] RET assume_abort_if_not((((n) == 0) || (dst))) VAL [dst={163:0}, n=1, src={162:0}] [L5889] size_t num_uint64s = n >> 3; [L5890] size_t rem = n & 0x7; [L5892] uint8_t *d = (uint8_t *)dst; [L5893] const uint8_t *s = (const uint8_t *)src; [L5897] case 7: VAL [d={163:0}, dst={163:0}, n=1, num_uint64s=0, rem=8, s={162:0}, src={162:0}] [L5899] case 6: VAL [d={163:0}, dst={163:0}, n=1, num_uint64s=0, rem=8, s={162:0}, src={162:0}] [L5901] case 5: VAL [d={163:0}, dst={163:0}, n=1, num_uint64s=0, rem=8, s={162:0}, src={162:0}] [L5903] case 4: VAL [d={163:0}, dst={163:0}, n=1, num_uint64s=0, rem=8, s={162:0}, src={162:0}] [L5905] case 3: VAL [d={163:0}, dst={163:0}, n=1, num_uint64s=0, rem=8, s={162:0}, src={162:0}] [L5907] case 2: VAL [d={163:0}, dst={163:0}, n=1, num_uint64s=0, rem=8, s={162:0}, src={162:0}] [L5909] case 1: VAL [d={163:0}, dst={163:0}, n=1, num_uint64s=0, rem=8, s={162:0}, src={162:0}] [L5913] d += rem [L5914] s += rem [L5916] size_t i = 0; VAL [d={163:8}, dst={163:0}, i=0, n=1, num_uint64s=0, rem=8, s={162:8}, src={162:0}] [L5916] COND FALSE !(i < num_uint64s) VAL [d={163:8}, dst={163:0}, i=0, n=1, num_uint64s=0, rem=8, s={162:8}, src={162:0}] [L5920] return dst; VAL [d={163:8}, dst={163:0}, i=0, n=1, num_uint64s=0, rem=8, s={162:8}, src={162:0}] [L5941] RET memcpy_using_uint64_impl(d2, s, size) [L5942] CALL assert_bytes_match(d1, d2, size) [L5655] CALL __VERIFIER_assert(!a == !b) VAL [\old(cond)=1] [L224] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L5655] RET __VERIFIER_assert(!a == !b) VAL [\old(len)=1, a={161:0}, a={161:0}, b={163:0}, b={163:0}, len=1] [L5656-L5659] COND TRUE len > 0 && a != ((void *)0) && b != ((void *)0) VAL [\old(len)=1, a={161:0}, a={161:0}, b={163:0}, b={163:0}, len=1] [L5661] CALL, EXPR nondet_uint64_t() [L267] return __VERIFIER_nondet_ulong(); [L5661] RET, EXPR nondet_uint64_t() VAL [\old(len)=1, a={161:0}, a={161:0}, b={163:0}, b={163:0}, len=1, nondet_uint64_t()=18446744073709551616] [L5661] size_t i = nondet_uint64_t(); [L5662-L5664] CALL assume_abort_if_not(i < len && len < ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L5662-L5664] RET assume_abort_if_not(i < len && len < ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(len)=1, a={161:0}, a={161:0}, b={163:0}, b={163:0}, i=0, len=1] [L5665] EXPR a[i] [L5665] EXPR b[i] VAL [\old(len)=1, a={161:0}, a={161:0}, a[i]=0, b={163:0}, b={163:0}, b[i]=164, i=0, len=1] [L5665] CALL __VERIFIER_assert(a[i] == b[i]) VAL [\old(cond)=0] [L224] COND TRUE !cond VAL [\old(cond)=0, cond=0] [L224] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 220.5s, OverallIterations: 13, TraceHistogramMax: 160, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 100.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 14 mSolverCounterUnknown, 459 SdHoareTripleChecker+Valid, 33.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 446 mSDsluCounter, 4204 SdHoareTripleChecker+Invalid, 32.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 973 IncrementalHoareTripleChecker+Unchecked, 3357 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2419 IncrementalHoareTripleChecker+Invalid, 3521 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 847 mSDtfsCounter, 2419 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2830 GetRequests, 2159 SyntacticMatches, 39 SemanticMatches, 632 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 13956 ImplicationChecksByTransitivity, 124.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=430occurred in iteration=12, InterpolantAutomatonStates: 500, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 18 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 14.5s SatisfiabilityAnalysisTime, 93.2s InterpolantComputationTime, 3446 NumberOfCodeBlocks, 3178 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3857 ConstructedInterpolants, 33 QuantifiedInterpolants, 14071 SizeOfPredicates, 74 NumberOfNonLiveVariables, 7162 ConjunctsInSsa, 369 ConjunctsInUnsatCore, 27 InterpolantComputations, 5 PerfectInterpolantSequences, 21196/65803 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 could not prove your program: unable to determine feasibility of some traces [2022-11-25 18:38:51,870 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/memcpy_using_uint64_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R --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 Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d67b4b463cf9b59771b705723a66a102d698cbc5859334aa26ed48a8838f7285 --- 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-25 18:38:54,646 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:38:54,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:38:54,677 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:38:54,677 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:38:54,679 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:38:54,681 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:38:54,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:38:54,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:38:54,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:38:54,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:38:54,691 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:38:54,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:38:54,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:38:54,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:38:54,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:38:54,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:38:54,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:38:54,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:38:54,704 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:38:54,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:38:54,708 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:38:54,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:38:54,711 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:38:54,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:38:54,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:38:54,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:38:54,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:38:54,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:38:54,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:38:54,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:38:54,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:38:54,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:38:54,737 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:38:54,738 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:38:54,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:38:54,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:38:54,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:38:54,741 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:38:54,742 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:38:54,744 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:38:54,749 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-25 18:38:54,803 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:38:54,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:38:54,804 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:38:54,804 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:38:54,805 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:38:54,806 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:38:54,807 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:38:54,807 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:38:54,807 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:38:54,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:38:54,808 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:38:54,808 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:38:54,809 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:38:54,809 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:38:54,809 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 18:38:54,810 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 18:38:54,810 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 18:38:54,810 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:38:54,810 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:38:54,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:38:54,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:38:54,811 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:38:54,812 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:38:54,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:38:54,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:38:54,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:38:54,813 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:38:54,813 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 18:38:54,814 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 18:38:54,814 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:38:54,814 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:38:54,815 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:38:54,815 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:38:54,815 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 18:38:54,815 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/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_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d67b4b463cf9b59771b705723a66a102d698cbc5859334aa26ed48a8838f7285 [2022-11-25 18:38:55,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:38:55,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:38:55,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:38:55,319 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:38:55,319 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:38:55,321 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/aws-c-common/memcpy_using_uint64_harness.i [2022-11-25 18:38:58,958 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:38:59,498 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:38:59,499 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/sv-benchmarks/c/aws-c-common/memcpy_using_uint64_harness.i [2022-11-25 18:38:59,532 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/data/652e63fd7/99e52204062a44739ea47a6deec65eca/FLAGb99f9b3a3 [2022-11-25 18:38:59,550 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/data/652e63fd7/99e52204062a44739ea47a6deec65eca [2022-11-25 18:38:59,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:38:59,555 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:38:59,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:38:59,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:38:59,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:38:59,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:38:59" (1/1) ... [2022-11-25 18:38:59,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7727ce76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:38:59, skipping insertion in model container [2022-11-25 18:38:59,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:38:59" (1/1) ... [2022-11-25 18:38:59,573 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:38:59,741 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:39:00,130 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_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/sv-benchmarks/c/aws-c-common/memcpy_using_uint64_harness.i[4531,4544] [2022-11-25 18:39:00,142 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_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/sv-benchmarks/c/aws-c-common/memcpy_using_uint64_harness.i[4591,4604] [2022-11-25 18:39:01,456 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:01,457 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:01,458 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:01,459 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:01,460 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:01,478 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:01,479 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:01,483 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:01,486 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:01,490 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:01,492 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:01,496 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:01,496 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:01,591 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:39:01,591 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:39:01,592 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:39:01,617 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 18:39:01,620 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 18:39:01,626 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 18:39:01,801 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 18:39:01,802 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 18:39:01,803 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 18:39:01,805 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 18:39:01,806 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 18:39:01,808 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 18:39:01,808 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 18:39:01,809 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 18:39:01,810 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 18:39:01,811 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 18:39:01,812 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 18:39:01,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:39:01,974 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-25 18:39:02,015 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:39:02,044 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_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/sv-benchmarks/c/aws-c-common/memcpy_using_uint64_harness.i[4531,4544] [2022-11-25 18:39:02,045 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_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/sv-benchmarks/c/aws-c-common/memcpy_using_uint64_harness.i[4591,4604] [2022-11-25 18:39:02,130 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:02,130 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:02,131 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:02,132 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:02,133 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:02,157 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:02,158 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:02,159 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:02,160 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:02,161 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:02,162 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:02,165 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:02,165 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:02,195 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:39:02,195 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:39:02,196 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:39:02,213 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 18:39:02,218 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 18:39:02,222 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 18:39:02,230 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 18:39:02,238 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 18:39:02,239 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 18:39:02,241 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 18:39:02,243 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 18:39:02,249 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 18:39:02,250 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 18:39:02,251 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 18:39:02,252 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 18:39:02,253 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 18:39:02,255 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 18:39:02,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:39:02,318 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:39:02,341 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_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/sv-benchmarks/c/aws-c-common/memcpy_using_uint64_harness.i[4531,4544] [2022-11-25 18:39:02,341 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_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/sv-benchmarks/c/aws-c-common/memcpy_using_uint64_harness.i[4591,4604] [2022-11-25 18:39:02,440 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:02,441 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:02,442 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:02,444 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:02,447 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:02,454 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:02,460 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:02,461 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:02,462 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:02,463 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:02,465 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:02,467 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:02,467 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:39:02,482 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:39:02,482 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:39:02,483 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:39:02,488 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 18:39:02,490 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 18:39:02,491 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 18:39:02,506 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 18:39:02,507 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 18:39:02,508 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 18:39:02,510 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 18:39:02,511 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 18:39:02,513 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 18:39:02,513 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 18:39:02,514 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 18:39:02,515 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 18:39:02,516 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 18:39:02,517 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 18:39:02,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:39:02,802 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:39:02,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:39:02 WrapperNode [2022-11-25 18:39:02,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:39:02,805 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:39:02,805 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:39:02,805 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:39:02,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:39:02" (1/1) ... [2022-11-25 18:39:02,904 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:39:02" (1/1) ... [2022-11-25 18:39:02,946 INFO L138 Inliner]: procedures = 612, calls = 626, calls flagged for inlining = 39, calls inlined = 6, statements flattened = 136 [2022-11-25 18:39:02,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:39:02,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:39:02,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:39:02,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:39:02,960 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:39:02" (1/1) ... [2022-11-25 18:39:02,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:39:02" (1/1) ... [2022-11-25 18:39:02,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:39:02" (1/1) ... [2022-11-25 18:39:02,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:39:02" (1/1) ... [2022-11-25 18:39:02,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:39:02" (1/1) ... [2022-11-25 18:39:02,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:39:02" (1/1) ... [2022-11-25 18:39:03,000 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:39:02" (1/1) ... [2022-11-25 18:39:03,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:39:02" (1/1) ... [2022-11-25 18:39:03,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:39:03,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:39:03,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:39:03,010 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:39:03,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:39:02" (1/1) ... [2022-11-25 18:39:03,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:39:03,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:39:03,065 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:39:03,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:39:03,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:39:03,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 18:39:03,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 18:39:03,121 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 18:39:03,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:39:03,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:39:03,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:39:03,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-25 18:39:03,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-11-25 18:39:03,122 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 18:39:03,123 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 18:39:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:39:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-11-25 18:39:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-11-25 18:39:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-25 18:39:03,124 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-25 18:39:03,545 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:39:03,548 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:39:04,072 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:39:04,080 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:39:04,080 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-25 18:39:04,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:39:04 BoogieIcfgContainer [2022-11-25 18:39:04,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:39:04,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:39:04,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:39:04,091 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:39:04,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:38:59" (1/3) ... [2022-11-25 18:39:04,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a6efd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:39:04, skipping insertion in model container [2022-11-25 18:39:04,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:39:02" (2/3) ... [2022-11-25 18:39:04,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a6efd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:39:04, skipping insertion in model container [2022-11-25 18:39:04,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:39:04" (3/3) ... [2022-11-25 18:39:04,096 INFO L112 eAbstractionObserver]: Analyzing ICFG memcpy_using_uint64_harness.i [2022-11-25 18:39:04,120 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:39:04,121 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 18:39:04,184 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:39:04,194 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=PETRI_NET, 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;@670cd18f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:39:04,195 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 18:39:04,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 48 states have internal predecessors, (64), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 18:39:04,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-25 18:39:04,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:39:04,225 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:39:04,226 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:39:04,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:39:04,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1463681059, now seen corresponding path program 1 times [2022-11-25 18:39:04,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:39:04,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1933658252] [2022-11-25 18:39:04,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:39:04,259 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:39:04,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:39:04,262 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:39:04,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 18:39:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:39:04,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 18:39:04,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:39:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-11-25 18:39:04,763 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:39:04,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:39:04,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1933658252] [2022-11-25 18:39:04,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1933658252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:39:04,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:39:04,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:39:04,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198766729] [2022-11-25 18:39:04,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:39:04,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:39:04,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:39:04,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:39:04,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:39:04,831 INFO L87 Difference]: Start difference. First operand has 63 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 48 states have internal predecessors, (64), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 18:39:04,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:39:04,864 INFO L93 Difference]: Finished difference Result 122 states and 176 transitions. [2022-11-25 18:39:04,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:39:04,867 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-11-25 18:39:04,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:39:04,877 INFO L225 Difference]: With dead ends: 122 [2022-11-25 18:39:04,878 INFO L226 Difference]: Without dead ends: 57 [2022-11-25 18:39:04,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:39:04,886 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:39:04,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:39:04,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-25 18:39:04,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-11-25 18:39:04,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 43 states have internal predecessors, (53), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-25 18:39:04,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2022-11-25 18:39:04,940 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 66 [2022-11-25 18:39:04,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:39:04,941 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2022-11-25 18:39:04,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 18:39:04,942 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2022-11-25 18:39:04,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-25 18:39:04,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:39:04,945 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:39:04,964 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-25 18:39:05,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:39:05,157 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:39:05,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:39:05,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1147031271, now seen corresponding path program 1 times [2022-11-25 18:39:05,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:39:05,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1158482443] [2022-11-25 18:39:05,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:39:05,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:39:05,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:39:05,162 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:39:05,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 18:39:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:39:05,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 18:39:05,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:39:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-25 18:39:05,607 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:39:05,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:39:05,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1158482443] [2022-11-25 18:39:05,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1158482443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:39:05,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:39:05,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:39:05,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413006437] [2022-11-25 18:39:05,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:39:05,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:39:05,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:39:05,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:39:05,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:39:05,613 INFO L87 Difference]: Start difference. First operand 57 states and 74 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-25 18:39:05,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:39:05,653 INFO L93 Difference]: Finished difference Result 112 states and 146 transitions. [2022-11-25 18:39:05,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:39:05,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 66 [2022-11-25 18:39:05,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:39:05,656 INFO L225 Difference]: With dead ends: 112 [2022-11-25 18:39:05,657 INFO L226 Difference]: Without dead ends: 59 [2022-11-25 18:39:05,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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-25 18:39:05,659 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:39:05,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 142 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:39:05,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-25 18:39:05,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-11-25 18:39:05,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 43 states have (on average 1.255813953488372) internal successors, (54), 44 states have internal predecessors, (54), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-25 18:39:05,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2022-11-25 18:39:05,673 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 66 [2022-11-25 18:39:05,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:39:05,674 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2022-11-25 18:39:05,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-25 18:39:05,675 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2022-11-25 18:39:05,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-25 18:39:05,677 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:39:05,677 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:39:05,700 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:39:05,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:39:05,892 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:39:05,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:39:05,893 INFO L85 PathProgramCache]: Analyzing trace with hash 824593321, now seen corresponding path program 1 times [2022-11-25 18:39:05,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:39:05,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670998113] [2022-11-25 18:39:05,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:39:05,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:39:05,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:39:05,897 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:39:05,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 18:39:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:39:06,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 18:39:06,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:39:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-25 18:39:06,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:39:06,329 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-25 18:39:06,330 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:39:06,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1670998113] [2022-11-25 18:39:06,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1670998113] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:39:06,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:39:06,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-11-25 18:39:06,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197558614] [2022-11-25 18:39:06,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:39:06,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:39:06,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:39:06,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:39:06,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:39:06,334 INFO L87 Difference]: Start difference. First operand 58 states and 75 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-11-25 18:39:06,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:39:06,448 INFO L93 Difference]: Finished difference Result 117 states and 153 transitions. [2022-11-25 18:39:06,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:39:06,449 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 68 [2022-11-25 18:39:06,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:39:06,450 INFO L225 Difference]: With dead ends: 117 [2022-11-25 18:39:06,451 INFO L226 Difference]: Without dead ends: 64 [2022-11-25 18:39:06,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:39:06,453 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 3 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:39:06,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 282 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:39:06,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-25 18:39:06,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-25 18:39:06,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 50 states have internal predecessors, (60), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-25 18:39:06,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2022-11-25 18:39:06,492 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 68 [2022-11-25 18:39:06,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:39:06,492 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2022-11-25 18:39:06,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-11-25 18:39:06,493 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-11-25 18:39:06,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-25 18:39:06,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:39:06,495 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:39:06,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:39:06,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:39:06,716 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:39:06,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:39:06,716 INFO L85 PathProgramCache]: Analyzing trace with hash -615657745, now seen corresponding path program 2 times [2022-11-25 18:39:06,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:39:06,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [295609060] [2022-11-25 18:39:06,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:39:06,718 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:39:06,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:39:06,722 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:39:06,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 18:39:07,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 18:39:07,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:39:07,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 18:39:07,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:39:07,596 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-25 18:39:07,597 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:39:07,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:39:07,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [295609060] [2022-11-25 18:39:07,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [295609060] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:39:07,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:39:07,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:39:07,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414718053] [2022-11-25 18:39:07,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:39:07,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:39:07,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:39:07,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:39:07,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:39:07,610 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-25 18:39:07,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:39:07,785 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2022-11-25 18:39:07,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:39:07,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 74 [2022-11-25 18:39:07,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:39:07,788 INFO L225 Difference]: With dead ends: 70 [2022-11-25 18:39:07,788 INFO L226 Difference]: Without dead ends: 66 [2022-11-25 18:39:07,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:39:07,789 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 23 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:39:07,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 276 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:39:07,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-25 18:39:07,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-11-25 18:39:07,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 states have internal predecessors, (61), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-25 18:39:07,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2022-11-25 18:39:07,804 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 74 [2022-11-25 18:39:07,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:39:07,806 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2022-11-25 18:39:07,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-25 18:39:07,807 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2022-11-25 18:39:07,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-25 18:39:07,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:39:07,809 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:39:07,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:39:08,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:39:08,028 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:39:08,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:39:08,029 INFO L85 PathProgramCache]: Analyzing trace with hash -694003548, now seen corresponding path program 1 times [2022-11-25 18:39:08,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:39:08,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564226175] [2022-11-25 18:39:08,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:39:08,030 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:39:08,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:39:08,031 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:39:08,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 18:39:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:39:08,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 18:39:08,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:39:08,492 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-11-25 18:39:08,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:39:08,754 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-25 18:39:08,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:39:08,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564226175] [2022-11-25 18:39:08,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564226175] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:39:08,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:39:08,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-11-25 18:39:08,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231209679] [2022-11-25 18:39:08,756 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:39:08,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:39:08,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:39:08,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:39:08,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:39:08,759 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-11-25 18:39:09,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:39:09,310 INFO L93 Difference]: Finished difference Result 133 states and 170 transitions. [2022-11-25 18:39:09,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 18:39:09,312 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 91 [2022-11-25 18:39:09,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:39:09,313 INFO L225 Difference]: With dead ends: 133 [2022-11-25 18:39:09,313 INFO L226 Difference]: Without dead ends: 78 [2022-11-25 18:39:09,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2022-11-25 18:39:09,315 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 7 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:39:09,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 422 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 18:39:09,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-25 18:39:09,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-25 18:39:09,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 63 states have internal predecessors, (73), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-25 18:39:09,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2022-11-25 18:39:09,334 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 91 [2022-11-25 18:39:09,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:39:09,335 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2022-11-25 18:39:09,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-11-25 18:39:09,336 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2022-11-25 18:39:09,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-25 18:39:09,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:39:09,338 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:39:09,365 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-25 18:39:09,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:39:09,553 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:39:09,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:39:09,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1419325160, now seen corresponding path program 2 times [2022-11-25 18:39:09,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:39:09,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728662151] [2022-11-25 18:39:09,555 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:39:09,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:39:09,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:39:09,557 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:39:09,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-25 18:39:09,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:39:09,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:39:09,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 18:39:10,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:39:10,219 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-11-25 18:39:10,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:39:10,964 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 2 proven. 100 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-25 18:39:10,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:39:10,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728662151] [2022-11-25 18:39:10,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728662151] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:39:10,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:39:10,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-11-25 18:39:10,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274888709] [2022-11-25 18:39:10,966 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:39:10,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-25 18:39:10,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:39:10,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-25 18:39:10,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2022-11-25 18:39:10,968 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand has 24 states, 24 states have (on average 3.75) internal successors, (90), 24 states have internal predecessors, (90), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-11-25 18:39:13,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:39:13,100 INFO L93 Difference]: Finished difference Result 157 states and 200 transitions. [2022-11-25 18:39:13,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 18:39:13,102 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.75) internal successors, (90), 24 states have internal predecessors, (90), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 103 [2022-11-25 18:39:13,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:39:13,108 INFO L225 Difference]: With dead ends: 157 [2022-11-25 18:39:13,110 INFO L226 Difference]: Without dead ends: 102 [2022-11-25 18:39:13,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2022-11-25 18:39:13,113 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 13 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:39:13,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 842 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 18:39:13,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-25 18:39:13,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-11-25 18:39:13,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 87 states have (on average 1.1149425287356323) internal successors, (97), 87 states have internal predecessors, (97), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-25 18:39:13,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2022-11-25 18:39:13,154 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 103 [2022-11-25 18:39:13,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:39:13,154 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2022-11-25 18:39:13,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.75) internal successors, (90), 24 states have internal predecessors, (90), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-11-25 18:39:13,159 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2022-11-25 18:39:13,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-25 18:39:13,161 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:39:13,162 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:39:13,198 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-25 18:39:13,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:39:13,389 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:39:13,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:39:13,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1263900672, now seen corresponding path program 3 times [2022-11-25 18:39:13,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:39:13,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283107183] [2022-11-25 18:39:13,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:39:13,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:39:13,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:39:13,392 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:39:13,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-25 18:39:14,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-25 18:39:14,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:39:14,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 18:39:14,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:39:14,676 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 28 proven. 18 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2022-11-25 18:39:14,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:39:15,130 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2022-11-25 18:39:15,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:39:15,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283107183] [2022-11-25 18:39:15,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [283107183] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 18:39:15,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:39:15,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 18 [2022-11-25 18:39:15,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192137054] [2022-11-25 18:39:15,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:39:15,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:39:15,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:39:15,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:39:15,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-11-25 18:39:15,133 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-25 18:39:16,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:39:16,100 INFO L93 Difference]: Finished difference Result 186 states and 223 transitions. [2022-11-25 18:39:16,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:39:16,101 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 127 [2022-11-25 18:39:16,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:39:16,103 INFO L225 Difference]: With dead ends: 186 [2022-11-25 18:39:16,103 INFO L226 Difference]: Without dead ends: 149 [2022-11-25 18:39:16,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2022-11-25 18:39:16,107 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 135 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:39:16,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 428 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 18:39:16,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-25 18:39:16,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 112. [2022-11-25 18:39:16,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.127659574468085) internal successors, (106), 94 states have internal predecessors, (106), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 18:39:16,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2022-11-25 18:39:16,134 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 127 [2022-11-25 18:39:16,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:39:16,135 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2022-11-25 18:39:16,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-25 18:39:16,135 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2022-11-25 18:39:16,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-25 18:39:16,138 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:39:16,138 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:39:16,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 18:39:16,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:39:16,339 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:39:16,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:39:16,340 INFO L85 PathProgramCache]: Analyzing trace with hash 869533886, now seen corresponding path program 1 times [2022-11-25 18:39:16,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:39:16,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179358157] [2022-11-25 18:39:16,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:39:16,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:39:16,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:39:16,342 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:39:16,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 18:39:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:39:16,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-25 18:39:16,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:39:17,487 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-11-25 18:39:17,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:39:19,861 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 2 proven. 484 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-25 18:39:19,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:39:19,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179358157] [2022-11-25 18:39:19,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179358157] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:39:19,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:39:19,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2022-11-25 18:39:19,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518040486] [2022-11-25 18:39:19,862 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:39:19,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-25 18:39:19,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:39:19,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-25 18:39:19,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2022-11-25 18:39:19,866 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand has 48 states, 48 states have (on average 2.875) internal successors, (138), 48 states have internal predecessors, (138), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-11-25 18:39:31,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:39:31,181 INFO L93 Difference]: Finished difference Result 225 states and 290 transitions. [2022-11-25 18:39:31,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-25 18:39:31,183 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.875) internal successors, (138), 48 states have internal predecessors, (138), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2022-11-25 18:39:31,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:39:31,184 INFO L225 Difference]: With dead ends: 225 [2022-11-25 18:39:31,184 INFO L226 Difference]: Without dead ends: 160 [2022-11-25 18:39:31,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2022-11-25 18:39:31,187 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 25 mSDsluCounter, 1750 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1822 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:39:31,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1822 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-11-25 18:39:31,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-25 18:39:31,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-11-25 18:39:31,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 142 states have (on average 1.0845070422535212) internal successors, (154), 142 states have internal predecessors, (154), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 18:39:31,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 181 transitions. [2022-11-25 18:39:31,215 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 181 transitions. Word has length 127 [2022-11-25 18:39:31,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:39:31,215 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 181 transitions. [2022-11-25 18:39:31,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.875) internal successors, (138), 48 states have internal predecessors, (138), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-11-25 18:39:31,216 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 181 transitions. [2022-11-25 18:39:31,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-11-25 18:39:31,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:39:31,219 INFO L195 NwaCegarLoop]: trace histogram [46, 46, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:39:31,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-25 18:39:31,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:39:31,443 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:39:31,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:39:31,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1591013006, now seen corresponding path program 2 times [2022-11-25 18:39:31,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:39:31,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517865522] [2022-11-25 18:39:31,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:39:31,445 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:39:31,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:39:31,446 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:39:31,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-25 18:39:32,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:39:32,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:39:32,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-25 18:39:32,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:39:34,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2230 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-11-25 18:39:34,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:39:44,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2230 backedges. 2 proven. 2116 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-25 18:39:44,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:39:44,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517865522] [2022-11-25 18:39:44,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1517865522] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:39:44,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:39:44,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 96 [2022-11-25 18:39:44,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340529286] [2022-11-25 18:39:44,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:39:44,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-11-25 18:39:44,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:39:44,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-11-25 18:39:44,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2398, Invalid=6722, Unknown=0, NotChecked=0, Total=9120 [2022-11-25 18:39:44,145 INFO L87 Difference]: Start difference. First operand 160 states and 181 transitions. Second operand has 96 states, 96 states have (on average 2.4375) internal successors, (234), 96 states have internal predecessors, (234), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-11-25 18:40:52,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:40:52,736 INFO L93 Difference]: Finished difference Result 321 states and 410 transitions. [2022-11-25 18:40:52,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-11-25 18:40:52,738 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 2.4375) internal successors, (234), 96 states have internal predecessors, (234), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 175 [2022-11-25 18:40:52,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:40:52,740 INFO L225 Difference]: With dead ends: 321 [2022-11-25 18:40:52,740 INFO L226 Difference]: Without dead ends: 256 [2022-11-25 18:40:52,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 67.1s TimeCoverageRelationStatistics Valid=6814, Invalid=13208, Unknown=0, NotChecked=0, Total=20022 [2022-11-25 18:40:52,747 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 48 mSDsluCounter, 3360 mSDsCounter, 0 mSdLazyCounter, 4606 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3432 SdHoareTripleChecker+Invalid, 4608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:40:52,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3432 Invalid, 4608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4606 Invalid, 0 Unknown, 0 Unchecked, 12.5s Time] [2022-11-25 18:40:52,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-11-25 18:40:52,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2022-11-25 18:40:52,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 238 states have (on average 1.050420168067227) internal successors, (250), 238 states have internal predecessors, (250), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 18:40:52,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 277 transitions. [2022-11-25 18:40:52,781 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 277 transitions. Word has length 175 [2022-11-25 18:40:52,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:40:52,782 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 277 transitions. [2022-11-25 18:40:52,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 2.4375) internal successors, (234), 96 states have internal predecessors, (234), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-11-25 18:40:52,782 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 277 transitions. [2022-11-25 18:40:52,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-11-25 18:40:52,787 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:40:52,787 INFO L195 NwaCegarLoop]: trace histogram [94, 94, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:40:52,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-25 18:40:52,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:40:52,996 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:40:52,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:40:52,996 INFO L85 PathProgramCache]: Analyzing trace with hash 298064430, now seen corresponding path program 3 times [2022-11-25 18:40:52,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:40:52,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784272950] [2022-11-25 18:40:52,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:40:52,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:40:52,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:40:53,000 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:40:53,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-25 18:40:53,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-25 18:40:53,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:40:53,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 18:40:53,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:40:54,334 INFO L134 CoverageAnalysis]: Checked inductivity of 8950 backedges. 28 proven. 18 refuted. 0 times theorem prover too weak. 8904 trivial. 0 not checked. [2022-11-25 18:40:54,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:40:54,736 INFO L134 CoverageAnalysis]: Checked inductivity of 8950 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8948 trivial. 0 not checked. [2022-11-25 18:40:54,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:40:54,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784272950] [2022-11-25 18:40:54,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784272950] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 18:40:54,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:40:54,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 18 [2022-11-25 18:40:54,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350201010] [2022-11-25 18:40:54,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:40:54,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:40:54,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:40:54,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:40:54,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-11-25 18:40:54,740 INFO L87 Difference]: Start difference. First operand 256 states and 277 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-25 18:40:55,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:40:55,512 INFO L93 Difference]: Finished difference Result 329 states and 365 transitions. [2022-11-25 18:40:55,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:40:55,514 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 271 [2022-11-25 18:40:55,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:40:55,516 INFO L225 Difference]: With dead ends: 329 [2022-11-25 18:40:55,517 INFO L226 Difference]: Without dead ends: 294 [2022-11-25 18:40:55,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 524 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2022-11-25 18:40:55,518 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 137 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:40:55,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 365 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 18:40:55,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-11-25 18:40:55,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 260. [2022-11-25 18:40:55,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 242 states have (on average 1.0537190082644627) internal successors, (255), 242 states have internal predecessors, (255), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 18:40:55,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 282 transitions. [2022-11-25 18:40:55,547 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 282 transitions. Word has length 271 [2022-11-25 18:40:55,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:40:55,548 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 282 transitions. [2022-11-25 18:40:55,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-25 18:40:55,549 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 282 transitions. [2022-11-25 18:40:55,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-11-25 18:40:55,554 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:40:55,554 INFO L195 NwaCegarLoop]: trace histogram [94, 94, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:40:55,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-25 18:40:55,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:40:55,771 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:40:55,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:40:55,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1945918868, now seen corresponding path program 1 times [2022-11-25 18:40:55,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:40:55,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770593605] [2022-11-25 18:40:55,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:40:55,773 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:40:55,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:40:55,774 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:40:55,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-25 18:40:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:40:56,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 1254 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-25 18:40:56,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:41:03,418 INFO L134 CoverageAnalysis]: Checked inductivity of 8950 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-11-25 18:41:03,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:41:35,930 INFO L134 CoverageAnalysis]: Checked inductivity of 8950 backedges. 2 proven. 8836 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-25 18:41:35,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:41:35,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770593605] [2022-11-25 18:41:35,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770593605] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:41:35,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:41:35,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 192 [2022-11-25 18:41:35,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141475643] [2022-11-25 18:41:35,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:41:35,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2022-11-25 18:41:35,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:41:35,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2022-11-25 18:41:35,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8971, Invalid=27701, Unknown=0, NotChecked=0, Total=36672 [2022-11-25 18:41:35,946 INFO L87 Difference]: Start difference. First operand 260 states and 282 transitions. Second operand has 192 states, 192 states have (on average 2.21875) internal successors, (426), 192 states have internal predecessors, (426), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-11-25 18:45:21,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:45:21,384 INFO L93 Difference]: Finished difference Result 461 states and 570 transitions. [2022-11-25 18:45:21,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2022-11-25 18:45:21,386 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 192 states have (on average 2.21875) internal successors, (426), 192 states have internal predecessors, (426), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 271 [2022-11-25 18:45:21,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:45:21,388 INFO L225 Difference]: With dead ends: 461 [2022-11-25 18:45:21,388 INFO L226 Difference]: Without dead ends: 392 [2022-11-25 18:45:21,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4336 ImplicationChecksByTransitivity, 221.5s TimeCoverageRelationStatistics Valid=19339, Invalid=45941, Unknown=0, NotChecked=0, Total=65280 [2022-11-25 18:45:21,404 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 67 mSDsluCounter, 6650 mSDsCounter, 0 mSdLazyCounter, 15242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 6722 SdHoareTripleChecker+Invalid, 15243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:45:21,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 6722 Invalid, 15243 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 15242 Invalid, 0 Unknown, 0 Unchecked, 40.6s Time] [2022-11-25 18:45:21,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-11-25 18:45:21,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2022-11-25 18:45:21,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 374 states have (on average 1.03475935828877) internal successors, (387), 374 states have internal predecessors, (387), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 18:45:21,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 414 transitions. [2022-11-25 18:45:21,442 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 414 transitions. Word has length 271 [2022-11-25 18:45:21,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:45:21,443 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 414 transitions. [2022-11-25 18:45:21,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 192 states have (on average 2.21875) internal successors, (426), 192 states have internal predecessors, (426), 1 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-11-25 18:45:21,444 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 414 transitions. [2022-11-25 18:45:21,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2022-11-25 18:45:21,452 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:45:21,452 INFO L195 NwaCegarLoop]: trace histogram [160, 160, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:45:21,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-25 18:45:21,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:45:21,668 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:45:21,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:45:21,668 INFO L85 PathProgramCache]: Analyzing trace with hash 132237160, now seen corresponding path program 2 times [2022-11-25 18:45:21,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:45:21,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816102955] [2022-11-25 18:45:21,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:45:21,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:45:21,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:45:21,671 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:45:21,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-25 18:45:23,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:45:23,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:45:23,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 1980 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 18:45:23,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:45:23,860 INFO L134 CoverageAnalysis]: Checked inductivity of 25714 backedges. 28 proven. 18 refuted. 0 times theorem prover too weak. 25668 trivial. 0 not checked. [2022-11-25 18:45:23,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:45:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 25714 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25712 trivial. 0 not checked. [2022-11-25 18:45:24,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:45:24,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [816102955] [2022-11-25 18:45:24,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [816102955] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 18:45:24,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:45:24,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 18 [2022-11-25 18:45:24,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414641256] [2022-11-25 18:45:24,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:45:24,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:45:24,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:45:24,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:45:24,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-11-25 18:45:24,631 INFO L87 Difference]: Start difference. First operand 392 states and 414 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-25 18:45:25,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:45:25,496 INFO L93 Difference]: Finished difference Result 461 states and 496 transitions. [2022-11-25 18:45:25,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:45:25,497 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 403 [2022-11-25 18:45:25,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:45:25,499 INFO L225 Difference]: With dead ends: 461 [2022-11-25 18:45:25,499 INFO L226 Difference]: Without dead ends: 420 [2022-11-25 18:45:25,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 786 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2022-11-25 18:45:25,501 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 99 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:45:25,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 354 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 18:45:25,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-11-25 18:45:25,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 392. [2022-11-25 18:45:25,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 374 states have (on average 1.0294117647058822) internal successors, (385), 374 states have internal predecessors, (385), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 18:45:25,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 412 transitions. [2022-11-25 18:45:25,542 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 412 transitions. Word has length 403 [2022-11-25 18:45:25,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:45:25,543 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 412 transitions. [2022-11-25 18:45:25,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-25 18:45:25,543 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 412 transitions. [2022-11-25 18:45:25,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2022-11-25 18:45:25,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:45:25,546 INFO L195 NwaCegarLoop]: trace histogram [160, 160, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:45:25,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-25 18:45:25,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:45:25,756 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:45:25,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:45:25,756 INFO L85 PathProgramCache]: Analyzing trace with hash 406996774, now seen corresponding path program 1 times [2022-11-25 18:45:25,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:45:25,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756280348] [2022-11-25 18:45:25,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:45:25,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:45:25,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:45:25,759 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:45:25,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-25 18:45:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:45:27,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 1971 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-25 18:45:27,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:45:29,575 INFO L134 CoverageAnalysis]: Checked inductivity of 25714 backedges. 28 proven. 18 refuted. 0 times theorem prover too weak. 25668 trivial. 0 not checked. [2022-11-25 18:45:29,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:45:29,966 INFO L134 CoverageAnalysis]: Checked inductivity of 25714 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25712 trivial. 0 not checked. [2022-11-25 18:45:29,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:45:29,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756280348] [2022-11-25 18:45:29,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756280348] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 18:45:29,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:45:29,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 19 [2022-11-25 18:45:29,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615510545] [2022-11-25 18:45:29,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:45:29,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:45:29,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:45:29,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:45:29,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-11-25 18:45:29,970 INFO L87 Difference]: Start difference. First operand 392 states and 412 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-25 18:45:30,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:45:30,588 INFO L93 Difference]: Finished difference Result 450 states and 479 transitions. [2022-11-25 18:45:30,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:45:30,589 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 403 [2022-11-25 18:45:30,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:45:30,592 INFO L225 Difference]: With dead ends: 450 [2022-11-25 18:45:30,592 INFO L226 Difference]: Without dead ends: 419 [2022-11-25 18:45:30,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 787 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2022-11-25 18:45:30,593 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 132 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:45:30,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 328 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:45:30,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-11-25 18:45:30,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 394. [2022-11-25 18:45:30,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 376 states have (on average 1.0292553191489362) internal successors, (387), 376 states have internal predecessors, (387), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 18:45:30,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 414 transitions. [2022-11-25 18:45:30,632 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 414 transitions. Word has length 403 [2022-11-25 18:45:30,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:45:30,633 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 414 transitions. [2022-11-25 18:45:30,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-25 18:45:30,633 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 414 transitions. [2022-11-25 18:45:30,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2022-11-25 18:45:30,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:45:30,636 INFO L195 NwaCegarLoop]: trace histogram [160, 160, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:45:30,673 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-25 18:45:30,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:45:30,850 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:45:30,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:45:30,851 INFO L85 PathProgramCache]: Analyzing trace with hash 429629028, now seen corresponding path program 1 times [2022-11-25 18:45:30,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:45:30,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [232044454] [2022-11-25 18:45:30,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:45:30,852 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:45:30,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:45:30,853 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:45:30,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-25 18:45:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:45:32,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 1962 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-25 18:45:32,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:45:34,720 INFO L134 CoverageAnalysis]: Checked inductivity of 25714 backedges. 28 proven. 18 refuted. 0 times theorem prover too weak. 25668 trivial. 0 not checked. [2022-11-25 18:45:34,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:45:35,096 INFO L134 CoverageAnalysis]: Checked inductivity of 25714 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25712 trivial. 0 not checked. [2022-11-25 18:45:35,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:45:35,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [232044454] [2022-11-25 18:45:35,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [232044454] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 18:45:35,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:45:35,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 19 [2022-11-25 18:45:35,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359468039] [2022-11-25 18:45:35,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:45:35,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:45:35,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:45:35,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:45:35,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-11-25 18:45:35,100 INFO L87 Difference]: Start difference. First operand 394 states and 414 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-25 18:45:35,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:45:35,730 INFO L93 Difference]: Finished difference Result 447 states and 474 transitions. [2022-11-25 18:45:35,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:45:35,731 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 403 [2022-11-25 18:45:35,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:45:35,733 INFO L225 Difference]: With dead ends: 447 [2022-11-25 18:45:35,733 INFO L226 Difference]: Without dead ends: 418 [2022-11-25 18:45:35,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 787 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2022-11-25 18:45:35,734 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 122 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:45:35,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 372 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 18:45:35,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-11-25 18:45:35,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 396. [2022-11-25 18:45:35,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 378 states have (on average 1.029100529100529) internal successors, (389), 378 states have internal predecessors, (389), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 18:45:35,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 416 transitions. [2022-11-25 18:45:35,779 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 416 transitions. Word has length 403 [2022-11-25 18:45:35,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:45:35,780 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 416 transitions. [2022-11-25 18:45:35,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-25 18:45:35,780 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 416 transitions. [2022-11-25 18:45:35,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2022-11-25 18:45:35,783 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:45:35,784 INFO L195 NwaCegarLoop]: trace histogram [160, 160, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:45:35,818 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-25 18:45:35,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:45:35,991 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:45:35,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:45:35,991 INFO L85 PathProgramCache]: Analyzing trace with hash -79844062, now seen corresponding path program 1 times [2022-11-25 18:45:35,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:45:35,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328071884] [2022-11-25 18:45:35,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:45:35,993 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:45:35,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:45:35,994 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:45:35,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-25 18:45:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:45:37,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 1953 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-25 18:45:37,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:45:39,665 INFO L134 CoverageAnalysis]: Checked inductivity of 25714 backedges. 28 proven. 18 refuted. 0 times theorem prover too weak. 25668 trivial. 0 not checked. [2022-11-25 18:45:39,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:45:40,065 INFO L134 CoverageAnalysis]: Checked inductivity of 25714 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25712 trivial. 0 not checked. [2022-11-25 18:45:40,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:45:40,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328071884] [2022-11-25 18:45:40,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328071884] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 18:45:40,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:45:40,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 19 [2022-11-25 18:45:40,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18592080] [2022-11-25 18:45:40,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:45:40,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:45:40,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:45:40,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:45:40,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-11-25 18:45:40,069 INFO L87 Difference]: Start difference. First operand 396 states and 416 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-25 18:45:40,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:45:40,610 INFO L93 Difference]: Finished difference Result 444 states and 469 transitions. [2022-11-25 18:45:40,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:45:40,611 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 403 [2022-11-25 18:45:40,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:45:40,613 INFO L225 Difference]: With dead ends: 444 [2022-11-25 18:45:40,613 INFO L226 Difference]: Without dead ends: 417 [2022-11-25 18:45:40,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 787 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2022-11-25 18:45:40,615 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 122 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:45:40,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 326 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:45:40,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-11-25 18:45:40,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 398. [2022-11-25 18:45:40,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 380 states have (on average 1.0289473684210526) internal successors, (391), 380 states have internal predecessors, (391), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 18:45:40,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 418 transitions. [2022-11-25 18:45:40,659 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 418 transitions. Word has length 403 [2022-11-25 18:45:40,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:45:40,659 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 418 transitions. [2022-11-25 18:45:40,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-25 18:45:40,660 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 418 transitions. [2022-11-25 18:45:40,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2022-11-25 18:45:40,663 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:45:40,663 INFO L195 NwaCegarLoop]: trace histogram [160, 160, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:45:40,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-25 18:45:40,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:45:40,888 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:45:40,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:45:40,888 INFO L85 PathProgramCache]: Analyzing trace with hash -17804448, now seen corresponding path program 1 times [2022-11-25 18:45:40,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:45:40,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966448205] [2022-11-25 18:45:40,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:45:40,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:45:40,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:45:40,892 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:45:40,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-25 18:45:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:45:42,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 1944 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-25 18:45:42,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:45:44,887 INFO L134 CoverageAnalysis]: Checked inductivity of 25714 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 25666 trivial. 0 not checked. [2022-11-25 18:45:44,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:45:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 25714 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25712 trivial. 0 not checked. [2022-11-25 18:45:45,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:45:45,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966448205] [2022-11-25 18:45:45,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1966448205] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 18:45:45,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:45:45,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [15] total 24 [2022-11-25 18:45:45,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201854376] [2022-11-25 18:45:45,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:45:45,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:45:45,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:45:45,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:45:45,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-11-25 18:45:45,709 INFO L87 Difference]: Start difference. First operand 398 states and 418 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 5 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-25 18:45:47,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:45:47,524 INFO L93 Difference]: Finished difference Result 466 states and 507 transitions. [2022-11-25 18:45:47,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:45:47,525 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 5 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 403 [2022-11-25 18:45:47,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:45:47,528 INFO L225 Difference]: With dead ends: 466 [2022-11-25 18:45:47,528 INFO L226 Difference]: Without dead ends: 446 [2022-11-25 18:45:47,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 813 GetRequests, 781 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2022-11-25 18:45:47,529 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 171 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:45:47,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 425 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-25 18:45:47,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2022-11-25 18:45:47,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 422. [2022-11-25 18:45:47,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 404 states have (on average 1.0544554455445545) internal successors, (426), 404 states have internal predecessors, (426), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 18:45:47,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 453 transitions. [2022-11-25 18:45:47,576 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 453 transitions. Word has length 403 [2022-11-25 18:45:47,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:45:47,577 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 453 transitions. [2022-11-25 18:45:47,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 5 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-25 18:45:47,577 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 453 transitions. [2022-11-25 18:45:47,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2022-11-25 18:45:47,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:45:47,581 INFO L195 NwaCegarLoop]: trace histogram [160, 160, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:45:47,633 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-25 18:45:47,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:45:47,804 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:45:47,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:45:47,804 INFO L85 PathProgramCache]: Analyzing trace with hash 907669098, now seen corresponding path program 1 times [2022-11-25 18:45:47,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:45:47,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455043171] [2022-11-25 18:45:47,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:45:47,806 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:45:47,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:45:47,808 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:45:47,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-25 18:45:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:45:49,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 2009 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 18:45:49,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:45:50,217 INFO L134 CoverageAnalysis]: Checked inductivity of 25715 backedges. 28 proven. 19 refuted. 0 times theorem prover too weak. 25668 trivial. 0 not checked. [2022-11-25 18:45:50,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:45:50,749 INFO L134 CoverageAnalysis]: Checked inductivity of 25715 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 25712 trivial. 0 not checked. [2022-11-25 18:45:50,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:45:50,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455043171] [2022-11-25 18:45:50,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455043171] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:45:50,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:45:50,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2022-11-25 18:45:50,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042078889] [2022-11-25 18:45:50,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:45:50,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 18:45:50,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:45:50,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 18:45:50,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-11-25 18:45:50,753 INFO L87 Difference]: Start difference. First operand 422 states and 453 transitions. Second operand has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 17 states have internal predecessors, (65), 6 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-11-25 18:45:54,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:45:54,267 INFO L93 Difference]: Finished difference Result 581 states and 665 transitions. [2022-11-25 18:45:54,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 18:45:54,268 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 17 states have internal predecessors, (65), 6 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) Word has length 405 [2022-11-25 18:45:54,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:45:54,271 INFO L225 Difference]: With dead ends: 581 [2022-11-25 18:45:54,271 INFO L226 Difference]: Without dead ends: 530 [2022-11-25 18:45:54,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 824 GetRequests, 792 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=291, Invalid=831, Unknown=0, NotChecked=0, Total=1122 [2022-11-25 18:45:54,273 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 330 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:45:54,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 908 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-25 18:45:54,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-11-25 18:45:54,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 454. [2022-11-25 18:45:54,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 430 states have (on average 1.058139534883721) internal successors, (455), 430 states have internal predecessors, (455), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-25 18:45:54,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 494 transitions. [2022-11-25 18:45:54,327 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 494 transitions. Word has length 405 [2022-11-25 18:45:54,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:45:54,328 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 494 transitions. [2022-11-25 18:45:54,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 17 states have internal predecessors, (65), 6 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-11-25 18:45:54,329 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 494 transitions. [2022-11-25 18:45:54,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2022-11-25 18:45:54,334 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:45:54,334 INFO L195 NwaCegarLoop]: trace histogram [160, 160, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:45:54,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-25 18:45:54,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:45:54,556 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:45:54,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:45:54,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1942762208, now seen corresponding path program 1 times [2022-11-25 18:45:54,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:45:54,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738090099] [2022-11-25 18:45:54,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:45:54,559 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:45:54,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:45:54,560 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:45:54,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-25 18:46:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:46:08,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 1964 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-25 18:46:08,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:46:08,831 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:46:08,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-11-25 18:46:21,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-11-25 18:46:24,522 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_memcpy_using_uint64_impl_~src#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_ULTIMATE.start_memcpy_using_uint64_harness_~#d1~0#1.base_BEFORE_CALL_12| (_ BitVec 64))) (and (not (= |v_ULTIMATE.start_memcpy_using_uint64_harness_~#d1~0#1.base_BEFORE_CALL_12| |v_ULTIMATE.start_memcpy_using_uint64_impl_~src#1.base_BEFORE_CALL_1|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_memcpy_using_uint64_impl_~src#1.base_BEFORE_CALL_1|) (_ bv0 64)) (select (select |c_#memory_int| |v_ULTIMATE.start_memcpy_using_uint64_harness_~#d1~0#1.base_BEFORE_CALL_12|) (_ bv0 64))))) is different from true [2022-11-25 18:46:26,832 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_memcpy_using_uint64_impl_~src#1.base_BEFORE_CALL_2| (_ BitVec 64)) (|v_ULTIMATE.start_memcpy_using_uint64_harness_~#d1~0#1.base_BEFORE_CALL_13| (_ BitVec 64))) (and (= (select (select |c_#memory_int| |v_ULTIMATE.start_memcpy_using_uint64_impl_~src#1.base_BEFORE_CALL_2|) (_ bv0 64)) (select (select |c_#memory_int| |v_ULTIMATE.start_memcpy_using_uint64_harness_~#d1~0#1.base_BEFORE_CALL_13|) (_ bv0 64))) (not (= |v_ULTIMATE.start_memcpy_using_uint64_harness_~#d1~0#1.base_BEFORE_CALL_13| |v_ULTIMATE.start_memcpy_using_uint64_impl_~src#1.base_BEFORE_CALL_2|)))) is different from true [2022-11-25 18:46:29,116 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_memcpy_using_uint64_harness_~#d1~0#1.base_BEFORE_CALL_14| (_ BitVec 64)) (|v_ULTIMATE.start_memcpy_using_uint64_impl_~src#1.base_BEFORE_CALL_3| (_ BitVec 64))) (and (not (= |v_ULTIMATE.start_memcpy_using_uint64_harness_~#d1~0#1.base_BEFORE_CALL_14| |v_ULTIMATE.start_memcpy_using_uint64_impl_~src#1.base_BEFORE_CALL_3|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_memcpy_using_uint64_impl_~src#1.base_BEFORE_CALL_3|) (_ bv0 64)) (select (select |c_#memory_int| |v_ULTIMATE.start_memcpy_using_uint64_harness_~#d1~0#1.base_BEFORE_CALL_14|) (_ bv0 64))))) is different from true [2022-11-25 18:46:31,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2022-11-25 18:46:34,616 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_2| (_ BitVec 64)) (|v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_2| (_ BitVec 64)) (|ULTIMATE.start_memcpy_using_uint64_impl_~s~0#1.base| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_memcpy_using_uint64_impl_~s~0#1.base|) (_ bv0 64)))) (and (not (= |v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_2| |ULTIMATE.start_memcpy_using_uint64_impl_~s~0#1.base|)) (not (= |ULTIMATE.start_memcpy_using_uint64_impl_~s~0#1.base| |v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_2|)) (= .cse0 (select (select |c_#memory_int| |v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_2|) (_ bv0 64))) (not (= |v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_2| |v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_2|)) (= .cse0 (select (select |c_#memory_int| |v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_2|) (_ bv0 64)))))) is different from true [2022-11-25 18:46:37,087 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_3| (_ BitVec 64)) (|v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_3| (_ BitVec 64)) (|ULTIMATE.start_memcpy_using_uint64_impl_~s~0#1.base| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_memcpy_using_uint64_impl_~s~0#1.base|) (_ bv0 64)))) (and (= .cse0 (select (select |c_#memory_int| |v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_3|) (_ bv0 64))) (not (= |v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_3| |ULTIMATE.start_memcpy_using_uint64_impl_~s~0#1.base|)) (not (= |v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_3| |v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_3|)) (not (= |ULTIMATE.start_memcpy_using_uint64_impl_~s~0#1.base| |v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_3|)) (= .cse0 (select (select |c_#memory_int| |v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_3|) (_ bv0 64)))))) is different from true [2022-11-25 18:46:39,531 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_4| (_ BitVec 64)) (|ULTIMATE.start_memcpy_using_uint64_impl_~s~0#1.base| (_ BitVec 64)) (|v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_4| (_ BitVec 64))) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_memcpy_using_uint64_impl_~s~0#1.base|) (_ bv0 64)))) (and (not (= |ULTIMATE.start_memcpy_using_uint64_impl_~s~0#1.base| |v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_4|)) (= .cse0 (select (select |c_#memory_int| |v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_4|) (_ bv0 64))) (= .cse0 (select (select |c_#memory_int| |v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_4|) (_ bv0 64))) (not (= |v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_4| |ULTIMATE.start_memcpy_using_uint64_impl_~s~0#1.base|)) (not (= |v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_4| |v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_4|))))) is different from true [2022-11-25 18:46:48,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:46:48,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2022-11-25 18:46:48,839 INFO L134 CoverageAnalysis]: Checked inductivity of 25715 backedges. 55 proven. 10 refuted. 0 times theorem prover too weak. 25615 trivial. 35 not checked. [2022-11-25 18:46:48,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:46:49,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:46:49,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738090099] [2022-11-25 18:46:49,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738090099] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:46:49,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [69453841] [2022-11-25 18:46:49,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:46:49,667 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 18:46:49,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/cvc4 [2022-11-25 18:46:49,669 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 18:46:49,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae0abb7e-7d93-400d-a8eb-8ce3856d74f1/bin/uautomizer-ZsLfNo2U6R/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-11-25 18:46:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:46:57,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 1964 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-25 18:46:57,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:46:57,856 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-25 18:46:57,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 32 [2022-11-25 18:47:05,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-25 18:47:05,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-11-25 18:47:09,141 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_memcpy_using_uint64_harness_~#d1~0#1.base_BEFORE_CALL_19| (_ BitVec 64)) (|v_ULTIMATE.start_memcpy_using_uint64_impl_~src#1.base_BEFORE_CALL_4| (_ BitVec 64))) (and (= (select (select |c_#memory_int| |v_ULTIMATE.start_memcpy_using_uint64_harness_~#d1~0#1.base_BEFORE_CALL_19|) (_ bv0 64)) (select (select |c_#memory_int| |v_ULTIMATE.start_memcpy_using_uint64_impl_~src#1.base_BEFORE_CALL_4|) (_ bv0 64))) (not (= |v_ULTIMATE.start_memcpy_using_uint64_harness_~#d1~0#1.base_BEFORE_CALL_19| |v_ULTIMATE.start_memcpy_using_uint64_impl_~src#1.base_BEFORE_CALL_4|)))) is different from true [2022-11-25 18:47:11,542 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_memcpy_using_uint64_harness_~#d1~0#1.base_BEFORE_CALL_20| (_ BitVec 64)) (|v_ULTIMATE.start_memcpy_using_uint64_impl_~src#1.base_BEFORE_CALL_5| (_ BitVec 64))) (and (not (= |v_ULTIMATE.start_memcpy_using_uint64_harness_~#d1~0#1.base_BEFORE_CALL_20| |v_ULTIMATE.start_memcpy_using_uint64_impl_~src#1.base_BEFORE_CALL_5|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_memcpy_using_uint64_harness_~#d1~0#1.base_BEFORE_CALL_20|) (_ bv0 64)) (select (select |c_#memory_int| |v_ULTIMATE.start_memcpy_using_uint64_impl_~src#1.base_BEFORE_CALL_5|) (_ bv0 64))))) is different from true [2022-11-25 18:47:13,969 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_memcpy_using_uint64_harness_~#d1~0#1.base_BEFORE_CALL_21| (_ BitVec 64)) (|v_ULTIMATE.start_memcpy_using_uint64_impl_~src#1.base_BEFORE_CALL_6| (_ BitVec 64))) (and (= (select (select |c_#memory_int| |v_ULTIMATE.start_memcpy_using_uint64_impl_~src#1.base_BEFORE_CALL_6|) (_ bv0 64)) (select (select |c_#memory_int| |v_ULTIMATE.start_memcpy_using_uint64_harness_~#d1~0#1.base_BEFORE_CALL_21|) (_ bv0 64))) (not (= |v_ULTIMATE.start_memcpy_using_uint64_harness_~#d1~0#1.base_BEFORE_CALL_21| |v_ULTIMATE.start_memcpy_using_uint64_impl_~src#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-25 18:47:15,295 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 18:47:15,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2022-11-25 18:47:18,044 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_5| (_ BitVec 64)) (|v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_5| (_ BitVec 64))) (and (not (= |v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_5| |v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_5|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_5|) (_ bv0 64)) (select (select |c_#memory_int| |v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_5|) (_ bv0 64))))) is different from true [2022-11-25 18:47:20,439 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_6| (_ BitVec 64)) (|v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_6| (_ BitVec 64))) (and (= (select (select |c_#memory_int| |v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_6|) (_ bv0 64)) (select (select |c_#memory_int| |v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_6|) (_ bv0 64))) (not (= |v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_6| |v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_6|)))) is different from true [2022-11-25 18:47:22,805 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_7| (_ BitVec 64)) (|v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_7| (_ BitVec 64))) (and (not (= |v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_7| |v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_7|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_assert_bytes_match_~b#1.base_BEFORE_CALL_7|) (_ bv0 64)) (select (select |c_#memory_int| |v_ULTIMATE.start_assert_bytes_match_~a#1.base_BEFORE_CALL_7|) (_ bv0 64))))) is different from true [2022-11-25 18:47:35,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:47:35,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-11-25 18:47:35,847 INFO L134 CoverageAnalysis]: Checked inductivity of 25715 backedges. 64 proven. 1 refuted. 0 times theorem prover too weak. 25624 trivial. 26 not checked. [2022-11-25 18:47:35,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:47:36,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [69453841] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:47:36,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:47:36,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 24] total 50 [2022-11-25 18:47:36,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346759432] [2022-11-25 18:47:36,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:47:36,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-25 18:47:36,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:47:36,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-25 18:47:36,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1591, Unknown=18, NotChecked=1092, Total=2862 [2022-11-25 18:47:36,026 INFO L87 Difference]: Start difference. First operand 454 states and 494 transitions. Second operand has 50 states, 49 states have (on average 2.2448979591836733) internal successors, (110), 44 states have internal predecessors, (110), 9 states have call successors, (21), 14 states have call predecessors, (21), 14 states have return successors, (20), 10 states have call predecessors, (20), 8 states have call successors, (20) [2022-11-25 18:47:38,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:47:41,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:47:43,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:47:45,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:47:47,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:47:49,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:47:51,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:47:53,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:47:55,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:47:57,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:47:59,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:48:01,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:48:11,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:48:17,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:48:23,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:48:25,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]