./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN --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 3bf4efa014e51efebc29a26fae4d93bdd4ac97a340040c60e527138ec3a88197 --- 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-6b4ec56 [2022-11-20 10:58:53,247 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:58:53,249 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:58:53,273 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:58:53,273 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:58:53,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:58:53,282 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:58:53,284 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:58:53,286 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:58:53,287 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:58:53,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:58:53,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:58:53,289 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:58:53,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:58:53,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:58:53,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:58:53,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:58:53,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:58:53,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:58:53,297 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:58:53,299 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:58:53,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:58:53,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:58:53,302 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:58:53,306 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:58:53,306 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:58:53,306 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:58:53,307 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:58:53,308 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:58:53,309 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:58:53,309 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:58:53,310 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:58:53,311 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:58:53,312 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:58:53,313 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:58:53,313 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:58:53,314 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:58:53,314 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:58:53,314 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:58:53,315 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:58:53,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:58:53,317 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-20 10:58:53,339 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:58:53,339 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:58:53,340 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:58:53,340 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:58:53,341 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:58:53,341 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:58:53,342 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:58:53,342 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:58:53,342 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:58:53,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:58:53,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:58:53,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:58:53,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:58:53,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:58:53,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:58:53,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:58:53,344 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:58:53,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:58:53,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:58:53,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:58:53,345 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:58:53,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:58:53,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:58:53,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:58:53,346 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:58:53,346 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:58:53,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:58:53,346 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:58:53,347 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:58:53,347 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:58:53,347 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/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_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN 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 -> 3bf4efa014e51efebc29a26fae4d93bdd4ac97a340040c60e527138ec3a88197 [2022-11-20 10:58:53,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:58:53,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:58:53,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:58:53,723 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:58:53,724 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:58:53,725 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i [2022-11-20 10:58:56,888 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:58:57,601 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:58:57,604 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i [2022-11-20 10:58:57,659 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/data/125e0dd7b/c69170068e6646ae82664d48cc25fd5f/FLAG0674c295b [2022-11-20 10:58:57,681 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/data/125e0dd7b/c69170068e6646ae82664d48cc25fd5f [2022-11-20 10:58:57,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:58:57,690 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:58:57,692 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:58:57,692 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:58:57,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:58:57,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:58:57" (1/1) ... [2022-11-20 10:58:57,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@224a71bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:58:57, skipping insertion in model container [2022-11-20 10:58:57,700 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:58:57" (1/1) ... [2022-11-20 10:58:57,709 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:58:57,846 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:58:58,243 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_9dc9405e-6099-4928-8db1-0bccaa3aa843/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i[4497,4510] [2022-11-20 10:58:58,253 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_9dc9405e-6099-4928-8db1-0bccaa3aa843/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i[4557,4570] [2022-11-20 10:58:59,364 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:58:59,365 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:58:59,366 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:58:59,367 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:58:59,369 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:58:59,384 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:58:59,385 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:58:59,387 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:58:59,388 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:58:59,390 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:58:59,391 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:58:59,392 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:58:59,393 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:58:59,868 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-20 10:58:59,870 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-20 10:58:59,871 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-20 10:58:59,872 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-20 10:58:59,874 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-20 10:58:59,875 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-20 10:58:59,876 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-20 10:58:59,877 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-20 10:58:59,878 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-20 10:58:59,878 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-20 10:59:00,066 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-20 10:59:00,478 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:00,480 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:00,517 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:00,519 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:00,526 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:00,528 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:00,555 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:00,556 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:00,557 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:00,558 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:00,558 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:00,559 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:00,560 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:00,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:59:00,668 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:59:00,696 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_9dc9405e-6099-4928-8db1-0bccaa3aa843/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i[4497,4510] [2022-11-20 10:59:00,697 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_9dc9405e-6099-4928-8db1-0bccaa3aa843/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i[4557,4570] [2022-11-20 10:59:00,785 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:00,785 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:00,786 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:00,786 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:00,787 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:00,794 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:00,794 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:00,796 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:00,796 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:00,797 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:00,798 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:00,799 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:00,799 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:00,910 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-20 10:59:00,911 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-20 10:59:00,912 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-20 10:59:00,913 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-20 10:59:00,914 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-20 10:59:00,915 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-20 10:59:00,915 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-20 10:59:00,916 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-20 10:59:00,917 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-20 10:59:00,917 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-20 10:59:00,956 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-20 10:59:01,135 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:01,137 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:01,146 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:01,147 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:01,150 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:01,151 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:01,165 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:01,166 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:01,167 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:01,168 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:01,169 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:01,170 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:01,170 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:59:01,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:59:01,596 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:59:01,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:59:01 WrapperNode [2022-11-20 10:59:01,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:59:01,599 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:59:01,599 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:59:01,599 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:59:01,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:59:01" (1/1) ... [2022-11-20 10:59:01,780 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:59:01" (1/1) ... [2022-11-20 10:59:01,841 INFO L138 Inliner]: procedures = 775, calls = 2444, calls flagged for inlining = 71, calls inlined = 16, statements flattened = 712 [2022-11-20 10:59:01,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:59:01,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:59:01,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:59:01,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:59:01,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:59:01" (1/1) ... [2022-11-20 10:59:01,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:59:01" (1/1) ... [2022-11-20 10:59:01,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:59:01" (1/1) ... [2022-11-20 10:59:01,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:59:01" (1/1) ... [2022-11-20 10:59:01,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:59:01" (1/1) ... [2022-11-20 10:59:01,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:59:01" (1/1) ... [2022-11-20 10:59:01,899 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:59:01" (1/1) ... [2022-11-20 10:59:01,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:59:01" (1/1) ... [2022-11-20 10:59:01,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:59:01,914 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:59:01,914 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:59:01,914 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:59:01,915 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:59:01" (1/1) ... [2022-11-20 10:59:01,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:59:01,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:59:01,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:59:01,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:59:02,014 INFO L130 BoogieDeclarations]: Found specification of procedure memset_override_0_impl [2022-11-20 10:59:02,014 INFO L138 BoogieDeclarations]: Found implementation of procedure memset_override_0_impl [2022-11-20 10:59:02,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-11-20 10:59:02,015 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-11-20 10:59:02,015 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-11-20 10:59:02,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:59:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-11-20 10:59:02,017 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-11-20 10:59:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-20 10:59:02,017 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-20 10:59:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2022-11-20 10:59:02,017 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2022-11-20 10:59:02,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 10:59:02,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:59:02,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 10:59:02,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:59:02,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:59:02,018 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-20 10:59:02,019 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-20 10:59:02,019 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2022-11-20 10:59:02,019 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2022-11-20 10:59:02,019 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2022-11-20 10:59:02,020 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2022-11-20 10:59:02,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:59:02,020 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-11-20 10:59:02,020 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-11-20 10:59:02,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 10:59:02,020 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-20 10:59:02,021 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-20 10:59:02,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:59:02,021 INFO L130 BoogieDeclarations]: Found specification of procedure my_memset [2022-11-20 10:59:02,021 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memset [2022-11-20 10:59:02,022 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2022-11-20 10:59:02,022 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2022-11-20 10:59:02,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:59:02,022 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2022-11-20 10:59:02,022 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2022-11-20 10:59:02,022 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-20 10:59:02,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-20 10:59:02,023 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-20 10:59:02,023 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-20 10:59:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2022-11-20 10:59:02,024 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2022-11-20 10:59:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 10:59:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-11-20 10:59:02,025 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-11-20 10:59:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2022-11-20 10:59:02,031 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2022-11-20 10:59:02,031 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-11-20 10:59:02,031 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-11-20 10:59:02,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:59:02,491 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:59:02,499 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:59:03,745 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:59:03,754 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:59:03,755 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 10:59:03,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:59:03 BoogieIcfgContainer [2022-11-20 10:59:03,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:59:03,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:59:03,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:59:03,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:59:03,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:58:57" (1/3) ... [2022-11-20 10:59:03,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea1c0c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:59:03, skipping insertion in model container [2022-11-20 10:59:03,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:59:01" (2/3) ... [2022-11-20 10:59:03,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea1c0c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:59:03, skipping insertion in model container [2022-11-20 10:59:03,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:59:03" (3/3) ... [2022-11-20 10:59:03,767 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_hash_table_clean_up_harness.i [2022-11-20 10:59:03,788 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:59:03,789 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 10:59:03,845 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:59:03,852 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;@431e6efa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:59:03,853 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 10:59:03,858 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 124 states have (on average 1.185483870967742) internal successors, (147), 125 states have internal predecessors, (147), 47 states have call successors, (47), 19 states have call predecessors, (47), 19 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2022-11-20 10:59:03,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-20 10:59:03,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:59:03,873 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:59:03,873 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:59:03,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:59:03,879 INFO L85 PathProgramCache]: Analyzing trace with hash 612907166, now seen corresponding path program 1 times [2022-11-20 10:59:03,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:59:03,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483450365] [2022-11-20 10:59:03,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:59:03,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:59:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:04,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:59:04,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483450365] [2022-11-20 10:59:04,492 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-11-20 10:59:04,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408680882] [2022-11-20 10:59:04,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:59:04,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:59:04,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:59:04,497 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:59:04,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:59:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:05,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 2324 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-20 10:59:05,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:59:05,273 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-11-20 10:59:05,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:59:05,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408680882] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:59:05,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:59:05,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:59:05,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269749334] [2022-11-20 10:59:05,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:59:05,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 10:59:05,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:59:05,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 10:59:05,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:59:05,333 INFO L87 Difference]: Start difference. First operand has 192 states, 124 states have (on average 1.185483870967742) internal successors, (147), 125 states have internal predecessors, (147), 47 states have call successors, (47), 19 states have call predecessors, (47), 19 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-20 10:59:05,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:59:05,378 INFO L93 Difference]: Finished difference Result 379 states and 500 transitions. [2022-11-20 10:59:05,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 10:59:05,381 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 132 [2022-11-20 10:59:05,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:59:05,390 INFO L225 Difference]: With dead ends: 379 [2022-11-20 10:59:05,390 INFO L226 Difference]: Without dead ends: 185 [2022-11-20 10:59:05,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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-20 10:59:05,400 INFO L413 NwaCegarLoop]: 237 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, 237 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-20 10:59:05,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:59:05,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-20 10:59:05,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-11-20 10:59:05,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 118 states have (on average 1.152542372881356) internal successors, (136), 119 states have internal predecessors, (136), 47 states have call successors, (47), 19 states have call predecessors, (47), 19 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-20 10:59:05,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 229 transitions. [2022-11-20 10:59:05,489 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 229 transitions. Word has length 132 [2022-11-20 10:59:05,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:59:05,491 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 229 transitions. [2022-11-20 10:59:05,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-20 10:59:05,492 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 229 transitions. [2022-11-20 10:59:05,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-20 10:59:05,498 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:59:05,498 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:59:05,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:59:05,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-20 10:59:05,708 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:59:05,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:59:05,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1662345498, now seen corresponding path program 1 times [2022-11-20 10:59:05,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:59:05,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329891985] [2022-11-20 10:59:05,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:59:05,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:59:05,835 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 10:59:05,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [66130342] [2022-11-20 10:59:05,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:59:05,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:59:05,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:59:05,838 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:59:05,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:59:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:06,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 2324 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 10:59:06,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:59:06,518 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-11-20 10:59:06,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:59:06,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:59:06,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329891985] [2022-11-20 10:59:06,521 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 10:59:06,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66130342] [2022-11-20 10:59:06,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66130342] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:59:06,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:59:06,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:59:06,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36782855] [2022-11-20 10:59:06,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:59:06,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:59:06,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:59:06,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:59:06,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:59:06,527 INFO L87 Difference]: Start difference. First operand 185 states and 229 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-20 10:59:06,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:59:06,630 INFO L93 Difference]: Finished difference Result 333 states and 413 transitions. [2022-11-20 10:59:06,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:59:06,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 132 [2022-11-20 10:59:06,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:59:06,640 INFO L225 Difference]: With dead ends: 333 [2022-11-20 10:59:06,641 INFO L226 Difference]: Without dead ends: 190 [2022-11-20 10:59:06,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:59:06,649 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 2 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:59:06,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 899 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:59:06,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-20 10:59:06,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-11-20 10:59:06,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 122 states have (on average 1.1475409836065573) internal successors, (140), 123 states have internal predecessors, (140), 47 states have call successors, (47), 19 states have call predecessors, (47), 20 states have return successors, (47), 47 states have call predecessors, (47), 46 states have call successors, (47) [2022-11-20 10:59:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 234 transitions. [2022-11-20 10:59:06,682 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 234 transitions. Word has length 132 [2022-11-20 10:59:06,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:59:06,683 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 234 transitions. [2022-11-20 10:59:06,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-20 10:59:06,683 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 234 transitions. [2022-11-20 10:59:06,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-20 10:59:06,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:59:06,685 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:59:06,699 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-20 10:59:06,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:59:06,896 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:59:06,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:59:06,896 INFO L85 PathProgramCache]: Analyzing trace with hash 402505814, now seen corresponding path program 1 times [2022-11-20 10:59:06,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:59:06,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276974838] [2022-11-20 10:59:06,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:59:06,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:59:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:08,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:59:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:08,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:59:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:08,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:59:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:08,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:59:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:08,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-20 10:59:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:08,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:08,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:08,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:59:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:08,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 10:59:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:08,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 10:59:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:09,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:09,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-20 10:59:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:09,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-20 10:59:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:09,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-20 10:59:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:09,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 10:59:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:09,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 10:59:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:09,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-20 10:59:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:09,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-20 10:59:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:09,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 10:59:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:09,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-20 10:59:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:09,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-20 10:59:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:09,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-20 10:59:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:09,417 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-11-20 10:59:09,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:59:09,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276974838] [2022-11-20 10:59:09,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276974838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:59:09,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:59:09,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-20 10:59:09,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7857584] [2022-11-20 10:59:09,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:59:09,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 10:59:09,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:59:09,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 10:59:09,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:59:09,424 INFO L87 Difference]: Start difference. First operand 190 states and 234 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 9 states have internal predecessors, (62), 4 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-11-20 10:59:11,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:59:11,153 INFO L93 Difference]: Finished difference Result 344 states and 429 transitions. [2022-11-20 10:59:11,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 10:59:11,154 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 9 states have internal predecessors, (62), 4 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 138 [2022-11-20 10:59:11,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:59:11,159 INFO L225 Difference]: With dead ends: 344 [2022-11-20 10:59:11,159 INFO L226 Difference]: Without dead ends: 215 [2022-11-20 10:59:11,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2022-11-20 10:59:11,167 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 227 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:59:11,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 986 Invalid, 1388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-20 10:59:11,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-11-20 10:59:11,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 195. [2022-11-20 10:59:11,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 126 states have (on average 1.1507936507936507) internal successors, (145), 128 states have internal predecessors, (145), 47 states have call successors, (47), 19 states have call predecessors, (47), 21 states have return successors, (50), 47 states have call predecessors, (50), 46 states have call successors, (50) [2022-11-20 10:59:11,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 242 transitions. [2022-11-20 10:59:11,211 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 242 transitions. Word has length 138 [2022-11-20 10:59:11,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:59:11,213 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 242 transitions. [2022-11-20 10:59:11,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 9 states have internal predecessors, (62), 4 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-11-20 10:59:11,214 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 242 transitions. [2022-11-20 10:59:11,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-20 10:59:11,225 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:59:11,225 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:59:11,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:59:11,226 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:59:11,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:59:11,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1508536744, now seen corresponding path program 1 times [2022-11-20 10:59:11,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:59:11,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99502186] [2022-11-20 10:59:11,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:59:11,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:59:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:11,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:59:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:11,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:59:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:11,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:59:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:11,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:59:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:11,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-20 10:59:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:11,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:11,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:11,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:59:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:11,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 10:59:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:11,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 10:59:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:11,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:11,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-20 10:59:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:12,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-20 10:59:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:12,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-20 10:59:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:12,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 10:59:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:12,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 10:59:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:12,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-20 10:59:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:12,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-20 10:59:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:12,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 10:59:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:12,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-20 10:59:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:12,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-20 10:59:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:12,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-20 10:59:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:12,159 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-11-20 10:59:12,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:59:12,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99502186] [2022-11-20 10:59:12,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99502186] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:59:12,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:59:12,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:59:12,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389101007] [2022-11-20 10:59:12,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:59:12,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:59:12,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:59:12,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:59:12,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:59:12,162 INFO L87 Difference]: Start difference. First operand 195 states and 242 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-11-20 10:59:13,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:59:13,037 INFO L93 Difference]: Finished difference Result 351 states and 441 transitions. [2022-11-20 10:59:13,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:59:13,038 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 138 [2022-11-20 10:59:13,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:59:13,040 INFO L225 Difference]: With dead ends: 351 [2022-11-20 10:59:13,040 INFO L226 Difference]: Without dead ends: 217 [2022-11-20 10:59:13,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:59:13,042 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 249 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 10:59:13,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 549 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 10:59:13,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-11-20 10:59:13,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 197. [2022-11-20 10:59:13,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 127 states have (on average 1.1496062992125984) internal successors, (146), 129 states have internal predecessors, (146), 48 states have call successors, (48), 19 states have call predecessors, (48), 21 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2022-11-20 10:59:13,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 245 transitions. [2022-11-20 10:59:13,064 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 245 transitions. Word has length 138 [2022-11-20 10:59:13,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:59:13,065 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 245 transitions. [2022-11-20 10:59:13,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-11-20 10:59:13,065 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 245 transitions. [2022-11-20 10:59:13,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-11-20 10:59:13,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:59:13,068 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:59:13,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:59:13,068 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:59:13,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:59:13,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1821333084, now seen corresponding path program 1 times [2022-11-20 10:59:13,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:59:13,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727182821] [2022-11-20 10:59:13,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:59:13,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:59:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:13,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:59:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:13,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:59:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:13,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:59:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:13,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:59:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:13,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-20 10:59:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:13,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:13,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:13,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:59:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:13,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 10:59:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:14,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 10:59:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:14,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:14,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-20 10:59:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:14,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:59:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:14,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-20 10:59:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:14,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 10:59:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:14,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 10:59:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:14,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-20 10:59:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:14,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-20 10:59:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:14,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-20 10:59:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:14,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-20 10:59:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:14,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-20 10:59:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:14,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-20 10:59:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:14,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-20 10:59:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:14,478 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-11-20 10:59:14,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:59:14,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727182821] [2022-11-20 10:59:14,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727182821] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:59:14,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:59:14,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:59:14,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609081991] [2022-11-20 10:59:14,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:59:14,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:59:14,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:59:14,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:59:14,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:59:14,482 INFO L87 Difference]: Start difference. First operand 197 states and 245 transitions. Second operand has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2022-11-20 10:59:15,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:59:15,853 INFO L93 Difference]: Finished difference Result 353 states and 449 transitions. [2022-11-20 10:59:15,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:59:15,854 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 144 [2022-11-20 10:59:15,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:59:15,856 INFO L225 Difference]: With dead ends: 353 [2022-11-20 10:59:15,856 INFO L226 Difference]: Without dead ends: 215 [2022-11-20 10:59:15,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:59:15,858 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 106 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:59:15,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 870 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-20 10:59:15,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-11-20 10:59:15,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 197. [2022-11-20 10:59:15,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 127 states have (on average 1.141732283464567) internal successors, (145), 129 states have internal predecessors, (145), 48 states have call successors, (48), 19 states have call predecessors, (48), 21 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2022-11-20 10:59:15,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 244 transitions. [2022-11-20 10:59:15,892 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 244 transitions. Word has length 144 [2022-11-20 10:59:15,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:59:15,894 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 244 transitions. [2022-11-20 10:59:15,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2022-11-20 10:59:15,894 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 244 transitions. [2022-11-20 10:59:15,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-11-20 10:59:15,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:59:15,899 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:59:15,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:59:15,900 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:59:15,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:59:15,901 INFO L85 PathProgramCache]: Analyzing trace with hash -707873686, now seen corresponding path program 1 times [2022-11-20 10:59:15,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:59:15,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35421818] [2022-11-20 10:59:15,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:59:15,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:59:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:17,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:59:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:17,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:59:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:17,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:59:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:17,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:59:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:17,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-20 10:59:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:17,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:17,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:17,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:59:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:17,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 10:59:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:17,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 10:59:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:17,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:17,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-20 10:59:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:17,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:59:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:17,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:59:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:17,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 10:59:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:17,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 10:59:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:17,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 10:59:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:17,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-20 10:59:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:17,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 10:59:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:17,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-20 10:59:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:17,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-20 10:59:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:17,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-20 10:59:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:17,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-20 10:59:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:17,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-20 10:59:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:17,796 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-11-20 10:59:17,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:59:17,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35421818] [2022-11-20 10:59:17,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35421818] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:59:17,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:59:17,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 10:59:17,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189200526] [2022-11-20 10:59:17,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:59:17,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:59:17,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:59:17,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:59:17,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:59:17,799 INFO L87 Difference]: Start difference. First operand 197 states and 244 transitions. Second operand has 11 states, 10 states have (on average 6.7) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-11-20 10:59:19,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:59:19,283 INFO L93 Difference]: Finished difference Result 230 states and 283 transitions. [2022-11-20 10:59:19,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 10:59:19,283 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 149 [2022-11-20 10:59:19,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:59:19,286 INFO L225 Difference]: With dead ends: 230 [2022-11-20 10:59:19,286 INFO L226 Difference]: Without dead ends: 228 [2022-11-20 10:59:19,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-11-20 10:59:19,287 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 178 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:59:19,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 781 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-20 10:59:19,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-20 10:59:19,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 201. [2022-11-20 10:59:19,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 130 states have (on average 1.1384615384615384) internal successors, (148), 132 states have internal predecessors, (148), 48 states have call successors, (48), 20 states have call predecessors, (48), 22 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2022-11-20 10:59:19,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 247 transitions. [2022-11-20 10:59:19,309 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 247 transitions. Word has length 149 [2022-11-20 10:59:19,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:59:19,310 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 247 transitions. [2022-11-20 10:59:19,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 7 states have internal predecessors, (67), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-11-20 10:59:19,310 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 247 transitions. [2022-11-20 10:59:19,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-11-20 10:59:19,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:59:19,313 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:59:19,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:59:19,313 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:59:19,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:59:19,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1987910354, now seen corresponding path program 1 times [2022-11-20 10:59:19,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:59:19,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607441796] [2022-11-20 10:59:19,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:59:19,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:59:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:24,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:59:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:24,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:59:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:24,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:59:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:24,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:59:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:24,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-20 10:59:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:24,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:24,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:24,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:59:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:25,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 10:59:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:25,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 10:59:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:25,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:25,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-20 10:59:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:25,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:59:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:25,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:59:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:25,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 10:59:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:25,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 10:59:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:25,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 10:59:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:25,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-20 10:59:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:25,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 10:59:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:25,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-20 10:59:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:25,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-20 10:59:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:25,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-20 10:59:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:25,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-20 10:59:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:25,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-20 10:59:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:25,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-20 10:59:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:25,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-20 10:59:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:25,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-20 10:59:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:25,450 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-11-20 10:59:25,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:59:25,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607441796] [2022-11-20 10:59:25,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607441796] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:59:25,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:59:25,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-11-20 10:59:25,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533636086] [2022-11-20 10:59:25,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:59:25,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-20 10:59:25,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:59:25,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-20 10:59:25,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-11-20 10:59:25,454 INFO L87 Difference]: Start difference. First operand 201 states and 247 transitions. Second operand has 22 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 18 states have internal predecessors, (74), 13 states have call successors, (28), 5 states have call predecessors, (28), 4 states have return successors, (27), 14 states have call predecessors, (27), 13 states have call successors, (27) [2022-11-20 10:59:28,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:59:28,809 INFO L93 Difference]: Finished difference Result 257 states and 310 transitions. [2022-11-20 10:59:28,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 10:59:28,810 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 18 states have internal predecessors, (74), 13 states have call successors, (28), 5 states have call predecessors, (28), 4 states have return successors, (27), 14 states have call predecessors, (27), 13 states have call successors, (27) Word has length 167 [2022-11-20 10:59:28,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:59:28,812 INFO L225 Difference]: With dead ends: 257 [2022-11-20 10:59:28,812 INFO L226 Difference]: Without dead ends: 231 [2022-11-20 10:59:28,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=161, Invalid=1099, Unknown=0, NotChecked=0, Total=1260 [2022-11-20 10:59:28,814 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 323 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 2420 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 2597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 2420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:59:28,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 887 Invalid, 2597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 2420 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-20 10:59:28,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-11-20 10:59:28,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 201. [2022-11-20 10:59:28,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 130 states have (on average 1.1307692307692307) internal successors, (147), 132 states have internal predecessors, (147), 48 states have call successors, (48), 20 states have call predecessors, (48), 22 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2022-11-20 10:59:28,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 246 transitions. [2022-11-20 10:59:28,880 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 246 transitions. Word has length 167 [2022-11-20 10:59:28,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:59:28,881 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 246 transitions. [2022-11-20 10:59:28,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 18 states have internal predecessors, (74), 13 states have call successors, (28), 5 states have call predecessors, (28), 4 states have return successors, (27), 14 states have call predecessors, (27), 13 states have call successors, (27) [2022-11-20 10:59:28,881 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 246 transitions. [2022-11-20 10:59:28,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-11-20 10:59:28,885 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:59:28,886 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:59:28,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:59:28,886 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:59:28,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:59:28,887 INFO L85 PathProgramCache]: Analyzing trace with hash -2117241235, now seen corresponding path program 1 times [2022-11-20 10:59:28,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:59:28,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960710308] [2022-11-20 10:59:28,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:59:28,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:59:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:29,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:59:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:29,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:59:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:29,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:59:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:29,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:59:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:29,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-20 10:59:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:29,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:29,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:29,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:59:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:29,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 10:59:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:29,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 10:59:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:29,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:29,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-20 10:59:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:29,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:59:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:29,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:59:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:29,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 10:59:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:29,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 10:59:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:29,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 10:59:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:29,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-20 10:59:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:29,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 10:59:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:29,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-20 10:59:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:29,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-20 10:59:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:29,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-20 10:59:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:29,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-20 10:59:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:29,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-20 10:59:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:29,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-20 10:59:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:29,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-20 10:59:29,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:29,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-20 10:59:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:29,465 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-11-20 10:59:29,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:59:29,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960710308] [2022-11-20 10:59:29,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960710308] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:59:29,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:59:29,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:59:29,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080361039] [2022-11-20 10:59:29,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:59:29,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:59:29,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:59:29,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:59:29,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:59:29,468 INFO L87 Difference]: Start difference. First operand 201 states and 246 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-20 10:59:30,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:59:30,163 INFO L93 Difference]: Finished difference Result 305 states and 367 transitions. [2022-11-20 10:59:30,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:59:30,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 174 [2022-11-20 10:59:30,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:59:30,166 INFO L225 Difference]: With dead ends: 305 [2022-11-20 10:59:30,166 INFO L226 Difference]: Without dead ends: 219 [2022-11-20 10:59:30,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:59:30,167 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 93 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:59:30,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 433 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 10:59:30,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-11-20 10:59:30,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 202. [2022-11-20 10:59:30,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 131 states have (on average 1.1297709923664123) internal successors, (148), 133 states have internal predecessors, (148), 48 states have call successors, (48), 20 states have call predecessors, (48), 22 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2022-11-20 10:59:30,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 247 transitions. [2022-11-20 10:59:30,195 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 247 transitions. Word has length 174 [2022-11-20 10:59:30,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:59:30,195 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 247 transitions. [2022-11-20 10:59:30,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-20 10:59:30,196 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 247 transitions. [2022-11-20 10:59:30,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-11-20 10:59:30,198 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:59:30,199 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:59:30,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:59:30,199 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:59:30,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:59:30,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1156657707, now seen corresponding path program 1 times [2022-11-20 10:59:30,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:59:30,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885290318] [2022-11-20 10:59:30,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:59:30,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:59:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:30,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:59:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:30,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:59:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:30,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:59:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:30,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:59:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:30,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-20 10:59:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:30,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:30,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:30,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:59:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:30,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 10:59:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:30,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 10:59:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:30,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:30,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-20 10:59:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:30,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:59:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:30,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:59:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:30,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 10:59:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:30,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 10:59:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:30,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 10:59:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:30,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-20 10:59:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:30,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 10:59:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:31,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-20 10:59:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:31,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-20 10:59:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:31,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-20 10:59:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:31,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-20 10:59:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:31,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-20 10:59:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:31,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-20 10:59:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:31,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-20 10:59:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:31,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-20 10:59:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:31,086 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-11-20 10:59:31,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:59:31,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885290318] [2022-11-20 10:59:31,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885290318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:59:31,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:59:31,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:59:31,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113131098] [2022-11-20 10:59:31,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:59:31,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:59:31,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:59:31,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:59:31,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:59:31,089 INFO L87 Difference]: Start difference. First operand 202 states and 247 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2022-11-20 10:59:31,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:59:31,883 INFO L93 Difference]: Finished difference Result 329 states and 401 transitions. [2022-11-20 10:59:31,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:59:31,884 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 174 [2022-11-20 10:59:31,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:59:31,886 INFO L225 Difference]: With dead ends: 329 [2022-11-20 10:59:31,887 INFO L226 Difference]: Without dead ends: 219 [2022-11-20 10:59:31,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:59:31,889 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 207 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:59:31,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 454 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 10:59:31,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-11-20 10:59:31,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 202. [2022-11-20 10:59:31,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 131 states have (on average 1.1221374045801527) internal successors, (147), 133 states have internal predecessors, (147), 48 states have call successors, (48), 20 states have call predecessors, (48), 22 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2022-11-20 10:59:31,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 246 transitions. [2022-11-20 10:59:31,925 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 246 transitions. Word has length 174 [2022-11-20 10:59:31,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:59:31,930 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 246 transitions. [2022-11-20 10:59:31,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2022-11-20 10:59:31,930 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 246 transitions. [2022-11-20 10:59:31,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-11-20 10:59:31,934 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:59:31,934 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:59:31,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:59:31,935 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:59:31,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:59:31,936 INFO L85 PathProgramCache]: Analyzing trace with hash -32322626, now seen corresponding path program 1 times [2022-11-20 10:59:31,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:59:31,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148408736] [2022-11-20 10:59:31,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:59:31,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:59:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:59:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 10:59:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 10:59:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 10:59:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-20 10:59:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:59:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 10:59:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 10:59:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:59:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-20 10:59:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 10:59:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:59:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 10:59:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 10:59:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 10:59:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-20 10:59:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 10:59:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-20 10:59:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-20 10:59:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-20 10:59:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-20 10:59:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-20 10:59:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-20 10:59:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-20 10:59:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-20 10:59:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-20 10:59:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:33,999 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2022-11-20 10:59:34,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:59:34,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148408736] [2022-11-20 10:59:34,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148408736] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:59:34,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103542251] [2022-11-20 10:59:34,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:59:34,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:59:34,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:59:34,002 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:59:34,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 10:59:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:59:34,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 2516 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-20 10:59:34,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:59:34,915 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 101 proven. 3 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-11-20 10:59:34,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:59:35,321 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2022-11-20 10:59:35,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103542251] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:59:35,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:59:35,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 24 [2022-11-20 10:59:35,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730190667] [2022-11-20 10:59:35,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:59:35,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-20 10:59:35,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:59:35,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 10:59:35,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2022-11-20 10:59:35,324 INFO L87 Difference]: Start difference. First operand 202 states and 246 transitions. Second operand has 24 states, 20 states have (on average 6.25) internal successors, (125), 18 states have internal predecessors, (125), 7 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (52), 5 states have call predecessors, (52), 7 states have call successors, (52) [2022-11-20 10:59:38,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:59:38,435 INFO L93 Difference]: Finished difference Result 340 states and 416 transitions. [2022-11-20 10:59:38,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 10:59:38,436 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 6.25) internal successors, (125), 18 states have internal predecessors, (125), 7 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (52), 5 states have call predecessors, (52), 7 states have call successors, (52) Word has length 183 [2022-11-20 10:59:38,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:59:38,438 INFO L225 Difference]: With dead ends: 340 [2022-11-20 10:59:38,438 INFO L226 Difference]: Without dead ends: 228 [2022-11-20 10:59:38,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=290, Invalid=1690, Unknown=0, NotChecked=0, Total=1980 [2022-11-20 10:59:38,440 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 438 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 2421 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 2713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 2421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:59:38,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1369 Invalid, 2713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 2421 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-20 10:59:38,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-20 10:59:38,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 208. [2022-11-20 10:59:38,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 135 states have (on average 1.1185185185185185) internal successors, (151), 139 states have internal predecessors, (151), 48 states have call successors, (48), 20 states have call predecessors, (48), 24 states have return successors, (54), 48 states have call predecessors, (54), 47 states have call successors, (54) [2022-11-20 10:59:38,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 253 transitions. [2022-11-20 10:59:38,473 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 253 transitions. Word has length 183 [2022-11-20 10:59:38,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:59:38,474 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 253 transitions. [2022-11-20 10:59:38,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 6.25) internal successors, (125), 18 states have internal predecessors, (125), 7 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (52), 5 states have call predecessors, (52), 7 states have call successors, (52) [2022-11-20 10:59:38,475 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 253 transitions. [2022-11-20 10:59:38,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-11-20 10:59:38,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:59:38,478 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:59:38,494 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:59:38,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 10:59:38,688 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:59:38,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:59:38,688 INFO L85 PathProgramCache]: Analyzing trace with hash 463594926, now seen corresponding path program 1 times [2022-11-20 10:59:38,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:59:38,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738110101] [2022-11-20 10:59:38,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:59:38,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:59:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:57,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:06:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:57,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 11:06:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:57,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 11:06:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:57,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:06:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:57,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-20 11:06:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:57,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:06:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:57,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:06:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:57,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:06:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:57,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 11:06:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:57,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 11:06:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:57,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:06:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:57,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-20 11:06:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:58,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 11:06:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:58,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:06:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:58,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 11:06:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:58,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 11:06:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:58,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 11:06:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:58,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-20 11:06:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:58,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 11:06:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:58,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-20 11:06:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:58,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-20 11:06:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:58,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-20 11:06:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:58,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-20 11:06:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:58,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-20 11:06:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:58,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-20 11:06:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:58,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-20 11:06:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:58,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 11:06:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:58,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:06:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:58,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-20 11:06:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:58,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-11-20 11:06:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:58,346 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-11-20 11:06:58,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:06:58,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738110101] [2022-11-20 11:06:58,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738110101] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:06:58,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589990596] [2022-11-20 11:06:58,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:06:58,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:06:58,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:06:58,354 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:06:58,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 11:06:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:58,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 2565 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 11:06:59,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:06:59,249 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2022-11-20 11:06:59,249 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:06:59,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589990596] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:06:59,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:06:59,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 17 [2022-11-20 11:06:59,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316323499] [2022-11-20 11:06:59,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:06:59,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:06:59,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:06:59,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:06:59,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-11-20 11:06:59,252 INFO L87 Difference]: Start difference. First operand 208 states and 253 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 4 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2022-11-20 11:06:59,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:06:59,538 INFO L93 Difference]: Finished difference Result 325 states and 393 transitions. [2022-11-20 11:06:59,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:06:59,538 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 4 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 194 [2022-11-20 11:06:59,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:06:59,540 INFO L225 Difference]: With dead ends: 325 [2022-11-20 11:06:59,540 INFO L226 Difference]: Without dead ends: 208 [2022-11-20 11:06:59,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-11-20 11:06:59,542 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 271 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:06:59,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 641 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:06:59,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-11-20 11:06:59,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 205. [2022-11-20 11:06:59,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 133 states have (on average 1.1203007518796992) internal successors, (149), 136 states have internal predecessors, (149), 48 states have call successors, (48), 20 states have call predecessors, (48), 23 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2022-11-20 11:06:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 248 transitions. [2022-11-20 11:06:59,568 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 248 transitions. Word has length 194 [2022-11-20 11:06:59,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:06:59,569 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 248 transitions. [2022-11-20 11:06:59,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 4 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2022-11-20 11:06:59,570 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 248 transitions. [2022-11-20 11:06:59,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-11-20 11:06:59,572 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:06:59,572 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 11:06:59,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 11:06:59,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 11:06:59,782 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:06:59,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:06:59,782 INFO L85 PathProgramCache]: Analyzing trace with hash 757991494, now seen corresponding path program 1 times [2022-11-20 11:06:59,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:06:59,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149461046] [2022-11-20 11:06:59,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:06:59,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:07:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:00,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:07:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:00,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 11:07:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:00,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 11:07:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:00,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:07:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:00,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-20 11:07:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:00,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:00,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:00,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:07:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:00,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 11:07:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:00,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 11:07:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:01,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:01,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-20 11:07:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:01,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 11:07:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:01,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:07:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:01,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 11:07:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:01,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 11:07:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:01,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 11:07:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:01,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-20 11:07:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:01,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 11:07:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:01,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-20 11:07:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:01,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-20 11:07:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:01,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-20 11:07:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:01,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-20 11:07:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:01,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-20 11:07:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:01,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 11:07:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:01,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:07:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:01,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-20 11:07:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:01,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-20 11:07:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:01,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 11:07:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:01,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:07:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:01,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-11-20 11:07:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:01,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-11-20 11:07:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:01,234 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2022-11-20 11:07:01,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:07:01,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149461046] [2022-11-20 11:07:01,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149461046] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:07:01,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:07:01,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 11:07:01,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523873764] [2022-11-20 11:07:01,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:07:01,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 11:07:01,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:07:01,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 11:07:01,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:07:01,238 INFO L87 Difference]: Start difference. First operand 205 states and 248 transitions. Second operand has 11 states, 9 states have (on average 8.11111111111111) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (31), 7 states have call predecessors, (31), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-20 11:07:02,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:07:02,302 INFO L93 Difference]: Finished difference Result 228 states and 274 transitions. [2022-11-20 11:07:02,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 11:07:02,303 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 8.11111111111111) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (31), 7 states have call predecessors, (31), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 205 [2022-11-20 11:07:02,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:07:02,305 INFO L225 Difference]: With dead ends: 228 [2022-11-20 11:07:02,305 INFO L226 Difference]: Without dead ends: 226 [2022-11-20 11:07:02,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-11-20 11:07:02,306 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 133 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 11:07:02,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1012 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 11:07:02,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-11-20 11:07:02,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 209. [2022-11-20 11:07:02,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 136 states have (on average 1.1176470588235294) internal successors, (152), 139 states have internal predecessors, (152), 48 states have call successors, (48), 21 states have call predecessors, (48), 24 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2022-11-20 11:07:02,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 251 transitions. [2022-11-20 11:07:02,332 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 251 transitions. Word has length 205 [2022-11-20 11:07:02,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:07:02,334 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 251 transitions. [2022-11-20 11:07:02,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 8.11111111111111) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (31), 7 states have call predecessors, (31), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-20 11:07:02,334 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 251 transitions. [2022-11-20 11:07:02,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-11-20 11:07:02,337 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:07:02,337 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 11:07:02,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 11:07:02,338 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:07:02,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:07:02,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1812316404, now seen corresponding path program 1 times [2022-11-20 11:07:02,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:07:02,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262348124] [2022-11-20 11:07:02,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:07:02,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:07:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:07:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 11:07:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 11:07:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:07:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-20 11:07:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:07:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 11:07:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 11:07:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-20 11:07:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 11:07:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:07:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 11:07:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 11:07:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 11:07:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-20 11:07:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 11:07:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-20 11:07:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-20 11:07:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-20 11:07:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-20 11:07:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-20 11:07:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 11:07:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:07:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-20 11:07:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-20 11:07:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 11:07:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:07:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-11-20 11:07:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-11-20 11:07:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-20 11:07:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:03,888 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-11-20 11:07:03,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:07:03,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262348124] [2022-11-20 11:07:03,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262348124] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:07:03,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803374750] [2022-11-20 11:07:03,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:07:03,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:07:03,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:07:03,890 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:07:03,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 11:07:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:04,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 2637 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-20 11:07:04,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:07:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2022-11-20 11:07:04,679 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:07:04,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803374750] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:07:04,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:07:04,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2022-11-20 11:07:04,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141134053] [2022-11-20 11:07:04,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:07:04,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:07:04,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:07:04,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:07:04,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-11-20 11:07:04,682 INFO L87 Difference]: Start difference. First operand 209 states and 251 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2022-11-20 11:07:05,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:07:05,059 INFO L93 Difference]: Finished difference Result 371 states and 446 transitions. [2022-11-20 11:07:05,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:07:05,060 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) Word has length 211 [2022-11-20 11:07:05,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:07:05,061 INFO L225 Difference]: With dead ends: 371 [2022-11-20 11:07:05,061 INFO L226 Difference]: Without dead ends: 209 [2022-11-20 11:07:05,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-11-20 11:07:05,063 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 233 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:07:05,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 841 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:07:05,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-11-20 11:07:05,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 204. [2022-11-20 11:07:05,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 132 states have (on average 1.106060606060606) internal successors, (146), 135 states have internal predecessors, (146), 48 states have call successors, (48), 21 states have call predecessors, (48), 23 states have return successors, (50), 47 states have call predecessors, (50), 47 states have call successors, (50) [2022-11-20 11:07:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 244 transitions. [2022-11-20 11:07:05,089 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 244 transitions. Word has length 211 [2022-11-20 11:07:05,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:07:05,089 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 244 transitions. [2022-11-20 11:07:05,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2022-11-20 11:07:05,089 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 244 transitions. [2022-11-20 11:07:05,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-11-20 11:07:05,093 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:07:05,093 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 11:07:05,108 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 11:07:05,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-20 11:07:05,304 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:07:05,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:07:05,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1761039897, now seen corresponding path program 1 times [2022-11-20 11:07:05,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:07:05,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25527635] [2022-11-20 11:07:05,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:07:05,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:07:05,371 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 11:07:05,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1579652660] [2022-11-20 11:07:05,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:07:05,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:07:05,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:07:05,372 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:07:05,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 11:07:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:13,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 2742 conjuncts, 421 conjunts are in the unsatisfiable core [2022-11-20 11:07:13,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:07:13,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:07:13,947 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 11:07:13,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 11:07:14,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 11:07:14,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 11:07:14,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-20 11:07:14,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 11:07:15,206 INFO L321 Elim1Store]: treesize reduction 112, result has 28.7 percent of original size [2022-11-20 11:07:15,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 88 treesize of output 114 [2022-11-20 11:07:22,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 11:07:24,074 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 11:07:24,093 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 148 proven. 12 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-11-20 11:07:24,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:07:35,954 WARN L233 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:07:44,666 WARN L233 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:08:01,341 WARN L233 SmtUtils]: Spent 16.15s on a formula simplification. DAG size of input: 70 DAG size of output: 66 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:08:01,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:08:01,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25527635] [2022-11-20 11:08:01,343 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 11:08:01,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579652660] [2022-11-20 11:08:01,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579652660] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:08:01,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:08:01,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2022-11-20 11:08:01,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763136272] [2022-11-20 11:08:01,344 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-20 11:08:01,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-20 11:08:01,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:08:01,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-20 11:08:01,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2375, Unknown=7, NotChecked=0, Total=2550 [2022-11-20 11:08:01,347 INFO L87 Difference]: Start difference. First operand 204 states and 244 transitions. Second operand has 37 states, 28 states have (on average 3.3214285714285716) internal successors, (93), 26 states have internal predecessors, (93), 12 states have call successors, (33), 6 states have call predecessors, (33), 11 states have return successors, (30), 12 states have call predecessors, (30), 12 states have call successors, (30) [2022-11-20 11:08:01,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:08:01,946 INFO L93 Difference]: Finished difference Result 406 states and 477 transitions. [2022-11-20 11:08:01,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-20 11:08:01,947 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 28 states have (on average 3.3214285714285716) internal successors, (93), 26 states have internal predecessors, (93), 12 states have call successors, (33), 6 states have call predecessors, (33), 11 states have return successors, (30), 12 states have call predecessors, (30), 12 states have call successors, (30) Word has length 217 [2022-11-20 11:08:01,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:08:01,948 INFO L225 Difference]: With dead ends: 406 [2022-11-20 11:08:01,948 INFO L226 Difference]: Without dead ends: 231 [2022-11-20 11:08:01,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 227 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 43.3s TimeCoverageRelationStatistics Valid=172, Invalid=2473, Unknown=7, NotChecked=0, Total=2652 [2022-11-20 11:08:01,951 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 27 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1892 SdHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1256 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:08:01,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1892 Invalid, 1662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 350 Invalid, 0 Unknown, 1256 Unchecked, 0.5s Time] [2022-11-20 11:08:01,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-11-20 11:08:01,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 226. [2022-11-20 11:08:01,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 147 states have (on average 1.0952380952380953) internal successors, (161), 150 states have internal predecessors, (161), 50 states have call successors, (50), 26 states have call predecessors, (50), 28 states have return successors, (53), 49 states have call predecessors, (53), 49 states have call successors, (53) [2022-11-20 11:08:01,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 264 transitions. [2022-11-20 11:08:01,977 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 264 transitions. Word has length 217 [2022-11-20 11:08:01,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:08:01,978 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 264 transitions. [2022-11-20 11:08:01,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 28 states have (on average 3.3214285714285716) internal successors, (93), 26 states have internal predecessors, (93), 12 states have call successors, (33), 6 states have call predecessors, (33), 11 states have return successors, (30), 12 states have call predecessors, (30), 12 states have call successors, (30) [2022-11-20 11:08:01,978 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 264 transitions. [2022-11-20 11:08:01,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-11-20 11:08:01,981 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:08:01,982 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 11:08:02,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 11:08:02,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:08:02,198 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:08:02,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:08:02,199 INFO L85 PathProgramCache]: Analyzing trace with hash 771313271, now seen corresponding path program 1 times [2022-11-20 11:08:02,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:08:02,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372206507] [2022-11-20 11:08:02,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:08:02,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:08:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:08:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 11:08:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 11:08:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:08:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-20 11:08:02,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:08:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:08:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:08:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 11:08:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:08:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-20 11:08:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-20 11:08:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:08:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-20 11:08:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 11:08:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:08:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-20 11:08:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-20 11:08:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 11:08:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-20 11:08:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-20 11:08:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-20 11:08:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-20 11:08:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-20 11:08:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-20 11:08:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-20 11:08:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 11:08:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:08:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-11-20 11:08:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:02,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-11-20 11:08:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:03,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 11:08:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:03,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:08:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:03,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-20 11:08:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:03,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-20 11:08:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:03,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-11-20 11:08:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:03,054 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2022-11-20 11:08:03,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:08:03,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372206507] [2022-11-20 11:08:03,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372206507] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:08:03,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:08:03,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 11:08:03,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93922403] [2022-11-20 11:08:03,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:08:03,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 11:08:03,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:08:03,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 11:08:03,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:08:03,057 INFO L87 Difference]: Start difference. First operand 226 states and 264 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (34), 5 states have call predecessors, (34), 4 states have return successors, (31), 4 states have call predecessors, (31), 2 states have call successors, (31) [2022-11-20 11:08:03,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:08:03,881 INFO L93 Difference]: Finished difference Result 408 states and 479 transitions. [2022-11-20 11:08:03,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:08:03,881 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (34), 5 states have call predecessors, (34), 4 states have return successors, (31), 4 states have call predecessors, (31), 2 states have call successors, (31) Word has length 223 [2022-11-20 11:08:03,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:08:03,883 INFO L225 Difference]: With dead ends: 408 [2022-11-20 11:08:03,883 INFO L226 Difference]: Without dead ends: 221 [2022-11-20 11:08:03,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-20 11:08:03,884 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 137 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:08:03,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 813 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 11:08:03,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-11-20 11:08:03,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 212. [2022-11-20 11:08:03,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 138 states have (on average 1.0869565217391304) internal successors, (150), 141 states have internal predecessors, (150), 47 states have call successors, (47), 24 states have call predecessors, (47), 26 states have return successors, (49), 46 states have call predecessors, (49), 46 states have call successors, (49) [2022-11-20 11:08:03,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 246 transitions. [2022-11-20 11:08:03,907 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 246 transitions. Word has length 223 [2022-11-20 11:08:03,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:08:03,907 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 246 transitions. [2022-11-20 11:08:03,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (34), 5 states have call predecessors, (34), 4 states have return successors, (31), 4 states have call predecessors, (31), 2 states have call successors, (31) [2022-11-20 11:08:03,908 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 246 transitions. [2022-11-20 11:08:03,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-11-20 11:08:03,911 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:08:03,911 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 11:08:03,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 11:08:03,911 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:08:03,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:08:03,912 INFO L85 PathProgramCache]: Analyzing trace with hash -183391079, now seen corresponding path program 1 times [2022-11-20 11:08:03,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:08:03,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265606950] [2022-11-20 11:08:03,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:08:03,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:08:03,969 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 11:08:03,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [533017103] [2022-11-20 11:08:03,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:08:03,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:08:03,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:08:03,971 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:08:03,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 11:08:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:08:04,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 2746 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:08:04,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:08:04,730 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2022-11-20 11:08:04,730 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:08:04,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:08:04,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265606950] [2022-11-20 11:08:04,731 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 11:08:04,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533017103] [2022-11-20 11:08:04,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533017103] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:08:04,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:08:04,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:08:04,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010549595] [2022-11-20 11:08:04,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:08:04,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:08:04,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:08:04,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:08:04,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:08:04,734 INFO L87 Difference]: Start difference. First operand 212 states and 246 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (31), 4 states have call predecessors, (31), 2 states have call successors, (31) [2022-11-20 11:08:04,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:08:04,763 INFO L93 Difference]: Finished difference Result 212 states and 246 transitions. [2022-11-20 11:08:04,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:08:04,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (31), 4 states have call predecessors, (31), 2 states have call successors, (31) Word has length 223 [2022-11-20 11:08:04,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:08:04,764 INFO L225 Difference]: With dead ends: 212 [2022-11-20 11:08:04,765 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 11:08:04,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:08:04,766 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:08:04,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 272 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:08:04,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 11:08:04,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 11:08:04,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:08:04,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 11:08:04,767 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 223 [2022-11-20 11:08:04,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:08:04,768 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 11:08:04,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (31), 4 states have call predecessors, (31), 2 states have call successors, (31) [2022-11-20 11:08:04,768 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 11:08:04,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 11:08:04,771 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 11:08:04,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 11:08:04,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 11:08:04,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 11:08:06,219 INFO L899 garLoopResultBuilder]: For program point L6944-1(lines 6944 6946) no Hoare annotation was computed. [2022-11-20 11:08:06,219 INFO L895 garLoopResultBuilder]: At program point L6944(lines 6944 6946) the Hoare annotation is: (or (forall ((|aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116| Int) (|aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| Int) (|aux_div_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116| Int) (|v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse0 (+ (* 18446744073709551616 |aux_div_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116|) |aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116|))) (or (not (<= 0 |aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116|)) (not (<= |aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116| 8)) (not (= (select (select |#memory_int| |v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_3|) 0) (+ (* |aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| 442721857769029238784) (* 442721857769029238784 |aux_div_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116|) 442721857768999609256 (* |aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116| 24)))) (not (<= 0 .cse0)) (= .cse0 0) (not (< .cse0 18446744073709551616))))) (not (< 0 |#StackHeapBarrier|)) (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-20 11:08:06,220 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6943 6948) the Hoare annotation is: (or (forall ((|aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116| Int) (|aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| Int) (|aux_div_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116| Int) (|v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse0 (+ (* 18446744073709551616 |aux_div_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116|) |aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116|))) (or (not (<= 0 |aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116|)) (not (<= |aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116| 8)) (not (= (select (select |#memory_int| |v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_3|) 0) (+ (* |aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104| 442721857769029238784) (* 442721857769029238784 |aux_div_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116|) 442721857768999609256 (* |aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_5_104_116| 24)))) (not (<= 0 .cse0)) (= .cse0 0) (not (< .cse0 18446744073709551616))))) (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-20 11:08:06,220 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6943 6948) no Hoare annotation was computed. [2022-11-20 11:08:06,220 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6943 6948) no Hoare annotation was computed. [2022-11-20 11:08:06,220 INFO L902 garLoopResultBuilder]: At program point L10017-4(line 10017) the Hoare annotation is: true [2022-11-20 11:08:06,220 INFO L899 garLoopResultBuilder]: For program point L10017-5(line 10017) no Hoare annotation was computed. [2022-11-20 11:08:06,220 INFO L899 garLoopResultBuilder]: For program point L10017-7(line 10017) no Hoare annotation was computed. [2022-11-20 11:08:06,221 INFO L899 garLoopResultBuilder]: For program point L10017(line 10017) no Hoare annotation was computed. [2022-11-20 11:08:06,221 INFO L899 garLoopResultBuilder]: For program point L10017-2(line 10017) no Hoare annotation was computed. [2022-11-20 11:08:06,221 INFO L899 garLoopResultBuilder]: For program point L10017-3(line 10017) no Hoare annotation was computed. [2022-11-20 11:08:06,221 INFO L902 garLoopResultBuilder]: At program point aws_hash_table_is_validENTRY(lines 10015 10018) the Hoare annotation is: true [2022-11-20 11:08:06,221 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_is_validEXIT(lines 10015 10018) no Hoare annotation was computed. [2022-11-20 11:08:06,221 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_is_validFINAL(lines 10015 10018) no Hoare annotation was computed. [2022-11-20 11:08:06,221 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-11-20 11:08:06,222 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-11-20 11:08:06,222 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-11-20 11:08:06,222 INFO L899 garLoopResultBuilder]: For program point L7130(lines 7130 7134) no Hoare annotation was computed. [2022-11-20 11:08:06,222 INFO L899 garLoopResultBuilder]: For program point aws_mem_releaseEXIT(lines 7122 7135) no Hoare annotation was computed. [2022-11-20 11:08:06,222 INFO L902 garLoopResultBuilder]: At program point L7126(lines 7126 7128) the Hoare annotation is: true [2022-11-20 11:08:06,222 INFO L902 garLoopResultBuilder]: At program point aws_mem_releaseENTRY(lines 7122 7135) the Hoare annotation is: true [2022-11-20 11:08:06,223 INFO L899 garLoopResultBuilder]: For program point L7130-2(lines 7122 7135) no Hoare annotation was computed. [2022-11-20 11:08:06,223 INFO L899 garLoopResultBuilder]: For program point L7123-1(lines 7123 7125) no Hoare annotation was computed. [2022-11-20 11:08:06,223 INFO L902 garLoopResultBuilder]: At program point L7123(lines 7123 7125) the Hoare annotation is: true [2022-11-20 11:08:06,223 INFO L899 garLoopResultBuilder]: For program point L7126-1(lines 7126 7128) no Hoare annotation was computed. [2022-11-20 11:08:06,223 INFO L895 garLoopResultBuilder]: At program point hash_table_state_required_bytesENTRY(lines 10128 10140) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-11-20 11:08:06,223 INFO L899 garLoopResultBuilder]: For program point L10135-2(lines 10135 10137) no Hoare annotation was computed. [2022-11-20 11:08:06,224 INFO L895 garLoopResultBuilder]: At program point L10131(line 10131) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= hash_table_state_required_bytes_~required_bytes.offset |hash_table_state_required_bytes_#in~required_bytes.offset|) (= (select |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (= hash_table_state_required_bytes_~size |hash_table_state_required_bytes_#in~size|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (exists ((v_ArrVal_1472 Int)) (= (store |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base| v_ArrVal_1472) |#valid|)) (= hash_table_state_required_bytes_~required_bytes.base |hash_table_state_required_bytes_#in~required_bytes.base|) (= |hash_table_state_required_bytes_~#elemsize~0.offset| 0))) [2022-11-20 11:08:06,224 INFO L899 garLoopResultBuilder]: For program point L10131-1(line 10131) no Hoare annotation was computed. [2022-11-20 11:08:06,224 INFO L895 garLoopResultBuilder]: At program point L10135(line 10135) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= hash_table_state_required_bytes_~required_bytes.offset |hash_table_state_required_bytes_#in~required_bytes.offset|) (= (select |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (= (store |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base| (select |#valid| |hash_table_state_required_bytes_~#elemsize~0.base|)) |#valid|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= hash_table_state_required_bytes_~required_bytes.base |hash_table_state_required_bytes_#in~required_bytes.base|) (= (* |hash_table_state_required_bytes_#in~size| 24) |hash_table_state_required_bytes_#t~mem1321|))) [2022-11-20 11:08:06,224 INFO L899 garLoopResultBuilder]: For program point hash_table_state_required_bytesEXIT(lines 10128 10140) no Hoare annotation was computed. [2022-11-20 11:08:06,224 INFO L899 garLoopResultBuilder]: For program point L10135-1(line 10135) no Hoare annotation was computed. [2022-11-20 11:08:06,224 INFO L899 garLoopResultBuilder]: For program point L10131-2(lines 10131 10133) no Hoare annotation was computed. [2022-11-20 11:08:06,225 INFO L899 garLoopResultBuilder]: For program point hash_table_state_required_bytesFINAL(lines 10128 10140) no Hoare annotation was computed. [2022-11-20 11:08:06,225 INFO L902 garLoopResultBuilder]: At program point memset_override_0_implENTRY(lines 7397 7412) the Hoare annotation is: true [2022-11-20 11:08:06,225 INFO L899 garLoopResultBuilder]: For program point memset_override_0_implFINAL(lines 7397 7412) no Hoare annotation was computed. [2022-11-20 11:08:06,225 INFO L899 garLoopResultBuilder]: For program point L7403-1(line 7403) no Hoare annotation was computed. [2022-11-20 11:08:06,225 INFO L902 garLoopResultBuilder]: At program point L7403(line 7403) the Hoare annotation is: true [2022-11-20 11:08:06,225 INFO L899 garLoopResultBuilder]: For program point L7407-4(lines 7407 7409) no Hoare annotation was computed. [2022-11-20 11:08:06,226 INFO L902 garLoopResultBuilder]: At program point L7407-3(lines 7407 7409) the Hoare annotation is: true [2022-11-20 11:08:06,226 INFO L899 garLoopResultBuilder]: For program point L7407-2(lines 7407 7409) no Hoare annotation was computed. [2022-11-20 11:08:06,226 INFO L899 garLoopResultBuilder]: For program point memset_override_0_implEXIT(lines 7397 7412) no Hoare annotation was computed. [2022-11-20 11:08:06,226 INFO L902 garLoopResultBuilder]: At program point L7398(line 7398) the Hoare annotation is: true [2022-11-20 11:08:06,226 INFO L899 garLoopResultBuilder]: For program point L7400(line 7400) no Hoare annotation was computed. [2022-11-20 11:08:06,226 INFO L902 garLoopResultBuilder]: At program point L7398-1(line 7398) the Hoare annotation is: true [2022-11-20 11:08:06,226 INFO L899 garLoopResultBuilder]: For program point aws_mul_size_checkedEXIT(lines 2586 2594) no Hoare annotation was computed. [2022-11-20 11:08:06,227 INFO L899 garLoopResultBuilder]: For program point L2498-1(lines 2498 2499) no Hoare annotation was computed. [2022-11-20 11:08:06,227 INFO L899 garLoopResultBuilder]: For program point aws_mul_size_checkedFINAL(lines 2586 2594) no Hoare annotation was computed. [2022-11-20 11:08:06,227 INFO L895 garLoopResultBuilder]: At program point aws_mul_size_checkedENTRY(lines 2586 2594) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-11-20 11:08:06,227 INFO L895 garLoopResultBuilder]: At program point L2501(lines 2497 2502) the Hoare annotation is: (let ((.cse1 (= |old(#valid)| |#valid|)) (.cse0 (< 0 |#StackHeapBarrier|))) (or (not .cse0) (and (exists ((v_ArrVal_1473 Int) (|v___CPROVER_overflow_mult_~#c~1.base_66| Int)) (and (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_66|) 0) (= |#valid| (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_66| v_ArrVal_1473)))) (= (* |aws_mul_size_checked_#in~b#1| |aws_mul_size_checked_#in~a#1|) (select (select |#memory_int| |aws_mul_size_checked_#in~r#1.base|) |aws_mul_size_checked_#in~r#1.offset|)) (= ~tl_last_error~0 |old(~tl_last_error~0)|) .cse1 .cse0) (and (<= (+ |aws_mul_size_checked_aws_mul_u64_checked_#res#1| 1) 0) .cse1 .cse0))) [2022-11-20 11:08:06,228 INFO L895 garLoopResultBuilder]: At program point L2498(line 2498) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base| |aws_mul_size_checked_#in~r#1.base|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |aws_mul_size_checked_#in~a#1| |aws_mul_size_checked_aws_mul_u64_checked_~a#1|) (= |aws_mul_size_checked_#in~b#1| |aws_mul_size_checked_aws_mul_u64_checked_~b#1|) (= |old(#valid)| |#valid|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| |aws_mul_size_checked_#in~r#1.offset|))) [2022-11-20 11:08:06,228 INFO L899 garLoopResultBuilder]: For program point L2499-1(line 2499) no Hoare annotation was computed. [2022-11-20 11:08:06,228 INFO L895 garLoopResultBuilder]: At program point L2499(line 2499) the Hoare annotation is: (or (and (exists ((v_ArrVal_1473 Int) (|v___CPROVER_overflow_mult_~#c~1.base_66| Int)) (and (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_66|) 0) (= |#valid| (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_66| v_ArrVal_1473)))) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base| |aws_mul_size_checked_#in~r#1.base|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |aws_mul_size_checked_#in~a#1| |aws_mul_size_checked_aws_mul_u64_checked_~a#1|) (= |aws_mul_size_checked_#in~b#1| |aws_mul_size_checked_aws_mul_u64_checked_~b#1|) (= |old(#valid)| |#valid|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| |aws_mul_size_checked_#in~r#1.offset|)) (not (< 0 |#StackHeapBarrier|))) [2022-11-20 11:08:06,228 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-11-20 11:08:06,228 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-11-20 11:08:06,228 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-11-20 11:08:06,228 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2022-11-20 11:08:06,229 INFO L902 garLoopResultBuilder]: At program point ##fun~$Pointer$~TO~VOIDENTRY(line -1) the Hoare annotation is: true [2022-11-20 11:08:06,229 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~VOIDFINAL(line -1) no Hoare annotation was computed. [2022-11-20 11:08:06,229 INFO L899 garLoopResultBuilder]: For program point L6852(line 6852) no Hoare annotation was computed. [2022-11-20 11:08:06,229 INFO L895 garLoopResultBuilder]: At program point __CPROVER_overflow_plusENTRY(lines 248 251) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-20 11:08:06,229 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_plusFINAL(lines 248 251) no Hoare annotation was computed. [2022-11-20 11:08:06,229 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_plusEXIT(lines 248 251) no Hoare annotation was computed. [2022-11-20 11:08:06,230 INFO L902 garLoopResultBuilder]: At program point hash_table_state_is_validENTRY(lines 10026 10073) the Hoare annotation is: true [2022-11-20 11:08:06,230 INFO L899 garLoopResultBuilder]: For program point L10028(lines 10028 10032) no Hoare annotation was computed. [2022-11-20 11:08:06,230 INFO L899 garLoopResultBuilder]: For program point hash_table_state_is_validEXIT(lines 10026 10073) no Hoare annotation was computed. [2022-11-20 11:08:06,230 INFO L899 garLoopResultBuilder]: For program point hash_table_state_is_validFINAL(lines 10026 10073) no Hoare annotation was computed. [2022-11-20 11:08:06,230 INFO L899 garLoopResultBuilder]: For program point L10054-1(line 10054) no Hoare annotation was computed. [2022-11-20 11:08:06,230 INFO L902 garLoopResultBuilder]: At program point L10054(line 10054) the Hoare annotation is: true [2022-11-20 11:08:06,230 INFO L902 garLoopResultBuilder]: At program point my_memsetENTRY(lines 7414 7416) the Hoare annotation is: true [2022-11-20 11:08:06,231 INFO L899 garLoopResultBuilder]: For program point my_memsetFINAL(lines 7414 7416) no Hoare annotation was computed. [2022-11-20 11:08:06,231 INFO L899 garLoopResultBuilder]: For program point L7415-1(line 7415) no Hoare annotation was computed. [2022-11-20 11:08:06,231 INFO L902 garLoopResultBuilder]: At program point L7415(line 7415) the Hoare annotation is: true [2022-11-20 11:08:06,231 INFO L899 garLoopResultBuilder]: For program point my_memsetEXIT(lines 7414 7416) no Hoare annotation was computed. [2022-11-20 11:08:06,231 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-11-20 11:08:06,231 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-11-20 11:08:06,231 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-20 11:08:06,232 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-11-20 11:08:06,232 INFO L895 garLoopResultBuilder]: At program point aws_raise_errorENTRY(lines 1988 1999) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (= ~tl_last_error~0 |old(~tl_last_error~0)|)) [2022-11-20 11:08:06,232 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorFINAL(lines 1988 1999) no Hoare annotation was computed. [2022-11-20 11:08:06,232 INFO L899 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2022-11-20 11:08:06,232 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorEXIT(lines 1988 1999) no Hoare annotation was computed. [2022-11-20 11:08:06,232 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6950 6952) no Hoare annotation was computed. [2022-11-20 11:08:06,232 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6950 6952) no Hoare annotation was computed. [2022-11-20 11:08:06,233 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6950 6952) the Hoare annotation is: true [2022-11-20 11:08:06,233 INFO L895 garLoopResultBuilder]: At program point __CPROVER_overflow_multENTRY(lines 253 256) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-20 11:08:06,233 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_multEXIT(lines 253 256) no Hoare annotation was computed. [2022-11-20 11:08:06,233 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_multFINAL(lines 253 256) no Hoare annotation was computed. [2022-11-20 11:08:06,233 INFO L899 garLoopResultBuilder]: For program point aws_is_power_of_twoFINAL(lines 2626 2631) no Hoare annotation was computed. [2022-11-20 11:08:06,233 INFO L899 garLoopResultBuilder]: For program point aws_is_power_of_twoEXIT(lines 2626 2631) no Hoare annotation was computed. [2022-11-20 11:08:06,234 INFO L902 garLoopResultBuilder]: At program point aws_is_power_of_twoENTRY(lines 2626 2631) the Hoare annotation is: true [2022-11-20 11:08:06,234 INFO L895 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: (let ((.cse0 (= |old(#valid)| |#valid|))) (or (and (= (select (select |#memory_int| |aws_add_size_checked_#in~r#1.base|) |aws_add_size_checked_#in~r#1.offset|) (+ |aws_add_size_checked_#in~b#1| |aws_add_size_checked_#in~a#1|)) (exists ((v_ArrVal_1473 Int) (|v___CPROVER_overflow_mult_~#c~1.base_66| Int)) (and (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_66|) 0) (= |#valid| (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_66| v_ArrVal_1473)))) .cse0) (not (< 0 |#StackHeapBarrier|)) (and (<= (+ |aws_add_size_checked_aws_add_u64_checked_#res#1| 1) 0) .cse0))) [2022-11-20 11:08:06,234 INFO L895 garLoopResultBuilder]: At program point aws_add_size_checkedENTRY(lines 2613 2621) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-11-20 11:08:06,234 INFO L895 garLoopResultBuilder]: At program point L2542(line 2542) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |aws_add_size_checked_#in~b#1| |aws_add_size_checked_aws_add_u64_checked_~b#1|) (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |aws_add_size_checked_#in~r#1.base| |aws_add_size_checked_aws_add_u64_checked_~r#1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |aws_add_size_checked_#in~r#1.offset| |aws_add_size_checked_aws_add_u64_checked_~r#1.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|) (= |aws_add_size_checked_#in~a#1| |aws_add_size_checked_aws_add_u64_checked_~a#1|))) [2022-11-20 11:08:06,234 INFO L899 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2022-11-20 11:08:06,235 INFO L895 garLoopResultBuilder]: At program point L2543(line 2543) the Hoare annotation is: (or (and (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (not (< 0 |#StackHeapBarrier|))) [2022-11-20 11:08:06,235 INFO L899 garLoopResultBuilder]: For program point L2542-1(lines 2542 2543) no Hoare annotation was computed. [2022-11-20 11:08:06,235 INFO L899 garLoopResultBuilder]: For program point aws_add_size_checkedFINAL(lines 2613 2621) no Hoare annotation was computed. [2022-11-20 11:08:06,235 INFO L899 garLoopResultBuilder]: For program point aws_add_size_checkedEXIT(lines 2613 2621) no Hoare annotation was computed. [2022-11-20 11:08:06,235 INFO L899 garLoopResultBuilder]: For program point L6815-1(line 6815) no Hoare annotation was computed. [2022-11-20 11:08:06,235 INFO L895 garLoopResultBuilder]: At program point L6815(line 6815) the Hoare annotation is: (let ((.cse0 (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616))) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset| 0) (not (= .cse0 0)) (<= .cse0 8) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) 1) (< 0 |#StackHeapBarrier|))) [2022-11-20 11:08:06,236 INFO L899 garLoopResultBuilder]: For program point L9276(lines 9276 9278) no Hoare annotation was computed. [2022-11-20 11:08:06,236 INFO L895 garLoopResultBuilder]: At program point L9276-2(lines 9276 9278) the Hoare annotation is: false [2022-11-20 11:08:06,236 INFO L899 garLoopResultBuilder]: For program point L6815-3(line 6815) no Hoare annotation was computed. [2022-11-20 11:08:06,236 INFO L895 garLoopResultBuilder]: At program point L6815-2(line 6815) the Hoare annotation is: (let ((.cse0 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|)) (.cse1 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|))) (.cse2 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|)) (.cse3 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|)) (.cse4 (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) 1)) (.cse5 (< 0 |#StackHeapBarrier|))) (or (and .cse0 (<= (+ |ULTIMATE.start_ensure_allocated_hash_table_#t~ret548#1| 1) 0) .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse6 (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616))) (and (= (+ (* |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 24) 442721857768999609256) (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|)) .cse0 .cse1 (= |ULTIMATE.start_ensure_allocated_hash_table_#t~ret548#1| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) .cse2 .cse3 (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset| 0) (not (= .cse6 0)) (<= .cse6 8) .cse4 .cse5)))) [2022-11-20 11:08:06,236 INFO L899 garLoopResultBuilder]: For program point L6840-1(line 6840) no Hoare annotation was computed. [2022-11-20 11:08:06,236 INFO L895 garLoopResultBuilder]: At program point L6840(line 6840) the Hoare annotation is: false [2022-11-20 11:08:06,237 INFO L899 garLoopResultBuilder]: For program point L9276-3(lines 9276 9278) no Hoare annotation was computed. [2022-11-20 11:08:06,237 INFO L895 garLoopResultBuilder]: At program point L9945(line 9945) the Hoare annotation is: false [2022-11-20 11:08:06,237 INFO L899 garLoopResultBuilder]: For program point L9945-1(line 9945) no Hoare annotation was computed. [2022-11-20 11:08:06,237 INFO L899 garLoopResultBuilder]: For program point L7179-1(line 7179) no Hoare annotation was computed. [2022-11-20 11:08:06,237 INFO L895 garLoopResultBuilder]: At program point L7179(line 7179) the Hoare annotation is: false [2022-11-20 11:08:06,237 INFO L899 garLoopResultBuilder]: For program point L9285(lines 9285 9287) no Hoare annotation was computed. [2022-11-20 11:08:06,237 INFO L895 garLoopResultBuilder]: At program point L9954(line 9954) the Hoare annotation is: false [2022-11-20 11:08:06,238 INFO L899 garLoopResultBuilder]: For program point L6816-1(line 6816) no Hoare annotation was computed. [2022-11-20 11:08:06,238 INFO L895 garLoopResultBuilder]: At program point L6816(line 6816) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 0)) (.cse1 (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616))) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|)) (= .cse0 (+ (* |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 24) 442721857768999609256)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset| 0) (not (= .cse1 0)) (= .cse0 |ULTIMATE.start_ensure_allocated_hash_table_#t~mem549#1|) (<= .cse1 8) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) 1) (< 0 |#StackHeapBarrier|))) [2022-11-20 11:08:06,238 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 11:08:06,238 INFO L899 garLoopResultBuilder]: For program point L9954-1(line 9954) no Hoare annotation was computed. [2022-11-20 11:08:06,238 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-20 11:08:06,238 INFO L899 garLoopResultBuilder]: For program point L6841-1(line 6841) no Hoare annotation was computed. [2022-11-20 11:08:06,239 INFO L895 garLoopResultBuilder]: At program point L6841(line 6841) the Hoare annotation is: false [2022-11-20 11:08:06,239 INFO L899 garLoopResultBuilder]: For program point L9938(line 9938) no Hoare annotation was computed. [2022-11-20 11:08:06,239 INFO L895 garLoopResultBuilder]: At program point L6833(lines 6831 6834) the Hoare annotation is: false [2022-11-20 11:08:06,239 INFO L902 garLoopResultBuilder]: At program point L10161(line 10161) the Hoare annotation is: true [2022-11-20 11:08:06,239 INFO L899 garLoopResultBuilder]: For program point L9938-2(lines 9938 9951) no Hoare annotation was computed. [2022-11-20 11:08:06,239 INFO L899 garLoopResultBuilder]: For program point L7180-1(line 7180) no Hoare annotation was computed. [2022-11-20 11:08:06,239 INFO L899 garLoopResultBuilder]: For program point L235(line 235) no Hoare annotation was computed. [2022-11-20 11:08:06,240 INFO L899 garLoopResultBuilder]: For program point L9938-3(lines 9938 9951) no Hoare annotation was computed. [2022-11-20 11:08:06,240 INFO L895 garLoopResultBuilder]: At program point L7180(line 7180) the Hoare annotation is: false [2022-11-20 11:08:06,240 INFO L899 garLoopResultBuilder]: For program point L6825-1(line 6825) no Hoare annotation was computed. [2022-11-20 11:08:06,240 INFO L895 garLoopResultBuilder]: At program point L6825(line 6825) the Hoare annotation is: false [2022-11-20 11:08:06,240 INFO L899 garLoopResultBuilder]: For program point L9278-1(line 9278) no Hoare annotation was computed. [2022-11-20 11:08:06,240 INFO L899 garLoopResultBuilder]: For program point L9947(lines 9947 9949) no Hoare annotation was computed. [2022-11-20 11:08:06,240 INFO L895 garLoopResultBuilder]: At program point L10145(line 10145) the Hoare annotation is: false [2022-11-20 11:08:06,241 INFO L895 garLoopResultBuilder]: At program point L10145-1(line 10145) the Hoare annotation is: false [2022-11-20 11:08:06,241 INFO L899 garLoopResultBuilder]: For program point L10145-2(line 10145) no Hoare annotation was computed. [2022-11-20 11:08:06,241 INFO L895 garLoopResultBuilder]: At program point L9278(line 9278) the Hoare annotation is: false [2022-11-20 11:08:06,241 INFO L899 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2022-11-20 11:08:06,241 INFO L899 garLoopResultBuilder]: For program point L9939-1(lines 9939 9950) no Hoare annotation was computed. [2022-11-20 11:08:06,241 INFO L895 garLoopResultBuilder]: At program point L10154(line 10154) the Hoare annotation is: false [2022-11-20 11:08:06,242 INFO L895 garLoopResultBuilder]: At program point L9939-3(lines 9939 9950) the Hoare annotation is: false [2022-11-20 11:08:06,242 INFO L895 garLoopResultBuilder]: At program point L9939-4(lines 9939 9950) the Hoare annotation is: false [2022-11-20 11:08:06,242 INFO L895 garLoopResultBuilder]: At program point L9295(lines 9295 9297) the Hoare annotation is: false [2022-11-20 11:08:06,242 INFO L899 garLoopResultBuilder]: For program point L7181-1(line 7181) no Hoare annotation was computed. [2022-11-20 11:08:06,242 INFO L899 garLoopResultBuilder]: For program point L9295-1(lines 9295 9297) no Hoare annotation was computed. [2022-11-20 11:08:06,242 INFO L895 garLoopResultBuilder]: At program point L7181(line 7181) the Hoare annotation is: false [2022-11-20 11:08:06,242 INFO L899 garLoopResultBuilder]: For program point L10154-1(line 10154) no Hoare annotation was computed. [2022-11-20 11:08:06,243 INFO L895 garLoopResultBuilder]: At program point L9948(line 9948) the Hoare annotation is: false [2022-11-20 11:08:06,243 INFO L899 garLoopResultBuilder]: For program point L9948-1(line 9948) no Hoare annotation was computed. [2022-11-20 11:08:06,243 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) 1) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 8)) [2022-11-20 11:08:06,243 INFO L895 garLoopResultBuilder]: At program point L6843(lines 6837 6844) the Hoare annotation is: false [2022-11-20 11:08:06,243 INFO L899 garLoopResultBuilder]: For program point L6810-1(line 6810) no Hoare annotation was computed. [2022-11-20 11:08:06,243 INFO L895 garLoopResultBuilder]: At program point L9957(line 9957) the Hoare annotation is: false [2022-11-20 11:08:06,244 INFO L895 garLoopResultBuilder]: At program point L9957-1(line 9957) the Hoare annotation is: false [2022-11-20 11:08:06,244 INFO L895 garLoopResultBuilder]: At program point L10147(line 10147) the Hoare annotation is: false [2022-11-20 11:08:06,244 INFO L899 garLoopResultBuilder]: For program point L9957-2(line 9957) no Hoare annotation was computed. [2022-11-20 11:08:06,244 INFO L899 garLoopResultBuilder]: For program point L10147-1(line 10147) no Hoare annotation was computed. [2022-11-20 11:08:06,244 INFO L895 garLoopResultBuilder]: At program point L6811-1(line 6811) the Hoare annotation is: (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset| 0) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 8) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) 1) (< 0 |#StackHeapBarrier|)) [2022-11-20 11:08:06,244 INFO L895 garLoopResultBuilder]: At program point L6811(line 6811) the Hoare annotation is: (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) 1) (< 0 |#StackHeapBarrier|) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 8)) [2022-11-20 11:08:06,245 INFO L899 garLoopResultBuilder]: For program point L9941(lines 9941 9943) no Hoare annotation was computed. [2022-11-20 11:08:06,245 INFO L895 garLoopResultBuilder]: At program point L9272(lines 9272 9298) the Hoare annotation is: false [2022-11-20 11:08:06,245 INFO L899 garLoopResultBuilder]: For program point L9933(lines 9933 9958) no Hoare annotation was computed. [2022-11-20 11:08:06,245 INFO L895 garLoopResultBuilder]: At program point L10156(lines 10156 10158) the Hoare annotation is: false [2022-11-20 11:08:06,245 INFO L899 garLoopResultBuilder]: For program point L10156-1(lines 10156 10158) no Hoare annotation was computed. [2022-11-20 11:08:06,245 INFO L899 garLoopResultBuilder]: For program point L7175(lines 7175 7183) no Hoare annotation was computed. [2022-11-20 11:08:06,245 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 11:08:06,246 INFO L899 garLoopResultBuilder]: For program point L6812-1(line 6812) no Hoare annotation was computed. [2022-11-20 11:08:06,246 INFO L895 garLoopResultBuilder]: At program point L6812(line 6812) the Hoare annotation is: (let ((.cse0 (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616))) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (or (and (= |ULTIMATE.start_ensure_allocated_hash_table_#t~ret547#1| 1) (not (= .cse0 0))) (and (= |ULTIMATE.start_ensure_allocated_hash_table_#t~ret547#1| 0) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 1)))) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset| 0) (<= .cse0 8) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) 1) (< 0 |#StackHeapBarrier|))) [2022-11-20 11:08:06,246 INFO L895 garLoopResultBuilder]: At program point L9273(lines 9273 9275) the Hoare annotation is: false [2022-11-20 11:08:06,246 INFO L899 garLoopResultBuilder]: For program point L9273-1(lines 9273 9275) no Hoare annotation was computed. [2022-11-20 11:08:06,246 INFO L895 garLoopResultBuilder]: At program point L9934-1(line 9934) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|))) (and (not (= .cse0 |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) |ULTIMATE.start_aws_hash_table_clean_up_~state~4#1.offset|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#empty_slot_idx~1#1.base|)) (not (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base| |ULTIMATE.start_hash_table_state_has_an_empty_slot_~rval#1.base|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base| |ULTIMATE.start_aws_hash_table_clean_up_~map#1.base|) (= |ULTIMATE.start_aws_hash_table_clean_up_~map#1.offset| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.offset|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_clear_#t~ret1244#1| 0) (= .cse0 |ULTIMATE.start_aws_hash_table_clean_up_~state~4#1.base|) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clean_up_harness_~#map~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_clean_up_~map#1.base|) |ULTIMATE.start_aws_hash_table_clean_up_~map#1.offset|) 0)) (< 0 |#StackHeapBarrier|))) [2022-11-20 11:08:06,247 INFO L899 garLoopResultBuilder]: For program point L9934-2(line 9934) no Hoare annotation was computed. [2022-11-20 11:08:06,247 INFO L895 garLoopResultBuilder]: At program point L9290(line 9290) the Hoare annotation is: false [2022-11-20 11:08:06,247 INFO L895 garLoopResultBuilder]: At program point L9934(line 9934) the Hoare annotation is: false [2022-11-20 11:08:06,247 INFO L899 garLoopResultBuilder]: For program point L7176(lines 7176 7182) no Hoare annotation was computed. [2022-11-20 11:08:06,247 INFO L899 garLoopResultBuilder]: For program point L9290-1(line 9290) no Hoare annotation was computed. [2022-11-20 11:08:06,247 INFO L899 garLoopResultBuilder]: For program point L6821(lines 6821 6828) no Hoare annotation was computed. [2022-11-20 11:08:06,247 INFO L899 garLoopResultBuilder]: For program point L10141(lines 10141 10160) no Hoare annotation was computed. [2022-11-20 11:08:06,248 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 11:08:06,248 INFO L899 garLoopResultBuilder]: For program point L7185(lines 7185 7187) no Hoare annotation was computed. [2022-11-20 11:08:06,248 INFO L895 garLoopResultBuilder]: At program point L6822(line 6822) the Hoare annotation is: false [2022-11-20 11:08:06,248 INFO L899 garLoopResultBuilder]: For program point L6822-1(line 6822) no Hoare annotation was computed. [2022-11-20 11:08:06,248 INFO L899 garLoopResultBuilder]: For program point L6839-1(line 6839) no Hoare annotation was computed. [2022-11-20 11:08:06,248 INFO L895 garLoopResultBuilder]: At program point L6839(line 6839) the Hoare annotation is: false [2022-11-20 11:08:06,248 INFO L899 garLoopResultBuilder]: For program point L9944(lines 9944 9946) no Hoare annotation was computed. [2022-11-20 11:08:06,249 INFO L899 garLoopResultBuilder]: For program point L9944-2(lines 9944 9946) no Hoare annotation was computed. [2022-11-20 11:08:06,249 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-11-20 11:08:06,249 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-11-20 11:08:06,249 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-11-20 11:08:06,249 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-11-20 11:08:06,249 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-11-20 11:08:06,249 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-11-20 11:08:06,253 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:08:06,255 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 11:08:06,265 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_66,QUANTIFIED] [2022-11-20 11:08:06,266 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1473,QUANTIFIED] [2022-11-20 11:08:06,266 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_66,QUANTIFIED] [2022-11-20 11:08:06,272 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_66,QUANTIFIED] [2022-11-20 11:08:06,272 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1473,QUANTIFIED] [2022-11-20 11:08:06,272 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_66,QUANTIFIED] [2022-11-20 11:08:06,278 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_66,QUANTIFIED] [2022-11-20 11:08:06,279 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1473,QUANTIFIED] [2022-11-20 11:08:06,279 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_66,QUANTIFIED] [2022-11-20 11:08:06,279 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_66,QUANTIFIED] [2022-11-20 11:08:06,280 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1473,QUANTIFIED] [2022-11-20 11:08:06,280 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_66,QUANTIFIED] [2022-11-20 11:08:06,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:08:06 BoogieIcfgContainer [2022-11-20 11:08:06,282 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 11:08:06,283 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 11:08:06,283 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 11:08:06,283 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 11:08:06,284 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:59:03" (3/4) ... [2022-11-20 11:08:06,287 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 11:08:06,293 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-11-20 11:08:06,294 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_table_is_valid [2022-11-20 11:08:06,294 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_is_valid [2022-11-20 11:08:06,294 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure my_memset [2022-11-20 11:08:06,294 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-11-20 11:08:06,294 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mem_release [2022-11-20 11:08:06,294 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_required_bytes [2022-11-20 11:08:06,294 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-20 11:08:06,295 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure memset_override_0_impl [2022-11-20 11:08:06,295 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2022-11-20 11:08:06,295 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-11-20 11:08:06,295 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_mult [2022-11-20 11:08:06,295 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_is_power_of_two [2022-11-20 11:08:06,295 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_add_size_checked [2022-11-20 11:08:06,295 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mul_size_checked [2022-11-20 11:08:06,295 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-11-20 11:08:06,296 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2022-11-20 11:08:06,296 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-20 11:08:06,296 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_plus [2022-11-20 11:08:06,316 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 161 nodes and edges [2022-11-20 11:08:06,318 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 77 nodes and edges [2022-11-20 11:08:06,319 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-11-20 11:08:06,320 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-11-20 11:08:06,321 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-20 11:08:06,322 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-20 11:08:06,322 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-20 11:08:06,323 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 11:08:06,360 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0 < unknown-#StackHeapBarrier-unknown) || (((((\exists v_ArrVal_1473 : int, v___CPROVER_overflow_mult_~#c~1.base_66 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_66] == 0 && \valid == \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_66 := v_ArrVal_1473]) && \old(b) * \old(a) == unknown-#memory_int-unknown[r][r]) && tl_last_error == \old(tl_last_error)) && \old(\valid) == \valid) && 0 < unknown-#StackHeapBarrier-unknown)) || ((\result + 1 <= 0 && \old(\valid) == \valid) && 0 < unknown-#StackHeapBarrier-unknown) [2022-11-20 11:08:06,361 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((unknown-#memory_int-unknown[r][r] == \old(b) + \old(a) && (\exists v_ArrVal_1473 : int, v___CPROVER_overflow_mult_~#c~1.base_66 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_66] == 0 && \valid == \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_66 := v_ArrVal_1473])) && \old(\valid) == \valid) || !(0 < unknown-#StackHeapBarrier-unknown)) || (\result + 1 <= 0 && \old(\valid) == \valid) [2022-11-20 11:08:06,720 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 11:08:06,720 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 11:08:06,721 INFO L158 Benchmark]: Toolchain (without parser) took 549031.00ms. Allocated memory was 157.3MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 109.8MB in the beginning and 1.1GB in the end (delta: -989.0MB). Peak memory consumption was 510.1MB. Max. memory is 16.1GB. [2022-11-20 11:08:06,721 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 115.3MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:08:06,722 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3905.82ms. Allocated memory was 157.3MB in the beginning and 211.8MB in the end (delta: 54.5MB). Free memory was 109.2MB in the beginning and 124.4MB in the end (delta: -15.2MB). Peak memory consumption was 104.5MB. Max. memory is 16.1GB. [2022-11-20 11:08:06,722 INFO L158 Benchmark]: Boogie Procedure Inliner took 243.27ms. Allocated memory is still 211.8MB. Free memory was 124.4MB in the beginning and 112.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 11:08:06,722 INFO L158 Benchmark]: Boogie Preprocessor took 70.69ms. Allocated memory is still 211.8MB. Free memory was 112.9MB in the beginning and 105.5MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-20 11:08:06,723 INFO L158 Benchmark]: RCFGBuilder took 1843.65ms. Allocated memory is still 211.8MB. Free memory was 105.5MB in the beginning and 117.8MB in the end (delta: -12.2MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. [2022-11-20 11:08:06,723 INFO L158 Benchmark]: TraceAbstraction took 542522.91ms. Allocated memory was 211.8MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 116.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 340.2MB. Max. memory is 16.1GB. [2022-11-20 11:08:06,724 INFO L158 Benchmark]: Witness Printer took 437.63ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 123.7MB). Peak memory consumption was 123.7MB. Max. memory is 16.1GB. [2022-11-20 11:08:06,725 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.30ms. Allocated memory is still 115.3MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3905.82ms. Allocated memory was 157.3MB in the beginning and 211.8MB in the end (delta: 54.5MB). Free memory was 109.2MB in the beginning and 124.4MB in the end (delta: -15.2MB). Peak memory consumption was 104.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 243.27ms. Allocated memory is still 211.8MB. Free memory was 124.4MB in the beginning and 112.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.69ms. Allocated memory is still 211.8MB. Free memory was 112.9MB in the beginning and 105.5MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1843.65ms. Allocated memory is still 211.8MB. Free memory was 105.5MB in the beginning and 117.8MB in the end (delta: -12.2MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. * TraceAbstraction took 542522.91ms. Allocated memory was 211.8MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 116.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 340.2MB. Max. memory is 16.1GB. * Witness Printer took 437.63ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 123.7MB). Peak memory consumption was 123.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_66,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_66,QUANTIFIED] * 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 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 20 procedures, 192 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 542.4s, OverallIterations: 16, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 17.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2765 SdHoareTripleChecker+Valid, 13.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2626 mSDsluCounter, 12936 SdHoareTripleChecker+Invalid, 11.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1256 IncrementalHoareTripleChecker+Unchecked, 10561 mSDsCounter, 1507 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12065 IncrementalHoareTripleChecker+Invalid, 14828 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1507 mSolverCounterUnsat, 2375 mSDtfsCounter, 12065 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2376 GetRequests, 2097 SyntacticMatches, 6 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1589 ImplicationChecksByTransitivity, 47.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=14, InterpolantAutomatonStates: 205, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 208 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 75 LocationsWithAnnotation, 648 PreInvPairs, 679 NumberOfFragments, 951 HoareAnnotationTreeSize, 648 FomulaSimplifications, 1250 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 75 FomulaSimplificationsInter, 1407 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 11.4s SatisfiabilityAnalysisTime, 507.6s InterpolantComputationTime, 3524 NumberOfCodeBlocks, 3524 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 3555 ConstructedInterpolants, 48 QuantifiedInterpolants, 8626 SizeOfPredicates, 62 NumberOfNonLiveVariables, 17854 ConjunctsInSsa, 488 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 5351/5422 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6831]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7407]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9939]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6837]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2497]: Loop Invariant [2022-11-20 11:08:06,747 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_66,QUANTIFIED] [2022-11-20 11:08:06,747 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1473,QUANTIFIED] [2022-11-20 11:08:06,747 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_66,QUANTIFIED] [2022-11-20 11:08:06,750 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_66,QUANTIFIED] [2022-11-20 11:08:06,750 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1473,QUANTIFIED] [2022-11-20 11:08:06,750 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_66,QUANTIFIED] Derived loop invariant: (!(0 < unknown-#StackHeapBarrier-unknown) || (((((\exists v_ArrVal_1473 : int, v___CPROVER_overflow_mult_~#c~1.base_66 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_66] == 0 && \valid == \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_66 := v_ArrVal_1473]) && \old(b) * \old(a) == unknown-#memory_int-unknown[r][r]) && tl_last_error == \old(tl_last_error)) && \old(\valid) == \valid) && 0 < unknown-#StackHeapBarrier-unknown)) || ((\result + 1 <= 0 && \old(\valid) == \valid) && 0 < unknown-#StackHeapBarrier-unknown) - InvariantResult [Line: 2541]: Loop Invariant [2022-11-20 11:08:06,759 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_66,QUANTIFIED] [2022-11-20 11:08:06,759 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1473,QUANTIFIED] [2022-11-20 11:08:06,759 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_66,QUANTIFIED] [2022-11-20 11:08:06,760 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_66,QUANTIFIED] [2022-11-20 11:08:06,760 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1473,QUANTIFIED] [2022-11-20 11:08:06,760 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_66,QUANTIFIED] Derived loop invariant: (((unknown-#memory_int-unknown[r][r] == \old(b) + \old(a) && (\exists v_ArrVal_1473 : int, v___CPROVER_overflow_mult_~#c~1.base_66 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_66] == 0 && \valid == \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_66 := v_ArrVal_1473])) && \old(\valid) == \valid) || !(0 < unknown-#StackHeapBarrier-unknown)) || (\result + 1 <= 0 && \old(\valid) == \valid) - InvariantResult [Line: 10161]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9272]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9939]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-11-20 11:08:06,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9dc9405e-6099-4928-8db1-0bccaa3aa843/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE