./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/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_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/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_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/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 0aec0bb8b8715e014581c4eef5e1e25c7e0452a528f8abdf2f2a721d17b0fa7f --- 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 12:04:13,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:04:13,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:04:13,283 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:04:13,284 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:04:13,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:04:13,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:04:13,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:04:13,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:04:13,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:04:13,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:04:13,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:04:13,307 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:04:13,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:04:13,309 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:04:13,315 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:04:13,316 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:04:13,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:04:13,319 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:04:13,320 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:04:13,322 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:04:13,326 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:04:13,328 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:04:13,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:04:13,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:04:13,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:04:13,339 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:04:13,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:04:13,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:04:13,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:04:13,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:04:13,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:04:13,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:04:13,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:04:13,348 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:04:13,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:04:13,349 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:04:13,349 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:04:13,349 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:04:13,351 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:04:13,352 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:04:13,352 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-20 12:04:13,395 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:04:13,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:04:13,396 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:04:13,396 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:04:13,397 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:04:13,398 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:04:13,398 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:04:13,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:04:13,399 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:04:13,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:04:13,400 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:04:13,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:04:13,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:04:13,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:04:13,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:04:13,401 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:04:13,401 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:04:13,401 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:04:13,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:04:13,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:04:13,402 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:04:13,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:04:13,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:04:13,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:04:13,403 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:04:13,403 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:04:13,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:04:13,403 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:04:13,404 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:04:13,404 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:04:13,405 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_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/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_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/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 -> 0aec0bb8b8715e014581c4eef5e1e25c7e0452a528f8abdf2f2a721d17b0fa7f [2022-11-20 12:04:13,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:04:13,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:04:13,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:04:13,781 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:04:13,782 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:04:13,783 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i [2022-11-20 12:04:16,944 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:04:17,464 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:04:17,466 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i [2022-11-20 12:04:17,513 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/data/dff2e33af/06c8ecb064254a13af5a7160b2cfa2ac/FLAGeb344dd99 [2022-11-20 12:04:17,565 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/data/dff2e33af/06c8ecb064254a13af5a7160b2cfa2ac [2022-11-20 12:04:17,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:04:17,575 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:04:17,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:04:17,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:04:17,597 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:04:17,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:04:17" (1/1) ... [2022-11-20 12:04:17,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a6f44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:04:17, skipping insertion in model container [2022-11-20 12:04:17,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:04:17" (1/1) ... [2022-11-20 12:04:17,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:04:17,759 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:04:18,078 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_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4494,4507] [2022-11-20 12:04:18,089 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_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4554,4567] [2022-11-20 12:04:18,965 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:04:18,966 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:04:18,967 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:04:18,968 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:04:18,970 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:04:18,984 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:04:18,994 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:04:18,997 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:04:18,999 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:04:19,007 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:04:19,013 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:04:19,014 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:04:19,021 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:04:19,488 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-20 12:04:19,490 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-20 12:04:19,491 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-20 12:04:19,493 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-20 12:04:19,494 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-20 12:04:19,495 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-20 12:04:19,496 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-20 12:04:19,497 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-20 12:04:19,497 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-20 12:04:19,498 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-20 12:04:19,646 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-20 12:04:19,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:04:19,700 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:04:19,714 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_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4494,4507] [2022-11-20 12:04:19,715 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_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4554,4567] [2022-11-20 12:04:19,762 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:04:19,763 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:04:19,763 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:04:19,764 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:04:19,765 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:04:19,775 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:04:19,775 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:04:19,777 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:04:19,777 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:04:19,779 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:04:19,780 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:04:19,780 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:04:19,781 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 12:04:19,866 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-20 12:04:19,868 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-20 12:04:19,869 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-20 12:04:19,870 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-20 12:04:19,872 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-20 12:04:19,873 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-20 12:04:19,874 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-20 12:04:19,874 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-20 12:04:19,875 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-20 12:04:19,876 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-20 12:04:19,905 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-20 12:04:19,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:04:20,197 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:04:20,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:04:20 WrapperNode [2022-11-20 12:04:20,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:04:20,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:04:20,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:04:20,200 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:04:20,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:04:20" (1/1) ... [2022-11-20 12:04:20,303 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:04:20" (1/1) ... [2022-11-20 12:04:20,347 INFO L138 Inliner]: procedures = 679, calls = 1038, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 57 [2022-11-20 12:04:20,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:04:20,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:04:20,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:04:20,352 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:04:20,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:04:20" (1/1) ... [2022-11-20 12:04:20,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:04:20" (1/1) ... [2022-11-20 12:04:20,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:04:20" (1/1) ... [2022-11-20 12:04:20,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:04:20" (1/1) ... [2022-11-20 12:04:20,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:04:20" (1/1) ... [2022-11-20 12:04:20,410 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:04:20" (1/1) ... [2022-11-20 12:04:20,414 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:04:20" (1/1) ... [2022-11-20 12:04:20,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:04:20" (1/1) ... [2022-11-20 12:04:20,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:04:20,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:04:20,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:04:20,438 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:04:20,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:04:20" (1/1) ... [2022-11-20 12:04:20,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:04:20,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:04:20,474 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:04:20,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:04:20,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:04:20,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-20 12:04:20,531 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-20 12:04:20,532 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-11-20 12:04:20,532 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-11-20 12:04:20,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:04:20,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 12:04:20,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:04:20,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:04:20,534 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-20 12:04:20,535 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-20 12:04:20,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:04:20,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 12:04:20,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 12:04:20,536 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-11-20 12:04:20,537 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-11-20 12:04:20,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:04:20,897 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:04:20,899 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:04:21,131 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:04:21,138 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:04:21,138 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 12:04:21,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:04:21 BoogieIcfgContainer [2022-11-20 12:04:21,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:04:21,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:04:21,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:04:21,163 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:04:21,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:04:17" (1/3) ... [2022-11-20 12:04:21,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1294a788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:04:21, skipping insertion in model container [2022-11-20 12:04:21,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:04:20" (2/3) ... [2022-11-20 12:04:21,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1294a788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:04:21, skipping insertion in model container [2022-11-20 12:04:21,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:04:21" (3/3) ... [2022-11-20 12:04:21,170 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_prev_harness.i [2022-11-20 12:04:21,204 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:04:21,204 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 12:04:21,264 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:04:21,272 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;@14c9a2b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:04:21,272 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 12:04:21,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-20 12:04:21,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 12:04:21,287 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:04:21,288 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:04:21,289 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:04:21,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:04:21,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1117195627, now seen corresponding path program 1 times [2022-11-20 12:04:21,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:04:21,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632227096] [2022-11-20 12:04:21,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:21,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:04:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:21,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:04:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:21,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:04:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:21,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:04:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:21,859 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 12:04:21,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:04:21,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632227096] [2022-11-20 12:04:21,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632227096] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:04:21,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:04:21,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:04:21,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004490964] [2022-11-20 12:04:21,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:04:21,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 12:04:21,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:04:21,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 12:04:21,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 12:04:21,923 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 12:04:21,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:04:21,964 INFO L93 Difference]: Finished difference Result 94 states and 124 transitions. [2022-11-20 12:04:21,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 12:04:21,967 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-11-20 12:04:21,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:04:21,978 INFO L225 Difference]: With dead ends: 94 [2022-11-20 12:04:21,980 INFO L226 Difference]: Without dead ends: 45 [2022-11-20 12:04:21,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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 12:04:21,989 INFO L413 NwaCegarLoop]: 61 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, 61 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 12:04:21,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:04:22,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-20 12:04:22,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-11-20 12:04:22,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-20 12:04:22,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-11-20 12:04:22,053 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 28 [2022-11-20 12:04:22,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:04:22,055 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-11-20 12:04:22,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 12:04:22,057 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-11-20 12:04:22,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 12:04:22,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:04:22,060 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:04:22,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:04:22,065 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:04:22,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:04:22,068 INFO L85 PathProgramCache]: Analyzing trace with hash 96127273, now seen corresponding path program 1 times [2022-11-20 12:04:22,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:04:22,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444027502] [2022-11-20 12:04:22,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:22,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:04:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:23,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:04:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:23,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:04:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:23,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:04:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:24,380 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 12:04:24,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:04:24,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444027502] [2022-11-20 12:04:24,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444027502] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:04:24,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:04:24,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 12:04:24,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053838479] [2022-11-20 12:04:24,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:04:24,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:04:24,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:04:24,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:04:24,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:04:24,384 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 12:04:24,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:04:24,851 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2022-11-20 12:04:24,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:04:24,851 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-11-20 12:04:24,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:04:24,854 INFO L225 Difference]: With dead ends: 56 [2022-11-20 12:04:24,854 INFO L226 Difference]: Without dead ends: 54 [2022-11-20 12:04:24,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-11-20 12:04:24,856 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 21 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:04:24,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 279 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:04:24,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-20 12:04:24,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-11-20 12:04:24,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2022-11-20 12:04:24,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2022-11-20 12:04:24,870 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 28 [2022-11-20 12:04:24,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:04:24,871 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2022-11-20 12:04:24,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 12:04:24,871 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2022-11-20 12:04:24,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 12:04:24,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:04:24,872 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:04:24,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:04:24,873 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:04:24,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:04:24,874 INFO L85 PathProgramCache]: Analyzing trace with hash -713219353, now seen corresponding path program 1 times [2022-11-20 12:04:24,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:04:24,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046863051] [2022-11-20 12:04:24,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:24,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:04:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:25,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:04:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:25,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:04:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:25,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:04:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 12:04:25,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:04:25,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046863051] [2022-11-20 12:04:25,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046863051] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:04:25,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:04:25,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:04:25,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246864902] [2022-11-20 12:04:25,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:04:25,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:04:25,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:04:25,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:04:25,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:04:25,639 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 12:04:25,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:04:25,914 INFO L93 Difference]: Finished difference Result 109 states and 136 transitions. [2022-11-20 12:04:25,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:04:25,915 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-11-20 12:04:25,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:04:25,918 INFO L225 Difference]: With dead ends: 109 [2022-11-20 12:04:25,919 INFO L226 Difference]: Without dead ends: 59 [2022-11-20 12:04:25,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:04:25,925 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 25 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:04:25,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 151 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:04:25,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-20 12:04:25,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-11-20 12:04:25,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2022-11-20 12:04:25,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-11-20 12:04:25,960 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 28 [2022-11-20 12:04:25,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:04:25,961 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2022-11-20 12:04:25,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 12:04:25,961 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-11-20 12:04:25,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 12:04:25,963 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:04:25,963 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:04:25,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:04:25,964 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:04:25,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:04:25,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1106246363, now seen corresponding path program 1 times [2022-11-20 12:04:25,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:04:25,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136652018] [2022-11-20 12:04:25,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:25,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:04:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:26,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:04:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:26,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:04:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:26,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:04:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:26,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 12:04:26,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:04:26,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136652018] [2022-11-20 12:04:26,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136652018] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:04:26,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:04:26,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:04:26,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065808630] [2022-11-20 12:04:26,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:04:26,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:04:26,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:04:26,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:04:26,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:04:26,175 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 12:04:26,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:04:26,225 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2022-11-20 12:04:26,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:04:26,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-11-20 12:04:26,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:04:26,229 INFO L225 Difference]: With dead ends: 115 [2022-11-20 12:04:26,229 INFO L226 Difference]: Without dead ends: 60 [2022-11-20 12:04:26,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:04:26,236 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 13 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:04:26,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 141 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:04:26,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-20 12:04:26,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-11-20 12:04:26,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 37 states have internal predecessors, (41), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-11-20 12:04:26,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-11-20 12:04:26,259 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 28 [2022-11-20 12:04:26,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:04:26,260 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-11-20 12:04:26,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 12:04:26,260 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-11-20 12:04:26,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-20 12:04:26,264 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:04:26,264 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:04:26,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:04:26,265 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:04:26,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:04:26,266 INFO L85 PathProgramCache]: Analyzing trace with hash 695086179, now seen corresponding path program 1 times [2022-11-20 12:04:26,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:04:26,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993691442] [2022-11-20 12:04:26,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:26,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:04:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:27,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:04:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:27,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:04:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:27,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:04:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:27,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-20 12:04:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:27,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 12:04:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:28,245 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 12:04:28,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:04:28,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993691442] [2022-11-20 12:04:28,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993691442] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:04:28,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673751522] [2022-11-20 12:04:28,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:28,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:04:28,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:04:28,251 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:04:28,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 12:04:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:28,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 97 conjunts are in the unsatisfiable core [2022-11-20 12:04:28,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:04:28,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:04:28,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:04:28,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-20 12:04:28,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:04:28,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-20 12:04:28,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:04:28,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-11-20 12:04:28,613 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 8 treesize of output 7 [2022-11-20 12:04:28,620 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 12 treesize of output 11 [2022-11-20 12:04:28,633 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 18 treesize of output 12 [2022-11-20 12:04:31,058 INFO L321 Elim1Store]: treesize reduction 69, result has 25.0 percent of original size [2022-11-20 12:04:31,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 221 treesize of output 133 [2022-11-20 12:04:31,101 INFO L321 Elim1Store]: treesize reduction 74, result has 8.6 percent of original size [2022-11-20 12:04:31,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 81 treesize of output 43 [2022-11-20 12:04:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 12:04:31,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:04:44,141 WARN L233 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:04:54,368 WARN L233 SmtUtils]: Spent 10.07s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:04:56,757 WARN L837 $PredicateComparison]: unable to prove that (or (= (mod |c_aws_linked_list_node_prev_is_valid_#res| 256) 0) (let ((.cse2 (+ 8 |c_aws_linked_list_node_prev_is_valid_#in~node.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_node_prev_is_valid_#in~node.base|) .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_aws_linked_list_node_prev_is_valid_#in~node.base|) .cse2))) (and (= |c_aws_linked_list_node_prev_is_valid_#in~node.base| (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) |c_aws_linked_list_node_prev_is_valid_#in~node.offset|)))) (and (forall ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_6|)) (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_6|) 8)) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_6|)) (forall ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_6| Int)) (= |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_6| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_6|)) (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_6|) 8)))))) is different from false [2022-11-20 12:04:57,044 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 12:04:57,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673751522] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:04:57,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:04:57,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 16] total 45 [2022-11-20 12:04:57,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577031022] [2022-11-20 12:04:57,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:04:57,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-20 12:04:57,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:04:57,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-20 12:04:57,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1731, Unknown=2, NotChecked=84, Total=1980 [2022-11-20 12:04:57,048 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 45 states, 36 states have (on average 2.3055555555555554) internal successors, (83), 37 states have internal predecessors, (83), 14 states have call successors, (17), 4 states have call predecessors, (17), 11 states have return successors, (15), 11 states have call predecessors, (15), 12 states have call successors, (15) [2022-11-20 12:05:06,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:05:06,136 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2022-11-20 12:05:06,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-20 12:05:06,137 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 36 states have (on average 2.3055555555555554) internal successors, (83), 37 states have internal predecessors, (83), 14 states have call successors, (17), 4 states have call predecessors, (17), 11 states have return successors, (15), 11 states have call predecessors, (15), 12 states have call successors, (15) Word has length 42 [2022-11-20 12:05:06,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:05:06,138 INFO L225 Difference]: With dead ends: 93 [2022-11-20 12:05:06,138 INFO L226 Difference]: Without dead ends: 83 [2022-11-20 12:05:06,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 57 SyntacticMatches, 9 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 35.4s TimeCoverageRelationStatistics Valid=196, Invalid=2256, Unknown=2, NotChecked=96, Total=2550 [2022-11-20 12:05:06,140 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 52 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 250 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:05:06,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 834 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 298 Invalid, 0 Unknown, 250 Unchecked, 0.4s Time] [2022-11-20 12:05:06,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-20 12:05:06,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 71. [2022-11-20 12:05:06,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 50 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 9 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-11-20 12:05:06,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-11-20 12:05:06,159 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 42 [2022-11-20 12:05:06,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:05:06,161 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-11-20 12:05:06,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 36 states have (on average 2.3055555555555554) internal successors, (83), 37 states have internal predecessors, (83), 14 states have call successors, (17), 4 states have call predecessors, (17), 11 states have return successors, (15), 11 states have call predecessors, (15), 12 states have call successors, (15) [2022-11-20 12:05:06,162 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-11-20 12:05:06,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-20 12:05:06,166 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:05:06,167 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:05:06,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 12:05:06,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:05:06,373 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:05:06,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:05:06,373 INFO L85 PathProgramCache]: Analyzing trace with hash -114260447, now seen corresponding path program 1 times [2022-11-20 12:05:06,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:05:06,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002628197] [2022-11-20 12:05:06,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:05:06,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:05:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:07,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:05:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:07,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:05:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:07,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:05:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:07,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-20 12:05:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:07,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 12:05:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:07,251 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 12:05:07,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:05:07,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002628197] [2022-11-20 12:05:07,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002628197] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:05:07,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:05:07,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:05:07,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960967118] [2022-11-20 12:05:07,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:05:07,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:05:07,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:05:07,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:05:07,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:05:07,254 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-20 12:05:07,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:05:07,572 INFO L93 Difference]: Finished difference Result 115 states and 134 transitions. [2022-11-20 12:05:07,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:05:07,573 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2022-11-20 12:05:07,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:05:07,574 INFO L225 Difference]: With dead ends: 115 [2022-11-20 12:05:07,574 INFO L226 Difference]: Without dead ends: 80 [2022-11-20 12:05:07,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:05:07,576 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 37 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:05:07,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 189 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:05:07,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-20 12:05:07,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2022-11-20 12:05:07,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.14) internal successors, (57), 52 states have internal predecessors, (57), 13 states have call successors, (13), 8 states have call predecessors, (13), 9 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-11-20 12:05:07,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2022-11-20 12:05:07,592 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 42 [2022-11-20 12:05:07,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:05:07,593 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2022-11-20 12:05:07,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-20 12:05:07,593 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-11-20 12:05:07,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-20 12:05:07,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:05:07,597 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:05:07,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:05:07,597 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:05:07,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:05:07,598 INFO L85 PathProgramCache]: Analyzing trace with hash -507287457, now seen corresponding path program 1 times [2022-11-20 12:05:07,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:05:07,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629830633] [2022-11-20 12:05:07,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:05:07,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:05:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:08,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:05:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:08,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:05:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:08,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:05:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:08,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-20 12:05:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:08,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 12:05:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:08,155 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 12:05:08,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:05:08,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629830633] [2022-11-20 12:05:08,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629830633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:05:08,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:05:08,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:05:08,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309285917] [2022-11-20 12:05:08,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:05:08,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:05:08,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:05:08,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:05:08,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:05:08,158 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-20 12:05:08,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:05:08,281 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2022-11-20 12:05:08,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:05:08,282 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2022-11-20 12:05:08,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:05:08,286 INFO L225 Difference]: With dead ends: 117 [2022-11-20 12:05:08,286 INFO L226 Difference]: Without dead ends: 72 [2022-11-20 12:05:08,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:05:08,288 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 20 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:05:08,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 192 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:05:08,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-20 12:05:08,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2022-11-20 12:05:08,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.108695652173913) internal successors, (51), 47 states have internal predecessors, (51), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-20 12:05:08,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2022-11-20 12:05:08,307 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 42 [2022-11-20 12:05:08,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:05:08,308 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2022-11-20 12:05:08,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-20 12:05:08,308 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-11-20 12:05:08,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-20 12:05:08,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:05:08,312 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-11-20 12:05:08,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:05:08,312 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:05:08,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:05:08,313 INFO L85 PathProgramCache]: Analyzing trace with hash 709260864, now seen corresponding path program 1 times [2022-11-20 12:05:08,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:05:08,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483949891] [2022-11-20 12:05:08,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:05:08,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:05:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:08,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:05:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:08,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:05:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:08,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:05:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:08,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-20 12:05:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:08,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 12:05:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:08,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 12:05:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:08,620 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 12:05:08,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:05:08,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483949891] [2022-11-20 12:05:08,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483949891] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:05:08,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:05:08,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:05:08,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417197577] [2022-11-20 12:05:08,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:05:08,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:05:08,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:05:08,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:05:08,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:05:08,623 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 12:05:08,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:05:08,762 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2022-11-20 12:05:08,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:05:08,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2022-11-20 12:05:08,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:05:08,764 INFO L225 Difference]: With dead ends: 73 [2022-11-20 12:05:08,764 INFO L226 Difference]: Without dead ends: 71 [2022-11-20 12:05:08,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:05:08,765 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 10 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:05:08,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 210 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:05:08,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-20 12:05:08,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-20 12:05:08,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 50 states have internal predecessors, (54), 12 states have call successors, (12), 9 states have call predecessors, (12), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-20 12:05:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2022-11-20 12:05:08,777 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 48 [2022-11-20 12:05:08,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:05:08,777 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2022-11-20 12:05:08,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 12:05:08,778 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2022-11-20 12:05:08,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-20 12:05:08,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:05:08,779 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:05:08,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 12:05:08,779 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:05:08,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:05:08,780 INFO L85 PathProgramCache]: Analyzing trace with hash -593356994, now seen corresponding path program 1 times [2022-11-20 12:05:08,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:05:08,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700960555] [2022-11-20 12:05:08,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:05:08,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:05:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:09,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:05:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:09,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:05:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:09,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:05:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:10,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-20 12:05:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:10,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 12:05:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:10,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 12:05:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:10,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 12:05:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:10,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 12:05:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:10,368 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-20 12:05:10,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:05:10,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700960555] [2022-11-20 12:05:10,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700960555] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:05:10,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:05:10,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 12:05:10,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60957678] [2022-11-20 12:05:10,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:05:10,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:05:10,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:05:10,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:05:10,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:05:10,370 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 10 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-20 12:05:10,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:05:10,740 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2022-11-20 12:05:10,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:05:10,741 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 63 [2022-11-20 12:05:10,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:05:10,741 INFO L225 Difference]: With dead ends: 82 [2022-11-20 12:05:10,742 INFO L226 Difference]: Without dead ends: 80 [2022-11-20 12:05:10,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-20 12:05:10,742 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 20 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:05:10,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 297 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:05:10,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-20 12:05:10,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2022-11-20 12:05:10,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 56 states have internal predecessors, (59), 13 states have call successors, (13), 10 states have call predecessors, (13), 11 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-11-20 12:05:10,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2022-11-20 12:05:10,757 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 63 [2022-11-20 12:05:10,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:05:10,757 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2022-11-20 12:05:10,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-20 12:05:10,758 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2022-11-20 12:05:10,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-20 12:05:10,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:05:10,759 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-20 12:05:10,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 12:05:10,759 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:05:10,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:05:10,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1402703620, now seen corresponding path program 1 times [2022-11-20 12:05:10,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:05:10,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653013120] [2022-11-20 12:05:10,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:05:10,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:05:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:11,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:05:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:11,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:05:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:11,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:05:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:11,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-20 12:05:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:11,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 12:05:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:12,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 12:05:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:12,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 12:05:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:12,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 12:05:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:12,294 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-20 12:05:12,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:05:12,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653013120] [2022-11-20 12:05:12,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653013120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:05:12,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:05:12,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-20 12:05:12,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183794644] [2022-11-20 12:05:12,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:05:12,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 12:05:12,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:05:12,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 12:05:12,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:05:12,297 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-20 12:05:12,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:05:12,745 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2022-11-20 12:05:12,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:05:12,746 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 63 [2022-11-20 12:05:12,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:05:12,747 INFO L225 Difference]: With dead ends: 109 [2022-11-20 12:05:12,747 INFO L226 Difference]: Without dead ends: 87 [2022-11-20 12:05:12,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-11-20 12:05:12,749 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 54 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:05:12,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 220 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:05:12,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-20 12:05:12,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2022-11-20 12:05:12,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 58 states have internal predecessors, (61), 13 states have call successors, (13), 10 states have call predecessors, (13), 11 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-11-20 12:05:12,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2022-11-20 12:05:12,772 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 63 [2022-11-20 12:05:12,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:05:12,774 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2022-11-20 12:05:12,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-20 12:05:12,775 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2022-11-20 12:05:12,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-20 12:05:12,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:05:12,776 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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] [2022-11-20 12:05:12,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 12:05:12,777 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:05:12,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:05:12,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1795730630, now seen corresponding path program 1 times [2022-11-20 12:05:12,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:05:12,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236923560] [2022-11-20 12:05:12,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:05:12,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:05:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:12,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:05:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:12,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:05:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:12,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:05:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:12,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-20 12:05:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:12,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 12:05:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:12,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 12:05:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:12,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 12:05:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:12,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 12:05:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:13,039 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-20 12:05:13,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:05:13,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236923560] [2022-11-20 12:05:13,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236923560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:05:13,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:05:13,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:05:13,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981668183] [2022-11-20 12:05:13,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:05:13,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:05:13,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:05:13,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:05:13,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:05:13,043 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-11-20 12:05:13,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:05:13,074 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2022-11-20 12:05:13,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:05:13,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 63 [2022-11-20 12:05:13,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:05:13,079 INFO L225 Difference]: With dead ends: 107 [2022-11-20 12:05:13,079 INFO L226 Difference]: Without dead ends: 75 [2022-11-20 12:05:13,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:05:13,080 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:05:13,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 143 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:05:13,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-20 12:05:13,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-11-20 12:05:13,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 53 states have internal predecessors, (55), 12 states have call successors, (12), 10 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-20 12:05:13,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-11-20 12:05:13,095 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 63 [2022-11-20 12:05:13,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:05:13,096 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-11-20 12:05:13,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-11-20 12:05:13,096 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-11-20 12:05:13,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-20 12:05:13,097 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:05:13,097 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-11-20 12:05:13,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 12:05:13,097 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:05:13,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:05:13,098 INFO L85 PathProgramCache]: Analyzing trace with hash 180273006, now seen corresponding path program 1 times [2022-11-20 12:05:13,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:05:13,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553003261] [2022-11-20 12:05:13,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:05:13,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:05:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:15,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:05:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:15,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:05:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:15,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:05:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:15,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-20 12:05:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:15,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 12:05:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:15,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 12:05:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:15,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 12:05:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:15,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 12:05:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:15,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 12:05:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:15,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 12:05:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:15,995 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-20 12:05:15,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:05:15,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553003261] [2022-11-20 12:05:15,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553003261] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:05:15,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58049938] [2022-11-20 12:05:15,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:05:15,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:05:15,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:05:15,997 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:05:16,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 12:05:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-20 12:05:16,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:05:18,994 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (let ((.cse4 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse4)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse3) .cse2)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| .cse3) .cse2) 8))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) .cse2) (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) .cse3)))))) is different from true [2022-11-20 12:05:25,153 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (let ((.cse4 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse4)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse3) .cse2)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| .cse3) .cse2) 8))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) .cse2) (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) .cse3)))))) (not (= (mod |c___VERIFIER_assert_#in~cond| 256) 0))) is different from true [2022-11-20 12:05:27,524 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))))) is different from true [2022-11-20 12:05:29,728 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)))) is different from true [2022-11-20 12:05:31,933 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|) 8))) (and (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1)) (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|)))) is different from true [2022-11-20 12:06:24,916 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 38 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 12 not checked. [2022-11-20 12:06:24,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:06:38,165 WARN L233 SmtUtils]: Spent 10.07s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:06:40,224 WARN L837 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (and (forall ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12| Int)) (= |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12| (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12|)) (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12|) 8)))) (forall ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12| Int)) (= |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12|)) (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12|) 8))))) (= (mod c___VERIFIER_assert_~cond 256) 0)) is different from false [2022-11-20 12:06:52,182 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 2 not checked. [2022-11-20 12:06:52,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58049938] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:06:52,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:06:52,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26, 21] total 57 [2022-11-20 12:06:52,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670067858] [2022-11-20 12:06:52,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:06:52,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-20 12:06:52,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:06:52,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-20 12:06:52,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2364, Unknown=23, NotChecked=618, Total=3192 [2022-11-20 12:06:52,186 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 57 states, 48 states have (on average 1.9375) internal successors, (93), 44 states have internal predecessors, (93), 16 states have call successors, (30), 7 states have call predecessors, (30), 14 states have return successors, (28), 16 states have call predecessors, (28), 14 states have call successors, (28) [2022-11-20 12:07:30,069 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (let ((.cse4 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse4)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse3) .cse2)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| .cse3) .cse2) 8))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) .cse2) (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) .cse3)))))) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (and (forall ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12| Int)) (= |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12| (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12|)) (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12|) 8)))) (forall ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12| Int)) (= |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12|)) (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12|) 8))))) (= (mod c___VERIFIER_assert_~cond 256) 0))) is different from false [2022-11-20 12:07:32,373 WARN L837 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)))) (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (and (forall ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12| Int)) (= |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12| (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12|)) (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12|) 8)))) (forall ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12| Int)) (= |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12|)) (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_12|) 8))))) (= (mod c___VERIFIER_assert_~cond 256) 0))) is different from false [2022-11-20 12:07:34,385 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)))) (not (= (mod |c___VERIFIER_assert_#in~cond| 256) 0))) is different from true [2022-11-20 12:07:51,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:07:51,174 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-11-20 12:07:51,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-20 12:07:51,175 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 48 states have (on average 1.9375) internal successors, (93), 44 states have internal predecessors, (93), 16 states have call successors, (30), 7 states have call predecessors, (30), 14 states have return successors, (28), 16 states have call predecessors, (28), 14 states have call successors, (28) Word has length 77 [2022-11-20 12:07:51,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:07:51,176 INFO L225 Difference]: With dead ends: 86 [2022-11-20 12:07:51,176 INFO L226 Difference]: Without dead ends: 84 [2022-11-20 12:07:51,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 132 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 152.5s TimeCoverageRelationStatistics Valid=348, Invalid=3814, Unknown=34, NotChecked=1206, Total=5402 [2022-11-20 12:07:51,180 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 51 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 858 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 12:07:51,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 657 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 614 Invalid, 0 Unknown, 858 Unchecked, 0.9s Time] [2022-11-20 12:07:51,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-20 12:07:51,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2022-11-20 12:07:51,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 59 states have internal predecessors, (60), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-11-20 12:07:51,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2022-11-20 12:07:51,198 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 77 [2022-11-20 12:07:51,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:07:51,198 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2022-11-20 12:07:51,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 48 states have (on average 1.9375) internal successors, (93), 44 states have internal predecessors, (93), 16 states have call successors, (30), 7 states have call predecessors, (30), 14 states have return successors, (28), 16 states have call predecessors, (28), 14 states have call successors, (28) [2022-11-20 12:07:51,199 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2022-11-20 12:07:51,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-20 12:07:51,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:07:51,200 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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] [2022-11-20 12:07:51,215 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 12:07:51,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 12:07:51,408 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:07:51,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:51,408 INFO L85 PathProgramCache]: Analyzing trace with hash -629073620, now seen corresponding path program 1 times [2022-11-20 12:07:51,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:51,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772516272] [2022-11-20 12:07:51,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:51,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:51,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:07:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:51,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:07:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:51,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:07:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:51,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-20 12:07:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:51,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 12:07:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:52,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 12:07:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:52,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 12:07:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:52,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 12:07:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:52,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 12:07:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:52,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 12:07:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:52,420 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-20 12:07:52,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:07:52,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772516272] [2022-11-20 12:07:52,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772516272] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:07:52,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148224547] [2022-11-20 12:07:52,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:52,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:07:52,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:52,427 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:07:52,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 12:07:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:52,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-20 12:07:52,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:07:55,014 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_15| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_15|) 0))) (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_15| Int)) (not (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_15|) 0)))) is different from true [2022-11-20 12:07:57,192 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_16| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (not (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_16|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_16| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_16|) 0)))) is different from true [2022-11-20 12:07:59,678 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (not (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7|) 0)))) is different from true [2022-11-20 12:08:01,776 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (not (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7|) 0)))) (or (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8)))) (and (not (= (select (select |c_#memory_$Pointer$.base| .cse0) |c_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) 0)) (= |c_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| .cse0)))) (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8)))) (and (not (= (select (select |c_#memory_$Pointer$.offset| .cse1) |c_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) 0)) (= |c_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| .cse1)))))) is different from true [2022-11-20 12:08:03,800 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_8| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (not (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_8|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_8| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_8|) 0)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (not (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7|) 0))))) is different from true [2022-11-20 12:08:09,494 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_9| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_9|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_9| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (not (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_9|) 0)))) is different from true [2022-11-20 12:08:20,241 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:08:30,440 WARN L233 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:08:40,831 WARN L233 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:08:51,077 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:08:51,134 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 38 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 12 not checked. [2022-11-20 12:08:51,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:08:51,710 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-20 12:08:51,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-11-20 12:08:51,794 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-20 12:08:51,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148224547] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:08:51,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:08:51,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20, 13] total 32 [2022-11-20 12:08:51,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873375070] [2022-11-20 12:08:51,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:08:51,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-20 12:08:51,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:08:51,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-20 12:08:51,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=573, Unknown=10, NotChecked=318, Total=992 [2022-11-20 12:08:51,797 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 8 states have call successors, (19), 7 states have call predecessors, (19), 8 states have return successors, (18), 8 states have call predecessors, (18), 7 states have call successors, (18) [2022-11-20 12:09:32,530 WARN L233 SmtUtils]: Spent 16.17s on a formula simplification. DAG size of input: 53 DAG size of output: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:09:50,772 WARN L233 SmtUtils]: Spent 16.21s on a formula simplification. DAG size of input: 59 DAG size of output: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:10:08,949 WARN L233 SmtUtils]: Spent 16.15s on a formula simplification. DAG size of input: 56 DAG size of output: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:10:29,136 WARN L233 SmtUtils]: Spent 16.14s on a formula simplification. DAG size of input: 53 DAG size of output: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 12:10:29,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:10:29,164 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2022-11-20 12:10:29,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 12:10:29,165 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 8 states have call successors, (19), 7 states have call predecessors, (19), 8 states have return successors, (18), 8 states have call predecessors, (18), 7 states have call successors, (18) Word has length 77 [2022-11-20 12:10:29,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:10:29,166 INFO L225 Difference]: With dead ends: 100 [2022-11-20 12:10:29,167 INFO L226 Difference]: Without dead ends: 88 [2022-11-20 12:10:29,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 150 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 155.4s TimeCoverageRelationStatistics Valid=200, Invalid=921, Unknown=25, NotChecked=414, Total=1560 [2022-11-20 12:10:29,168 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 37 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 641 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:10:29,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 345 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 641 Unchecked, 0.1s Time] [2022-11-20 12:10:29,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-20 12:10:29,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2022-11-20 12:10:29,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 61 states have internal predecessors, (62), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-11-20 12:10:29,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2022-11-20 12:10:29,188 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 77 [2022-11-20 12:10:29,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:10:29,189 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2022-11-20 12:10:29,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 8 states have call successors, (19), 7 states have call predecessors, (19), 8 states have return successors, (18), 8 states have call predecessors, (18), 7 states have call successors, (18) [2022-11-20 12:10:29,189 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2022-11-20 12:10:29,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-20 12:10:29,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:10:29,191 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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] [2022-11-20 12:10:29,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 12:10:29,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-20 12:10:29,398 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:10:29,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:10:29,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1022100630, now seen corresponding path program 1 times [2022-11-20 12:10:29,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:10:29,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490634487] [2022-11-20 12:10:29,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:10:29,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:10:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:10:29,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:10:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:10:29,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:10:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:10:29,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:10:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:10:29,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-20 12:10:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:10:29,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 12:10:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:10:30,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 12:10:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:10:30,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 12:10:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:10:30,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 12:10:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:10:30,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 12:10:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:10:30,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 12:10:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:10:30,253 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-20 12:10:30,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:10:30,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490634487] [2022-11-20 12:10:30,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490634487] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:10:30,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877752109] [2022-11-20 12:10:30,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:10:30,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:10:30,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:10:30,256 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:10:30,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 12:10:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:10:30,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-20 12:10:30,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:10:30,514 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 9 treesize of output 3 [2022-11-20 12:10:30,791 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-20 12:10:30,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:10:31,269 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-20 12:10:31,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877752109] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:10:31,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:10:31,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 12 [2022-11-20 12:10:31,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117022711] [2022-11-20 12:10:31,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:10:31,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 12:10:31,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:10:31,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 12:10:31,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:10:31,272 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-20 12:10:31,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:10:31,779 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2022-11-20 12:10:31,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:10:31,779 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 77 [2022-11-20 12:10:31,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:10:31,781 INFO L225 Difference]: With dead ends: 101 [2022-11-20 12:10:31,781 INFO L226 Difference]: Without dead ends: 77 [2022-11-20 12:10:31,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 165 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-11-20 12:10:31,783 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 12 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:10:31,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 423 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:10:31,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-20 12:10:31,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-11-20 12:10:31,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.0) internal successors, (54), 54 states have internal predecessors, (54), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-20 12:10:31,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2022-11-20 12:10:31,808 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 77 [2022-11-20 12:10:31,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:10:31,809 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2022-11-20 12:10:31,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-20 12:10:31,809 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-11-20 12:10:31,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-20 12:10:31,810 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:10:31,810 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 3, 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] [2022-11-20 12:10:31,818 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 12:10:32,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 12:10:32,018 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:10:32,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:10:32,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1529037313, now seen corresponding path program 1 times [2022-11-20 12:10:32,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:10:32,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313642639] [2022-11-20 12:10:32,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:10:32,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:10:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:10:34,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:10:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:10:34,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 12:10:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:10:34,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:10:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:10:34,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-20 12:10:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:10:34,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 12:10:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:10:35,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 12:10:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:10:35,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 12:10:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:10:35,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 12:10:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:10:35,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 12:10:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:10:35,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 12:10:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:10:35,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 12:10:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:10:35,112 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-20 12:10:35,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:10:35,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313642639] [2022-11-20 12:10:35,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313642639] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:10:35,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755687135] [2022-11-20 12:10:35,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:10:35,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:10:35,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:10:35,119 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:10:35,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 12:10:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:10:35,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-20 12:10:35,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:10:35,406 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-20 12:10:35,429 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 12:10:35,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-20 12:10:35,445 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 7 treesize of output 3 [2022-11-20 12:10:35,454 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2022-11-20 12:10:35,481 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 12:10:35,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-20 12:10:35,492 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 7 treesize of output 3 [2022-11-20 12:10:35,504 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 10 treesize of output 8 [2022-11-20 12:10:36,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 10 [2022-11-20 12:10:38,924 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_7| Int)) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_7|) 8)))) is different from true [2022-11-20 12:10:47,433 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_8| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_8|) 8) |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_8|))) is different from true [2022-11-20 12:10:51,578 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:10:51,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-11-20 12:10:51,712 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 46 refuted. 2 times theorem prover too weak. 15 trivial. 11 not checked. [2022-11-20 12:10:51,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:10:54,594 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-20 12:10:54,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755687135] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:10:54,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:10:54,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 12] total 40 [2022-11-20 12:10:54,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204387550] [2022-11-20 12:10:54,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:10:54,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-20 12:10:54,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:10:54,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-20 12:10:54,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1267, Unknown=5, NotChecked=146, Total=1560 [2022-11-20 12:10:54,598 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand has 40 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 32 states have internal predecessors, (86), 14 states have call successors, (33), 6 states have call predecessors, (33), 7 states have return successors, (31), 13 states have call predecessors, (31), 14 states have call successors, (31) [2022-11-20 12:11:10,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:11:10,225 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-11-20 12:11:10,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-20 12:11:10,226 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 32 states have internal predecessors, (86), 14 states have call successors, (33), 6 states have call predecessors, (33), 7 states have return successors, (31), 13 states have call predecessors, (31), 14 states have call successors, (31) Word has length 83 [2022-11-20 12:11:10,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:11:10,226 INFO L225 Difference]: With dead ends: 77 [2022-11-20 12:11:10,227 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 12:11:10,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 155 SyntacticMatches, 14 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 33.6s TimeCoverageRelationStatistics Valid=288, Invalid=2904, Unknown=8, NotChecked=222, Total=3422 [2022-11-20 12:11:10,229 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 28 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:11:10,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 355 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 270 Invalid, 0 Unknown, 144 Unchecked, 0.3s Time] [2022-11-20 12:11:10,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 12:11:10,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 12:11:10,230 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 12:11:10,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 12:11:10,231 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2022-11-20 12:11:10,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:11:10,231 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 12:11:10,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 32 states have internal predecessors, (86), 14 states have call successors, (33), 6 states have call predecessors, (33), 7 states have return successors, (31), 13 states have call predecessors, (31), 14 states have call successors, (31) [2022-11-20 12:11:10,232 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 12:11:10,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 12:11:10,235 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 12:11:10,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 12:11:10,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 12:11:10,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 12:11:12,665 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validFINAL(lines 4717 4721) no Hoare annotation was computed. [2022-11-20 12:11:12,665 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validEXIT(lines 4717 4721) no Hoare annotation was computed. [2022-11-20 12:11:12,665 INFO L899 garLoopResultBuilder]: For program point L4720-2(line 4720) no Hoare annotation was computed. [2022-11-20 12:11:12,665 INFO L899 garLoopResultBuilder]: For program point L4720(line 4720) no Hoare annotation was computed. [2022-11-20 12:11:12,666 INFO L899 garLoopResultBuilder]: For program point L4720-5(line 4720) no Hoare annotation was computed. [2022-11-20 12:11:12,666 INFO L899 garLoopResultBuilder]: For program point L4720-3(line 4720) no Hoare annotation was computed. [2022-11-20 12:11:12,666 INFO L902 garLoopResultBuilder]: At program point aws_linked_list_node_next_is_validENTRY(lines 4717 4721) the Hoare annotation is: true [2022-11-20 12:11:12,666 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validFINAL(lines 4728 4732) no Hoare annotation was computed. [2022-11-20 12:11:12,666 INFO L899 garLoopResultBuilder]: For program point L4731(line 4731) no Hoare annotation was computed. [2022-11-20 12:11:12,666 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validEXIT(lines 4728 4732) no Hoare annotation was computed. [2022-11-20 12:11:12,666 INFO L899 garLoopResultBuilder]: For program point L4731-5(line 4731) no Hoare annotation was computed. [2022-11-20 12:11:12,666 INFO L899 garLoopResultBuilder]: For program point L4731-2(line 4731) no Hoare annotation was computed. [2022-11-20 12:11:12,666 INFO L899 garLoopResultBuilder]: For program point L4731-3(line 4731) no Hoare annotation was computed. [2022-11-20 12:11:12,667 INFO L902 garLoopResultBuilder]: At program point aws_linked_list_node_prev_is_validENTRY(lines 4728 4732) the Hoare annotation is: true [2022-11-20 12:11:12,667 INFO L899 garLoopResultBuilder]: For program point L7391-1(line 7391) no Hoare annotation was computed. [2022-11-20 12:11:12,667 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 12:11:12,667 INFO L895 garLoopResultBuilder]: At program point L7391(line 7391) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= 0 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (or (not (= 0 |ULTIMATE.start_aws_linked_list_prev_#res#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_prev_#res#1.offset| 0))) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse0))) [2022-11-20 12:11:12,667 INFO L902 garLoopResultBuilder]: At program point L7393(line 7393) the Hoare annotation is: true [2022-11-20 12:11:12,667 INFO L899 garLoopResultBuilder]: For program point L7389-2(line 7389) no Hoare annotation was computed. [2022-11-20 12:11:12,668 INFO L895 garLoopResultBuilder]: At program point L7389-1(line 7389) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|)) (.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (<= |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret671#1| 1) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse0) 8) |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= 0 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8)))) (and (not (= (select (select |#memory_$Pointer$.base| .cse1) |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) 0)) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|)))) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (<= 1 |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret671#1|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (or (not (= 0 |ULTIMATE.start_aws_linked_list_prev_#res#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_prev_#res#1.offset| 0))) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| (select (select |#memory_$Pointer$.base| .cse0) 8)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse2) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0) 0))) [2022-11-20 12:11:12,669 INFO L895 garLoopResultBuilder]: At program point L7389(line 7389) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (= 0 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| .cse0) (= |ULTIMATE.start_aws_linked_list_prev_#res#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| .cse0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8)) 0)) (= (select (select |#memory_$Pointer$.base| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) 0) 0))) [2022-11-20 12:11:12,669 INFO L895 garLoopResultBuilder]: At program point L4854(lines 4848 4855) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| .cse0) (= |ULTIMATE.start_aws_linked_list_prev_#res#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8)) 0)) (= (select (select |#memory_$Pointer$.base| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) 0) 0))) [2022-11-20 12:11:12,670 INFO L895 garLoopResultBuilder]: At program point L4852-1(line 4852) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_#t~ret335#1| 1) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= (select (select |#memory_$Pointer$.base| .cse1) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse1) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse1))) [2022-11-20 12:11:12,670 INFO L899 garLoopResultBuilder]: For program point L4852-2(line 4852) no Hoare annotation was computed. [2022-11-20 12:11:12,670 INFO L895 garLoopResultBuilder]: At program point L4852(line 4852) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= (select (select |#memory_$Pointer$.base| .cse1) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse1) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse1))) [2022-11-20 12:11:12,671 INFO L895 garLoopResultBuilder]: At program point L7390(line 7390) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|)) (.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse0) 8) |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= 0 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8)))) (and (not (= (select (select |#memory_$Pointer$.base| .cse1) |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) 0)) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|)))) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (or (not (= 0 |ULTIMATE.start_aws_linked_list_prev_#res#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_prev_#res#1.offset| 0))) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| (select (select |#memory_$Pointer$.base| .cse0) 8)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse2) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0) 0))) [2022-11-20 12:11:12,671 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 12:11:12,672 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 12:11:12,672 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-20 12:11:12,672 INFO L899 garLoopResultBuilder]: For program point L7390-2(line 7390) no Hoare annotation was computed. [2022-11-20 12:11:12,672 INFO L895 garLoopResultBuilder]: At program point L7390-1(line 7390) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= 0 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (<= 1 |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret672#1|) (<= |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret672#1| 1) (= (select (select |#memory_$Pointer$.base| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (or (not (= 0 |ULTIMATE.start_aws_linked_list_prev_#res#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_prev_#res#1.offset| 0))) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse0))) [2022-11-20 12:11:12,673 INFO L895 garLoopResultBuilder]: At program point L4851(line 4851) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse1 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8)) (.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= (select .cse0 .cse1) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= (select .cse0 8) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse1)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse2))) [2022-11-20 12:11:12,673 INFO L895 garLoopResultBuilder]: At program point L4851-1(line 4851) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= (select (select |#memory_$Pointer$.base| .cse1) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse1) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_#t~ret334#1| 1) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse1))) [2022-11-20 12:11:12,674 INFO L895 garLoopResultBuilder]: At program point L4853(line 4853) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| .cse0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= (select (select |#memory_$Pointer$.base| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse0) (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (let ((.cse3 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse3)) (.cse2 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse3))) (and (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_#t~mem336#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| .cse2) (= .cse2 |ULTIMATE.start_aws_linked_list_prev_#t~mem336#1.offset|))))))) [2022-11-20 12:11:12,674 INFO L899 garLoopResultBuilder]: For program point L4853-1(line 4853) no Hoare annotation was computed. [2022-11-20 12:11:12,674 INFO L899 garLoopResultBuilder]: For program point L4849-2(line 4849) no Hoare annotation was computed. [2022-11-20 12:11:12,675 INFO L895 garLoopResultBuilder]: At program point L4849(line 4849) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|))) (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8))) (.cse2 (select .cse0 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select .cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8)) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse1) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (= (select (select |#memory_$Pointer$.offset| .cse1) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= .cse2 0)) (not (= .cse2 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|))))) [2022-11-20 12:11:12,675 INFO L899 garLoopResultBuilder]: For program point L4851-2(line 4851) no Hoare annotation was computed. [2022-11-20 12:11:12,675 INFO L899 garLoopResultBuilder]: For program point L7376(lines 7376 7392) no Hoare annotation was computed. [2022-11-20 12:11:12,675 INFO L895 garLoopResultBuilder]: At program point L4849-1(line 4849) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|))) (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8))) (.cse2 (select .cse0 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select .cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8)) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse1) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (= (select (select |#memory_$Pointer$.offset| .cse1) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= .cse2 0)) (not (= .cse2 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|))))) [2022-11-20 12:11:12,676 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-11-20 12:11:12,676 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-11-20 12:11:12,676 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-20 12:11:12,676 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-11-20 12:11:12,676 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-11-20 12:11:12,677 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-11-20 12:11:12,677 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-11-20 12:11:12,677 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-11-20 12:11:12,677 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-11-20 12:11:12,677 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-11-20 12:11:12,681 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:11:12,684 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:11:12,699 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:11:12,701 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:11:12,701 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:11:12,702 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:11:12,702 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:11:12,702 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:11:12,703 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:11:12,703 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:11:12,703 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:11:12,704 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:11:12,704 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:11:12,708 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:11:12,708 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:11:12,709 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:11:12,709 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:11:12,709 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:11:12,709 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:11:12,710 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:11:12,710 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:11:12,710 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:11:12,711 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:11:12,711 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:11:12,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:11:12 BoogieIcfgContainer [2022-11-20 12:11:12,713 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:11:12,714 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:11:12,714 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:11:12,715 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:11:12,715 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:04:21" (3/4) ... [2022-11-20 12:11:12,719 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 12:11:12,727 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2022-11-20 12:11:12,727 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_prev_is_valid [2022-11-20 12:11:12,727 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-20 12:11:12,728 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-20 12:11:12,732 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-11-20 12:11:12,733 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-20 12:11:12,733 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-20 12:11:12,733 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 12:11:12,764 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((before == 0 && node == node) && #memory_$Pointer$[node][node + 8] == \result) && before == #memory_$Pointer$[node][node + 8]) && \result == 0) && !(node == 0)) && !(before == node)) && node == #memory_$Pointer$[#memory_$Pointer$[node][8]][0]) && #memory_$Pointer$[#memory_$Pointer$[node][node + 8]][0] == node) && #memory_$Pointer$[#memory_$Pointer$[node][node + 8]][0] == node) && rval == #memory_$Pointer$[node][node + 8]) && rval == 0) && !(rval == 0)) && rval == #memory_$Pointer$[node][node + 8]) && #memory_$Pointer$[\result][0] == 0 [2022-11-20 12:11:12,779 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 12:11:12,779 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:11:12,780 INFO L158 Benchmark]: Toolchain (without parser) took 415205.15ms. Allocated memory was 146.8MB in the beginning and 346.0MB in the end (delta: 199.2MB). Free memory was 117.9MB in the beginning and 130.8MB in the end (delta: -12.8MB). Peak memory consumption was 185.6MB. Max. memory is 16.1GB. [2022-11-20 12:11:12,780 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 100.7MB. Free memory was 69.7MB in the beginning and 69.6MB in the end (delta: 91.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:11:12,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2620.23ms. Allocated memory was 146.8MB in the beginning and 199.2MB in the end (delta: 52.4MB). Free memory was 117.9MB in the beginning and 144.9MB in the end (delta: -27.0MB). Peak memory consumption was 100.2MB. Max. memory is 16.1GB. [2022-11-20 12:11:12,781 INFO L158 Benchmark]: Boogie Procedure Inliner took 150.82ms. Allocated memory is still 199.2MB. Free memory was 144.9MB in the beginning and 139.6MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-20 12:11:12,781 INFO L158 Benchmark]: Boogie Preprocessor took 85.37ms. Allocated memory is still 199.2MB. Free memory was 139.6MB in the beginning and 137.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:11:12,782 INFO L158 Benchmark]: RCFGBuilder took 719.56ms. Allocated memory is still 199.2MB. Free memory was 137.6MB in the beginning and 117.6MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-20 12:11:12,782 INFO L158 Benchmark]: TraceAbstraction took 411553.97ms. Allocated memory was 199.2MB in the beginning and 346.0MB in the end (delta: 146.8MB). Free memory was 116.6MB in the beginning and 133.9MB in the end (delta: -17.3MB). Peak memory consumption was 129.5MB. Max. memory is 16.1GB. [2022-11-20 12:11:12,783 INFO L158 Benchmark]: Witness Printer took 65.04ms. Allocated memory is still 346.0MB. Free memory was 133.9MB in the beginning and 130.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:11:12,785 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.28ms. Allocated memory is still 100.7MB. Free memory was 69.7MB in the beginning and 69.6MB in the end (delta: 91.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2620.23ms. Allocated memory was 146.8MB in the beginning and 199.2MB in the end (delta: 52.4MB). Free memory was 117.9MB in the beginning and 144.9MB in the end (delta: -27.0MB). Peak memory consumption was 100.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 150.82ms. Allocated memory is still 199.2MB. Free memory was 144.9MB in the beginning and 139.6MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.37ms. Allocated memory is still 199.2MB. Free memory was 139.6MB in the beginning and 137.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 719.56ms. Allocated memory is still 199.2MB. Free memory was 137.6MB in the beginning and 117.6MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 411553.97ms. Allocated memory was 199.2MB in the beginning and 346.0MB in the end (delta: 146.8MB). Free memory was 116.6MB in the beginning and 133.9MB in the end (delta: -17.3MB). Peak memory consumption was 129.5MB. Max. memory is 16.1GB. * Witness Printer took 65.04ms. Allocated memory is still 346.0MB. Free memory was 133.9MB in the beginning and 130.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * 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 5 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 411.4s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 184.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 440 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 389 mSDsluCounter, 4497 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1893 IncrementalHoareTripleChecker+Unchecked, 3753 mSDsCounter, 171 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2389 IncrementalHoareTripleChecker+Invalid, 4453 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 171 mSolverCounterUnsat, 744 mSDtfsCounter, 2389 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1125 GetRequests, 779 SyntacticMatches, 39 SemanticMatches, 307 ConstructedPredicates, 18 IntricatePredicates, 1 DeprecatedPredicates, 2637 ImplicationChecksByTransitivity, 378.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=13, InterpolantAutomatonStates: 189, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 43 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 89 PreInvPairs, 102 NumberOfFragments, 1310 HoareAnnotationTreeSize, 89 FomulaSimplifications, 147 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 18 FomulaSimplificationsInter, 4318 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 221.6s InterpolantComputationTime, 1145 NumberOfCodeBlocks, 1145 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1476 ConstructedInterpolants, 155 QuantifiedInterpolants, 16890 SizeOfPredicates, 124 NumberOfNonLiveVariables, 1681 ConjunctsInSsa, 314 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 805/979 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: 7393]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4848]: Loop Invariant [2022-11-20 12:11:12,796 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:11:12,797 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:11:12,797 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:11:12,797 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:11:12,798 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:11:12,798 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:11:12,798 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:11:12,798 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:11:12,799 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:11:12,799 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:11:12,799 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:11:12,800 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:11:12,801 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:11:12,801 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:11:12,801 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:11:12,801 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:11:12,802 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:11:12,802 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:11:12,802 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:11:12,802 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:11:12,803 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:11:12,803 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((before == 0 && node == node) && #memory_$Pointer$[node][node + 8] == \result) && before == #memory_$Pointer$[node][node + 8]) && \result == 0) && !(node == 0)) && !(before == node)) && node == #memory_$Pointer$[#memory_$Pointer$[node][8]][0]) && #memory_$Pointer$[#memory_$Pointer$[node][node + 8]][0] == node) && #memory_$Pointer$[#memory_$Pointer$[node][node + 8]][0] == node) && rval == #memory_$Pointer$[node][node + 8]) && rval == 0) && !(rval == 0)) && rval == #memory_$Pointer$[node][node + 8]) && #memory_$Pointer$[\result][0] == 0 RESULT: Ultimate proved your program to be correct! [2022-11-20 12:11:12,891 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11bd65cc-ada3-4d3e-8987-660d71a6c9ef/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