./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF --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 5bb1e95e9d6379d31cbb3e207d6fe85ddf495edebf9b764e927537f63dbf829e --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 07:04:25,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 07:04:25,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 07:04:25,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 07:04:25,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 07:04:25,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 07:04:25,116 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 07:04:25,127 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 07:04:25,133 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 07:04:25,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 07:04:25,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 07:04:25,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 07:04:25,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 07:04:25,146 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 07:04:25,147 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 07:04:25,149 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 07:04:25,150 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 07:04:25,151 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 07:04:25,154 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 07:04:25,157 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 07:04:25,159 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 07:04:25,160 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 07:04:25,162 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 07:04:25,163 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 07:04:25,167 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 07:04:25,167 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 07:04:25,168 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 07:04:25,169 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 07:04:25,169 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 07:04:25,171 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 07:04:25,171 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 07:04:25,172 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 07:04:25,173 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 07:04:25,174 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 07:04:25,180 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 07:04:25,180 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 07:04:25,181 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 07:04:25,181 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 07:04:25,182 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 07:04:25,183 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 07:04:25,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 07:04:25,187 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-20 07:04:25,228 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 07:04:25,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 07:04:25,229 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 07:04:25,229 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 07:04:25,230 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 07:04:25,230 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 07:04:25,230 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 07:04:25,231 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 07:04:25,231 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 07:04:25,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 07:04:25,231 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 07:04:25,231 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 07:04:25,232 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 07:04:25,232 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 07:04:25,232 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 07:04:25,232 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 07:04:25,232 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 07:04:25,233 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 07:04:25,233 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 07:04:25,233 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 07:04:25,233 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 07:04:25,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:04:25,234 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 07:04:25,234 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 07:04:25,234 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 07:04:25,234 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 07:04:25,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 07:04:25,234 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-20 07:04:25,235 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-20 07:04:25,235 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 07:04:25,235 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 07:04:25,235 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_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/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_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF 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 -> 5bb1e95e9d6379d31cbb3e207d6fe85ddf495edebf9b764e927537f63dbf829e [2021-11-20 07:04:25,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 07:04:25,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 07:04:25,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 07:04:25,546 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 07:04:25,547 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 07:04:25,548 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i [2021-11-20 07:04:25,622 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/data/aaacab95d/c7be08afa0404c28926a20a61f8187a4/FLAG1c3c9956a [2021-11-20 07:04:26,434 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 07:04:26,435 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i [2021-11-20 07:04:26,487 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/data/aaacab95d/c7be08afa0404c28926a20a61f8187a4/FLAG1c3c9956a [2021-11-20 07:04:26,956 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/data/aaacab95d/c7be08afa0404c28926a20a61f8187a4 [2021-11-20 07:04:26,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 07:04:26,961 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 07:04:26,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 07:04:26,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 07:04:26,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 07:04:26,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:04:26" (1/1) ... [2021-11-20 07:04:26,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a7da1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:04:26, skipping insertion in model container [2021-11-20 07:04:26,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:04:26" (1/1) ... [2021-11-20 07:04:26,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 07:04:27,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 07:04:27,329 WARN L230 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_e6592bc5-e205-4c7b-be35-4c25a47fef8d/sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i[4494,4507] [2021-11-20 07:04:27,335 WARN L230 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_e6592bc5-e205-4c7b-be35-4c25a47fef8d/sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i[4554,4567] [2021-11-20 07:04:28,171 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-20 07:04:28,176 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-20 07:04:28,180 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-20 07:04:28,182 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-20 07:04:28,184 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-20 07:04:28,203 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-20 07:04:28,206 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-20 07:04:28,208 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-20 07:04:28,211 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-20 07:04:28,214 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-20 07:04:28,217 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-20 07:04:28,218 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-20 07:04:28,220 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-20 07:04:28,541 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-20 07:04:28,542 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-20 07:04:28,543 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-20 07:04:28,545 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-20 07:04:28,546 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-20 07:04:28,547 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-20 07:04:28,548 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-20 07:04:28,549 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-20 07:04:28,549 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-20 07:04:28,550 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-20 07:04:28,737 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-20 07:04:28,760 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:04:28,775 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 07:04:28,800 WARN L230 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_e6592bc5-e205-4c7b-be35-4c25a47fef8d/sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i[4494,4507] [2021-11-20 07:04:28,809 WARN L230 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_e6592bc5-e205-4c7b-be35-4c25a47fef8d/sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i[4554,4567] [2021-11-20 07:04:28,918 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-20 07:04:28,930 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-20 07:04:28,931 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-20 07:04:28,934 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-20 07:04:28,935 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-20 07:04:28,946 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-20 07:04:28,955 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-20 07:04:28,956 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-20 07:04:28,957 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-20 07:04:28,958 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-20 07:04:28,965 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-20 07:04:28,966 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-20 07:04:28,966 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-20 07:04:29,035 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-20 07:04:29,036 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-20 07:04:29,038 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-20 07:04:29,039 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-20 07:04:29,045 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-20 07:04:29,046 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-20 07:04:29,047 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-20 07:04:29,047 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-20 07:04:29,048 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-20 07:04:29,048 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-20 07:04:29,078 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-20 07:04:29,093 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:04:29,405 INFO L208 MainTranslator]: Completed translation [2021-11-20 07:04:29,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:04:29 WrapperNode [2021-11-20 07:04:29,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 07:04:29,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 07:04:29,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 07:04:29,407 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 07:04:29,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:04:29" (1/1) ... [2021-11-20 07:04:29,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:04:29" (1/1) ... [2021-11-20 07:04:29,564 INFO L137 Inliner]: procedures = 679, calls = 1039, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 58 [2021-11-20 07:04:29,564 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 07:04:29,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 07:04:29,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 07:04:29,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 07:04:29,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:04:29" (1/1) ... [2021-11-20 07:04:29,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:04:29" (1/1) ... [2021-11-20 07:04:29,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:04:29" (1/1) ... [2021-11-20 07:04:29,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:04:29" (1/1) ... [2021-11-20 07:04:29,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:04:29" (1/1) ... [2021-11-20 07:04:29,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:04:29" (1/1) ... [2021-11-20 07:04:29,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:04:29" (1/1) ... [2021-11-20 07:04:29,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 07:04:29,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 07:04:29,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 07:04:29,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 07:04:29,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:04:29" (1/1) ... [2021-11-20 07:04:29,626 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:04:29,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:04:29,660 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 07:04:29,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 07:04:29,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 07:04:29,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-20 07:04:29,713 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-20 07:04:29,714 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2021-11-20 07:04:29,714 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2021-11-20 07:04:29,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 07:04:29,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-20 07:04:29,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 07:04:29,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 07:04:29,716 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-20 07:04:29,717 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-20 07:04:29,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 07:04:29,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-20 07:04:29,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-20 07:04:29,718 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2021-11-20 07:04:29,718 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2021-11-20 07:04:29,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 07:04:29,947 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 07:04:29,948 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 07:04:30,205 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 07:04:30,211 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 07:04:30,212 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-20 07:04:30,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:04:30 BoogieIcfgContainer [2021-11-20 07:04:30,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 07:04:30,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 07:04:30,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 07:04:30,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 07:04:30,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:04:26" (1/3) ... [2021-11-20 07:04:30,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4baa44cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:04:30, skipping insertion in model container [2021-11-20 07:04:30,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:04:29" (2/3) ... [2021-11-20 07:04:30,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4baa44cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:04:30, skipping insertion in model container [2021-11-20 07:04:30,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:04:30" (3/3) ... [2021-11-20 07:04:30,223 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_linked_list_next_harness.i [2021-11-20 07:04:30,228 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 07:04:30,228 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-20 07:04:30,275 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 07:04:30,282 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 07:04:30,282 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-20 07:04:30,299 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) [2021-11-20 07:04:30,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 07:04:30,305 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:04:30,306 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:04:30,307 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:04:30,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:04:30,312 INFO L85 PathProgramCache]: Analyzing trace with hash 829036907, now seen corresponding path program 1 times [2021-11-20 07:04:30,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:04:30,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404888239] [2021-11-20 07:04:30,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:04:30,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:04:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:30,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:04:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:30,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 07:04:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:30,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 07:04:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:30,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-20 07:04:30,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:04:30,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404888239] [2021-11-20 07:04:30,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404888239] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:04:30,818 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:04:30,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 07:04:30,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312748927] [2021-11-20 07:04:30,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:04:30,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-20 07:04:30,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:04:30,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-20 07:04:30,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-20 07:04:30,857 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) [2021-11-20 07:04:30,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:04:30,885 INFO L93 Difference]: Finished difference Result 94 states and 124 transitions. [2021-11-20 07:04:30,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-20 07:04:30,887 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 [2021-11-20 07:04:30,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:04:30,896 INFO L225 Difference]: With dead ends: 94 [2021-11-20 07:04:30,896 INFO L226 Difference]: Without dead ends: 45 [2021-11-20 07:04:30,900 INFO L932 BasicCegarLoop]: 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 [2021-11-20 07:04:30,904 INFO L933 BasicCegarLoop]: 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 [2021-11-20 07:04:30,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 07:04:30,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-11-20 07:04:30,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-11-20 07:04:30,945 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) [2021-11-20 07:04:30,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2021-11-20 07:04:30,949 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 28 [2021-11-20 07:04:30,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:04:30,951 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2021-11-20 07:04:30,952 INFO L471 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) [2021-11-20 07:04:30,952 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2021-11-20 07:04:30,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 07:04:30,954 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:04:30,954 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:04:30,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 07:04:30,954 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:04:30,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:04:30,955 INFO L85 PathProgramCache]: Analyzing trace with hash -192031447, now seen corresponding path program 1 times [2021-11-20 07:04:30,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:04:30,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571108317] [2021-11-20 07:04:30,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:04:30,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:04:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:31,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:04:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:31,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 07:04:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:31,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 07:04:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:31,464 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 07:04:31,464 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:04:31,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571108317] [2021-11-20 07:04:31,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571108317] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:04:31,465 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:04:31,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-20 07:04:31,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329735047] [2021-11-20 07:04:31,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:04:31,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-20 07:04:31,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:04:31,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-20 07:04:31,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-20 07:04:31,475 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 9 states, 8 states have (on average 2.625) 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) [2021-11-20 07:04:31,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:04:31,807 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2021-11-20 07:04:31,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 07:04:31,808 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) 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 [2021-11-20 07:04:31,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:04:31,815 INFO L225 Difference]: With dead ends: 56 [2021-11-20 07:04:31,815 INFO L226 Difference]: Without dead ends: 54 [2021-11-20 07:04:31,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-20 07:04:31,818 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 18 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 07:04:31,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 271 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 07:04:31,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-11-20 07:04:31,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2021-11-20 07:04:31,846 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) [2021-11-20 07:04:31,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2021-11-20 07:04:31,852 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 28 [2021-11-20 07:04:31,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:04:31,853 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2021-11-20 07:04:31,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) 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) [2021-11-20 07:04:31,854 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2021-11-20 07:04:31,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 07:04:31,857 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:04:31,857 INFO L514 BasicCegarLoop]: 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] [2021-11-20 07:04:31,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 07:04:31,860 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:04:31,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:04:31,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1001378073, now seen corresponding path program 1 times [2021-11-20 07:04:31,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:04:31,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800038490] [2021-11-20 07:04:31,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:04:31,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:04:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:31,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:04:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:32,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 07:04:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:32,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 07:04:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:32,147 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 07:04:32,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:04:32,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800038490] [2021-11-20 07:04:32,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800038490] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:04:32,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127991885] [2021-11-20 07:04:32,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:04:32,148 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:04:32,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:04:32,150 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:04:32,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 07:04:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:32,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 27 conjunts are in the unsatisfiable core [2021-11-20 07:04:32,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:04:32,360 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-20 07:04:32,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 29 [2021-11-20 07:04:32,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 33 [2021-11-20 07:04:33,316 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 07:04:33,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:04:33,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127991885] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:04:33,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:04:33,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2021-11-20 07:04:33,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636777133] [2021-11-20 07:04:33,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:04:33,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 07:04:33,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:04:33,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 07:04:33,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-11-20 07:04:33,323 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 8 states, 8 states have (on average 2.625) 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) [2021-11-20 07:04:33,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:04:33,349 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2021-11-20 07:04:33,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 07:04:33,349 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) 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 [2021-11-20 07:04:33,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:04:33,352 INFO L225 Difference]: With dead ends: 106 [2021-11-20 07:04:33,352 INFO L226 Difference]: Without dead ends: 68 [2021-11-20 07:04:33,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-11-20 07:04:33,356 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 10 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:04:33,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 190 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 45 Unchecked, 0.0s Time] [2021-11-20 07:04:33,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-20 07:04:33,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2021-11-20 07:04:33,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.186046511627907) internal successors, (51), 46 states have internal predecessors, (51), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2021-11-20 07:04:33,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2021-11-20 07:04:33,380 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 28 [2021-11-20 07:04:33,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:04:33,381 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2021-11-20 07:04:33,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) 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) [2021-11-20 07:04:33,381 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2021-11-20 07:04:33,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 07:04:33,383 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:04:33,383 INFO L514 BasicCegarLoop]: 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] [2021-11-20 07:04:33,420 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-20 07:04:33,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:04:33,608 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:04:33,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:04:33,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1394405083, now seen corresponding path program 1 times [2021-11-20 07:04:33,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:04:33,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352014783] [2021-11-20 07:04:33,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:04:33,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:04:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:33,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:04:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:33,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 07:04:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:33,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 07:04:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 07:04:33,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:04:33,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352014783] [2021-11-20 07:04:33,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352014783] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:04:33,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:04:33,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 07:04:33,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072288864] [2021-11-20 07:04:33,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:04:33,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 07:04:33,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:04:33,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 07:04:33,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:04:33,760 INFO L87 Difference]: Start difference. First operand 65 states and 79 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) [2021-11-20 07:04:33,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:04:33,806 INFO L93 Difference]: Finished difference Result 134 states and 160 transitions. [2021-11-20 07:04:33,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 07:04:33,806 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 [2021-11-20 07:04:33,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:04:33,810 INFO L225 Difference]: With dead ends: 134 [2021-11-20 07:04:33,811 INFO L226 Difference]: Without dead ends: 64 [2021-11-20 07:04:33,814 INFO L932 BasicCegarLoop]: 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 [2021-11-20 07:04:33,816 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 13 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:04:33,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 143 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 07:04:33,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-11-20 07:04:33,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2021-11-20 07:04:33,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2021-11-20 07:04:33,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2021-11-20 07:04:33,830 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 28 [2021-11-20 07:04:33,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:04:33,831 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2021-11-20 07:04:33,831 INFO L471 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) [2021-11-20 07:04:33,831 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2021-11-20 07:04:33,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-20 07:04:33,835 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:04:33,836 INFO L514 BasicCegarLoop]: 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] [2021-11-20 07:04:33,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-20 07:04:33,836 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:04:33,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:04:33,837 INFO L85 PathProgramCache]: Analyzing trace with hash 854159971, now seen corresponding path program 1 times [2021-11-20 07:04:33,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:04:33,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116291719] [2021-11-20 07:04:33,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:04:33,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:04:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:34,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:04:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:34,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 07:04:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:34,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 07:04:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:34,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-20 07:04:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:34,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:04:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:34,365 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-20 07:04:34,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:04:34,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116291719] [2021-11-20 07:04:34,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116291719] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:04:34,366 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:04:34,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-20 07:04:34,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880188836] [2021-11-20 07:04:34,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:04:34,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-20 07:04:34,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:04:34,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-20 07:04:34,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-20 07:04:34,368 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) 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) [2021-11-20 07:04:34,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:04:34,658 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2021-11-20 07:04:34,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 07:04:34,659 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) 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 [2021-11-20 07:04:34,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:04:34,660 INFO L225 Difference]: With dead ends: 70 [2021-11-20 07:04:34,660 INFO L226 Difference]: Without dead ends: 68 [2021-11-20 07:04:34,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-11-20 07:04:34,661 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 29 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 07:04:34,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 309 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 07:04:34,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-20 07:04:34,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2021-11-20 07:04:34,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 47 states have internal predecessors, (50), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2021-11-20 07:04:34,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2021-11-20 07:04:34,671 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 42 [2021-11-20 07:04:34,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:04:34,671 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2021-11-20 07:04:34,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) 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) [2021-11-20 07:04:34,672 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2021-11-20 07:04:34,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-20 07:04:34,675 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:04:34,675 INFO L514 BasicCegarLoop]: 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] [2021-11-20 07:04:34,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-20 07:04:34,676 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:04:34,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:04:34,677 INFO L85 PathProgramCache]: Analyzing trace with hash 44813345, now seen corresponding path program 1 times [2021-11-20 07:04:34,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:04:34,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166793848] [2021-11-20 07:04:34,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:04:34,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:04:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:34,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:04:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:34,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 07:04:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:34,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 07:04:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:34,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-20 07:04:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:34,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:04:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-20 07:04:35,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:04:35,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166793848] [2021-11-20 07:04:35,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166793848] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:04:35,053 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:04:35,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-20 07:04:35,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485654328] [2021-11-20 07:04:35,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:04:35,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-20 07:04:35,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:04:35,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-20 07:04:35,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-20 07:04:35,056 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 07:04:35,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:04:35,361 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2021-11-20 07:04:35,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 07:04:35,362 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2021-11-20 07:04:35,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:04:35,363 INFO L225 Difference]: With dead ends: 108 [2021-11-20 07:04:35,363 INFO L226 Difference]: Without dead ends: 73 [2021-11-20 07:04:35,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2021-11-20 07:04:35,365 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 25 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 07:04:35,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 190 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 07:04:35,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-11-20 07:04:35,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2021-11-20 07:04:35,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 7 states have call predecessors, (13), 10 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2021-11-20 07:04:35,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2021-11-20 07:04:35,385 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 42 [2021-11-20 07:04:35,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:04:35,386 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2021-11-20 07:04:35,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 07:04:35,386 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2021-11-20 07:04:35,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-20 07:04:35,390 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:04:35,391 INFO L514 BasicCegarLoop]: 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] [2021-11-20 07:04:35,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-20 07:04:35,391 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:04:35,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:04:35,392 INFO L85 PathProgramCache]: Analyzing trace with hash -348213665, now seen corresponding path program 1 times [2021-11-20 07:04:35,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:04:35,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350900338] [2021-11-20 07:04:35,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:04:35,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:04:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:35,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:04:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:35,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 07:04:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:35,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 07:04:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:35,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-20 07:04:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:35,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:04:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:35,703 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 07:04:35,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:04:35,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350900338] [2021-11-20 07:04:35,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350900338] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:04:35,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561327710] [2021-11-20 07:04:35,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:04:35,704 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:04:35,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:04:35,705 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:04:35,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-20 07:04:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:35,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-20 07:04:35,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:04:35,834 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-20 07:04:35,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 29 [2021-11-20 07:04:35,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 33 [2021-11-20 07:04:36,567 INFO L354 Elim1Store]: treesize reduction 32, result has 60.5 percent of original size [2021-11-20 07:04:36,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 80 [2021-11-20 07:04:36,706 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-20 07:04:36,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:04:36,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561327710] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:04:36,707 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:04:36,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2021-11-20 07:04:36,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601211737] [2021-11-20 07:04:36,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:04:36,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-20 07:04:36,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:04:36,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-20 07:04:36,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-11-20 07:04:36,709 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-11-20 07:04:36,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:04:36,732 INFO L93 Difference]: Finished difference Result 119 states and 139 transitions. [2021-11-20 07:04:36,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 07:04:36,733 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2021-11-20 07:04:36,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:04:36,740 INFO L225 Difference]: With dead ends: 119 [2021-11-20 07:04:36,740 INFO L226 Difference]: Without dead ends: 74 [2021-11-20 07:04:36,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-11-20 07:04:36,742 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 10 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:04:36,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 274 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 30 Unchecked, 0.0s Time] [2021-11-20 07:04:36,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-11-20 07:04:36,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2021-11-20 07:04:36,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2021-11-20 07:04:36,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2021-11-20 07:04:36,768 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 42 [2021-11-20 07:04:36,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:04:36,769 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2021-11-20 07:04:36,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-11-20 07:04:36,770 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2021-11-20 07:04:36,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-20 07:04:36,772 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:04:36,774 INFO L514 BasicCegarLoop]: 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] [2021-11-20 07:04:36,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-20 07:04:36,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:04:36,975 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:04:36,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:04:36,975 INFO L85 PathProgramCache]: Analyzing trace with hash -541770688, now seen corresponding path program 1 times [2021-11-20 07:04:36,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:04:36,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736515914] [2021-11-20 07:04:36,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:04:36,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:04:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:37,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:04:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:37,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 07:04:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:37,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 07:04:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:37,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-20 07:04:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:37,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:04:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:37,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-20 07:04:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-20 07:04:37,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:04:37,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736515914] [2021-11-20 07:04:37,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736515914] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:04:37,149 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:04:37,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 07:04:37,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507999248] [2021-11-20 07:04:37,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:04:37,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 07:04:37,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:04:37,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 07:04:37,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 07:04:37,152 INFO L87 Difference]: Start difference. First operand 68 states and 78 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) [2021-11-20 07:04:37,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:04:37,238 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2021-11-20 07:04:37,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 07:04:37,239 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 [2021-11-20 07:04:37,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:04:37,241 INFO L225 Difference]: With dead ends: 74 [2021-11-20 07:04:37,242 INFO L226 Difference]: Without dead ends: 72 [2021-11-20 07:04:37,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:04:37,243 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 9 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:04:37,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 219 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:04:37,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-11-20 07:04:37,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-11-20 07:04:37,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 52 states have internal predecessors, (56), 12 states have call successors, (12), 8 states have call predecessors, (12), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2021-11-20 07:04:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2021-11-20 07:04:37,257 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 48 [2021-11-20 07:04:37,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:04:37,257 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2021-11-20 07:04:37,257 INFO L471 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) [2021-11-20 07:04:37,258 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2021-11-20 07:04:37,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-20 07:04:37,260 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:04:37,260 INFO L514 BasicCegarLoop]: 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] [2021-11-20 07:04:37,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-20 07:04:37,260 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:04:37,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:04:37,261 INFO L85 PathProgramCache]: Analyzing trace with hash -266250434, now seen corresponding path program 1 times [2021-11-20 07:04:37,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:04:37,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320334863] [2021-11-20 07:04:37,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:04:37,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:04:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:37,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:04:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:37,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 07:04:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:37,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 07:04:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:37,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-20 07:04:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:37,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:04:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:37,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-20 07:04:37,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:37,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-20 07:04:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:37,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-20 07:04:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:37,640 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-20 07:04:37,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:04:37,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320334863] [2021-11-20 07:04:37,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320334863] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:04:37,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:04:37,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-20 07:04:37,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249015964] [2021-11-20 07:04:37,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:04:37,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 07:04:37,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:04:37,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 07:04:37,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-20 07:04:37,643 INFO L87 Difference]: Start difference. First operand 72 states and 81 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) [2021-11-20 07:04:37,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:04:37,883 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2021-11-20 07:04:37,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 07:04:37,883 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 [2021-11-20 07:04:37,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:04:37,885 INFO L225 Difference]: With dead ends: 83 [2021-11-20 07:04:37,885 INFO L226 Difference]: Without dead ends: 81 [2021-11-20 07:04:37,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-11-20 07:04:37,886 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 19 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 07:04:37,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 309 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 07:04:37,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-11-20 07:04:37,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2021-11-20 07:04:37,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 58 states have internal predecessors, (61), 13 states have call successors, (13), 9 states have call predecessors, (13), 12 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2021-11-20 07:04:37,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2021-11-20 07:04:37,894 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 63 [2021-11-20 07:04:37,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:04:37,895 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2021-11-20 07:04:37,895 INFO L471 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) [2021-11-20 07:04:37,895 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2021-11-20 07:04:37,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-20 07:04:37,896 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:04:37,896 INFO L514 BasicCegarLoop]: 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] [2021-11-20 07:04:37,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-20 07:04:37,897 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:04:37,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:04:37,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1075597060, now seen corresponding path program 1 times [2021-11-20 07:04:37,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:04:37,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980385043] [2021-11-20 07:04:37,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:04:37,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:04:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:37,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:04:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:38,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 07:04:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:38,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 07:04:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:38,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-20 07:04:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:38,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:04:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:38,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-20 07:04:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:38,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-20 07:04:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:38,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-20 07:04:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:38,226 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-20 07:04:38,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:04:38,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980385043] [2021-11-20 07:04:38,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980385043] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:04:38,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415954752] [2021-11-20 07:04:38,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:04:38,227 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:04:38,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:04:38,228 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:04:38,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-20 07:04:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:38,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-20 07:04:38,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:04:38,357 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-20 07:04:38,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 29 [2021-11-20 07:04:38,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 33 [2021-11-20 07:04:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-20 07:04:40,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:04:40,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415954752] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:04:40,100 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:04:40,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2021-11-20 07:04:40,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716865761] [2021-11-20 07:04:40,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:04:40,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 07:04:40,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:04:40,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 07:04:40,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-11-20 07:04:40,102 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 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) [2021-11-20 07:04:40,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:04:40,111 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2021-11-20 07:04:40,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 07:04:40,111 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 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 [2021-11-20 07:04:40,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:04:40,113 INFO L225 Difference]: With dead ends: 121 [2021-11-20 07:04:40,113 INFO L226 Difference]: Without dead ends: 89 [2021-11-20 07:04:40,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 59 SyntacticMatches, 14 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-11-20 07:04:40,114 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 14 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:04:40,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 154 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 61 Unchecked, 0.0s Time] [2021-11-20 07:04:40,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-11-20 07:04:40,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2021-11-20 07:04:40,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.103448275862069) internal successors, (64), 61 states have internal predecessors, (64), 13 states have call successors, (13), 10 states have call predecessors, (13), 12 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2021-11-20 07:04:40,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2021-11-20 07:04:40,124 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 63 [2021-11-20 07:04:40,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:04:40,126 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2021-11-20 07:04:40,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 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) [2021-11-20 07:04:40,126 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2021-11-20 07:04:40,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-20 07:04:40,127 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:04:40,128 INFO L514 BasicCegarLoop]: 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] [2021-11-20 07:04:40,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-20 07:04:40,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-20 07:04:40,343 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:04:40,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:04:40,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1468624070, now seen corresponding path program 1 times [2021-11-20 07:04:40,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:04:40,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837573354] [2021-11-20 07:04:40,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:04:40,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:04:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:40,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:04:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:40,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 07:04:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:40,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 07:04:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:40,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-20 07:04:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:40,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:04:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:40,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-20 07:04:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:40,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-20 07:04:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:40,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-20 07:04:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:40,514 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-20 07:04:40,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:04:40,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837573354] [2021-11-20 07:04:40,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837573354] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:04:40,515 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:04:40,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 07:04:40,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68874021] [2021-11-20 07:04:40,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:04:40,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 07:04:40,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:04:40,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 07:04:40,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:04:40,517 INFO L87 Difference]: Start difference. First operand 84 states and 91 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) [2021-11-20 07:04:40,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:04:40,543 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2021-11-20 07:04:40,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 07:04:40,543 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 [2021-11-20 07:04:40,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:04:40,544 INFO L225 Difference]: With dead ends: 110 [2021-11-20 07:04:40,545 INFO L226 Difference]: Without dead ends: 78 [2021-11-20 07:04:40,545 INFO L932 BasicCegarLoop]: 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 [2021-11-20 07:04:40,546 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 9 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:04:40,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 147 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 07:04:40,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-11-20 07:04:40,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-11-20 07:04:40,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 56 states have internal predecessors, (58), 12 states have call successors, (12), 10 states have call predecessors, (12), 11 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2021-11-20 07:04:40,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2021-11-20 07:04:40,556 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 63 [2021-11-20 07:04:40,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:04:40,556 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2021-11-20 07:04:40,556 INFO L471 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) [2021-11-20 07:04:40,557 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2021-11-20 07:04:40,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-20 07:04:40,558 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:04:40,558 INFO L514 BasicCegarLoop]: 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] [2021-11-20 07:04:40,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-20 07:04:40,558 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:04:40,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:04:40,559 INFO L85 PathProgramCache]: Analyzing trace with hash 763050350, now seen corresponding path program 1 times [2021-11-20 07:04:40,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:04:40,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804481768] [2021-11-20 07:04:40,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:04:40,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:04:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:40,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:04:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:40,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 07:04:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:40,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 07:04:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:40,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-20 07:04:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:40,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:04:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:40,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-20 07:04:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:40,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-20 07:04:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:40,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-20 07:04:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:40,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-20 07:04:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:40,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-20 07:04:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:41,072 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-11-20 07:04:41,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:04:41,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804481768] [2021-11-20 07:04:41,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804481768] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:04:41,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:04:41,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-20 07:04:41,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223510320] [2021-11-20 07:04:41,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:04:41,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 07:04:41,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:04:41,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 07:04:41,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-11-20 07:04:41,075 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 14 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2021-11-20 07:04:41,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:04:41,619 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2021-11-20 07:04:41,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 07:04:41,620 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 77 [2021-11-20 07:04:41,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:04:41,621 INFO L225 Difference]: With dead ends: 89 [2021-11-20 07:04:41,621 INFO L226 Difference]: Without dead ends: 87 [2021-11-20 07:04:41,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2021-11-20 07:04:41,623 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 40 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 07:04:41,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 332 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 07:04:41,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-11-20 07:04:41,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2021-11-20 07:04:41,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 62 states have internal predecessors, (63), 13 states have call successors, (13), 11 states have call predecessors, (13), 13 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2021-11-20 07:04:41,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2021-11-20 07:04:41,634 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 77 [2021-11-20 07:04:41,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:04:41,634 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2021-11-20 07:04:41,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2021-11-20 07:04:41,635 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2021-11-20 07:04:41,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-20 07:04:41,636 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:04:41,636 INFO L514 BasicCegarLoop]: 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] [2021-11-20 07:04:41,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-20 07:04:41,636 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:04:41,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:04:41,637 INFO L85 PathProgramCache]: Analyzing trace with hash -46296276, now seen corresponding path program 1 times [2021-11-20 07:04:41,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:04:41,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194057456] [2021-11-20 07:04:41,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:04:41,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:04:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:41,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:04:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:41,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 07:04:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:41,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 07:04:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:41,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-20 07:04:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:41,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:04:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:41,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-20 07:04:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:41,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-20 07:04:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:41,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-20 07:04:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:41,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-20 07:04:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:41,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-20 07:04:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:42,040 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-11-20 07:04:42,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:04:42,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194057456] [2021-11-20 07:04:42,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194057456] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:04:42,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:04:42,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-20 07:04:42,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080086010] [2021-11-20 07:04:42,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:04:42,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-20 07:04:42,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:04:42,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-20 07:04:42,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-11-20 07:04:42,043 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2021-11-20 07:04:42,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:04:42,423 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2021-11-20 07:04:42,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 07:04:42,423 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 77 [2021-11-20 07:04:42,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:04:42,424 INFO L225 Difference]: With dead ends: 101 [2021-11-20 07:04:42,424 INFO L226 Difference]: Without dead ends: 89 [2021-11-20 07:04:42,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2021-11-20 07:04:42,425 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 34 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 07:04:42,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 234 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 07:04:42,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-11-20 07:04:42,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2021-11-20 07:04:42,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 64 states have internal predecessors, (65), 13 states have call successors, (13), 11 states have call predecessors, (13), 13 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2021-11-20 07:04:42,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2021-11-20 07:04:42,435 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 77 [2021-11-20 07:04:42,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:04:42,435 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2021-11-20 07:04:42,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2021-11-20 07:04:42,436 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2021-11-20 07:04:42,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-20 07:04:42,437 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:04:42,437 INFO L514 BasicCegarLoop]: 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] [2021-11-20 07:04:42,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-20 07:04:42,437 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:04:42,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:04:42,438 INFO L85 PathProgramCache]: Analyzing trace with hash -439323286, now seen corresponding path program 1 times [2021-11-20 07:04:42,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:04:42,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60365578] [2021-11-20 07:04:42,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:04:42,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:04:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:42,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:04:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:42,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 07:04:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:42,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 07:04:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:42,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-20 07:04:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:42,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:04:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:42,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-20 07:04:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:42,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-20 07:04:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:42,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-20 07:04:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:42,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-20 07:04:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:42,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-20 07:04:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:42,772 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-20 07:04:42,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:04:42,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60365578] [2021-11-20 07:04:42,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60365578] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:04:42,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235335348] [2021-11-20 07:04:42,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:04:42,773 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:04:42,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:04:42,775 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:04:42,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-20 07:04:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:42,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-20 07:04:42,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:04:42,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2021-11-20 07:04:42,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2021-11-20 07:04:43,249 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-11-20 07:04:43,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:04:43,703 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-11-20 07:04:43,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235335348] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 07:04:43,704 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 07:04:43,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 15 [2021-11-20 07:04:43,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233990323] [2021-11-20 07:04:43,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 07:04:43,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-20 07:04:43,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:04:43,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-20 07:04:43,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-11-20 07:04:43,706 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 states have internal predecessors, (52), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2021-11-20 07:04:44,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:04:44,116 INFO L93 Difference]: Finished difference Result 104 states and 107 transitions. [2021-11-20 07:04:44,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-20 07:04:44,117 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 states have internal predecessors, (52), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 77 [2021-11-20 07:04:44,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:04:44,118 INFO L225 Difference]: With dead ends: 104 [2021-11-20 07:04:44,118 INFO L226 Difference]: Without dead ends: 80 [2021-11-20 07:04:44,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 169 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2021-11-20 07:04:44,119 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 43 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 07:04:44,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 331 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 07:04:44,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-11-20 07:04:44,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2021-11-20 07:04:44,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 57 states have internal predecessors, (57), 12 states have call successors, (12), 11 states have call predecessors, (12), 11 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2021-11-20 07:04:44,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2021-11-20 07:04:44,129 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 77 [2021-11-20 07:04:44,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:04:44,129 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2021-11-20 07:04:44,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 states have internal predecessors, (52), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2021-11-20 07:04:44,130 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2021-11-20 07:04:44,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-20 07:04:44,131 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:04:44,131 INFO L514 BasicCegarLoop]: 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] [2021-11-20 07:04:44,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-20 07:04:44,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-20 07:04:44,347 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:04:44,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:04:44,347 INFO L85 PathProgramCache]: Analyzing trace with hash 958151681, now seen corresponding path program 1 times [2021-11-20 07:04:44,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:04:44,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494761954] [2021-11-20 07:04:44,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:04:44,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:04:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:44,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:04:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:44,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-20 07:04:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:44,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-20 07:04:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:44,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-20 07:04:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:44,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:04:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:44,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-20 07:04:44,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:44,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-11-20 07:04:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:44,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-20 07:04:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:44,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-20 07:04:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:44,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-20 07:04:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:44,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 07:04:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:04:44,686 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-11-20 07:04:44,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:04:44,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494761954] [2021-11-20 07:04:44,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494761954] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:04:44,687 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:04:44,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-20 07:04:44,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296977673] [2021-11-20 07:04:44,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:04:44,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-20 07:04:44,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:04:44,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-20 07:04:44,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-11-20 07:04:44,690 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2021-11-20 07:04:44,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:04:44,878 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2021-11-20 07:04:44,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 07:04:44,878 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) Word has length 83 [2021-11-20 07:04:44,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:04:44,878 INFO L225 Difference]: With dead ends: 80 [2021-11-20 07:04:44,878 INFO L226 Difference]: Without dead ends: 0 [2021-11-20 07:04:44,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2021-11-20 07:04:44,879 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 19 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:04:44,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 325 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 07:04:44,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-20 07:04:44,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-20 07:04:44,880 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) [2021-11-20 07:04:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-20 07:04:44,881 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2021-11-20 07:04:44,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:04:44,881 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-20 07:04:44,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2021-11-20 07:04:44,881 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-20 07:04:44,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-20 07:04:44,884 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-20 07:04:44,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-20 07:04:44,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-20 07:04:46,105 INFO L858 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validFINAL(lines 4717 4721) no Hoare annotation was computed. [2021-11-20 07:04:46,106 INFO L858 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validEXIT(lines 4717 4721) no Hoare annotation was computed. [2021-11-20 07:04:46,106 INFO L858 garLoopResultBuilder]: For program point L4720-2(line 4720) no Hoare annotation was computed. [2021-11-20 07:04:46,106 INFO L858 garLoopResultBuilder]: For program point L4720(line 4720) no Hoare annotation was computed. [2021-11-20 07:04:46,106 INFO L858 garLoopResultBuilder]: For program point L4720-5(line 4720) no Hoare annotation was computed. [2021-11-20 07:04:46,106 INFO L858 garLoopResultBuilder]: For program point L4720-3(line 4720) no Hoare annotation was computed. [2021-11-20 07:04:46,106 INFO L861 garLoopResultBuilder]: At program point aws_linked_list_node_next_is_validENTRY(lines 4717 4721) the Hoare annotation is: true [2021-11-20 07:04:46,106 INFO L858 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validFINAL(lines 4728 4732) no Hoare annotation was computed. [2021-11-20 07:04:46,106 INFO L858 garLoopResultBuilder]: For program point L4731(line 4731) no Hoare annotation was computed. [2021-11-20 07:04:46,106 INFO L858 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validEXIT(lines 4728 4732) no Hoare annotation was computed. [2021-11-20 07:04:46,106 INFO L858 garLoopResultBuilder]: For program point L4731-5(line 4731) no Hoare annotation was computed. [2021-11-20 07:04:46,106 INFO L858 garLoopResultBuilder]: For program point L4731-2(line 4731) no Hoare annotation was computed. [2021-11-20 07:04:46,106 INFO L858 garLoopResultBuilder]: For program point L4731-3(line 4731) no Hoare annotation was computed. [2021-11-20 07:04:46,106 INFO L861 garLoopResultBuilder]: At program point aws_linked_list_node_prev_is_validENTRY(lines 4728 4732) the Hoare annotation is: true [2021-11-20 07:04:46,107 INFO L858 garLoopResultBuilder]: For program point L7391-1(line 7391) no Hoare annotation was computed. [2021-11-20 07:04:46,107 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-20 07:04:46,107 INFO L854 garLoopResultBuilder]: At program point L7391(line 7391) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_#res#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_#res#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (= |ULTIMATE.start_aws_linked_list_next_#res#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|)) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_#res#1.base|) 8) 0)))) [2021-11-20 07:04:46,107 INFO L861 garLoopResultBuilder]: At program point L7393(line 7393) the Hoare annotation is: true [2021-11-20 07:04:46,107 INFO L858 garLoopResultBuilder]: For program point L7389-2(line 7389) no Hoare annotation was computed. [2021-11-20 07:04:46,107 INFO L854 garLoopResultBuilder]: At program point L7389-1(line 7389) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (<= |ULTIMATE.start_aws_linked_list_next_harness_#t~ret675#1| 1) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base| 0)) (<= 1 |ULTIMATE.start_aws_linked_list_next_harness_#t~ret675#1|) (= |ULTIMATE.start_aws_linked_list_next_#res#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_#res#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (= |ULTIMATE.start_aws_linked_list_next_#res#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|)) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_#res#1.base|) 8) 0)))) [2021-11-20 07:04:46,108 INFO L854 garLoopResultBuilder]: At program point L7389(line 7389) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_#res#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_#res#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (= |ULTIMATE.start_aws_linked_list_next_#res#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8))) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse1)) (= (select (select |#memory_$Pointer$.offset| .cse1) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_#res#1.base|) 8) 0)))) [2021-11-20 07:04:46,108 INFO L854 garLoopResultBuilder]: At program point L4842(lines 4836 4843) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_#res#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_#res#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (= |ULTIMATE.start_aws_linked_list_next_#res#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse1)) (= (select (select |#memory_$Pointer$.offset| .cse1) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_#res#1.base|) 8) 0)))) [2021-11-20 07:04:46,108 INFO L854 garLoopResultBuilder]: At program point L4840-1(line 4840) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset| .cse0) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (<= |ULTIMATE.start_aws_linked_list_next_#t~ret332#1| 1) (= 0 .cse0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| 0)) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse2)) (= (select (select |#memory_$Pointer$.offset| .cse2) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (<= 1 |ULTIMATE.start_aws_linked_list_next_#t~ret332#1|))) [2021-11-20 07:04:46,108 INFO L858 garLoopResultBuilder]: For program point L4840-2(line 4840) no Hoare annotation was computed. [2021-11-20 07:04:46,109 INFO L854 garLoopResultBuilder]: At program point L4840(line 4840) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset| .cse0) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= 0 .cse0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| 0)) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse2)) (= (select (select |#memory_$Pointer$.offset| .cse2) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|))) [2021-11-20 07:04:46,109 INFO L854 garLoopResultBuilder]: At program point L7390(line 7390) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_#res#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_#res#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (= |ULTIMATE.start_aws_linked_list_next_#res#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|)) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_#res#1.base|) 8) 0)))) [2021-11-20 07:04:46,109 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-20 07:04:46,109 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-20 07:04:46,109 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-20 07:04:46,110 INFO L858 garLoopResultBuilder]: For program point L7390-2(line 7390) no Hoare annotation was computed. [2021-11-20 07:04:46,110 INFO L854 garLoopResultBuilder]: At program point L7390-1(line 7390) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (<= |ULTIMATE.start_aws_linked_list_next_harness_#t~ret676#1| 1) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (<= 1 |ULTIMATE.start_aws_linked_list_next_harness_#t~ret676#1|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_#res#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_#res#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (= |ULTIMATE.start_aws_linked_list_next_#res#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) 8))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|)) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_#res#1.base|) 8) 0)))) [2021-11-20 07:04:46,110 INFO L858 garLoopResultBuilder]: For program point L7376(lines 7376 7392) no Hoare annotation was computed. [2021-11-20 07:04:46,110 INFO L854 garLoopResultBuilder]: At program point L4839(line 4839) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset| .cse0) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= 0 .cse0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| 0)) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse2)) (= (select (select |#memory_$Pointer$.offset| .cse2) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|))) [2021-11-20 07:04:46,111 INFO L854 garLoopResultBuilder]: At program point L4839-1(line 4839) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (<= |ULTIMATE.start_aws_linked_list_next_#t~ret331#1| 1) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset| .cse0) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base| 0)) (<= 1 |ULTIMATE.start_aws_linked_list_next_#t~ret331#1|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= 0 .cse0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| 0)) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse2)) (= (select (select |#memory_$Pointer$.offset| .cse2) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|))) [2021-11-20 07:04:46,111 INFO L854 garLoopResultBuilder]: At program point L4841(line 4841) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset| .cse0) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= 0 .cse0) (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset| |ULTIMATE.start_aws_linked_list_next_#t~mem333#1.offset|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_#t~mem333#1.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse2)) (= (select (select |#memory_$Pointer$.offset| .cse2) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|))) [2021-11-20 07:04:46,111 INFO L858 garLoopResultBuilder]: For program point L4841-1(line 4841) no Hoare annotation was computed. [2021-11-20 07:04:46,111 INFO L858 garLoopResultBuilder]: For program point L4837-2(line 4837) no Hoare annotation was computed. [2021-11-20 07:04:46,111 INFO L854 garLoopResultBuilder]: At program point L4837(line 4837) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| .cse0) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (not (= .cse1 0)) (= (select (select |#memory_$Pointer$.base| .cse1) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= .cse1 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= 0 .cse0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| 0)) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse2)) (= (select (select |#memory_$Pointer$.offset| .cse2) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) [2021-11-20 07:04:46,112 INFO L858 garLoopResultBuilder]: For program point L4839-2(line 4839) no Hoare annotation was computed. [2021-11-20 07:04:46,112 INFO L854 garLoopResultBuilder]: At program point L4837-1(line 4837) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| .cse0) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (not (= .cse1 0)) (= (select (select |#memory_$Pointer$.base| .cse1) 8) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= .cse1 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= 0 .cse0) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| 0)) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| .cse2)) (= (select (select |#memory_$Pointer$.offset| .cse2) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) [2021-11-20 07:04:46,112 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-11-20 07:04:46,112 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-11-20 07:04:46,112 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-20 07:04:46,112 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-11-20 07:04:46,113 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-20 07:04:46,113 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-11-20 07:04:46,113 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-20 07:04:46,113 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-11-20 07:04:46,113 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-11-20 07:04:46,113 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-20 07:04:46,117 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:04:46,118 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-20 07:04:46,130 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 07:04:46,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 07:04:46,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 07:04:46,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 07:04:46,132 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 07:04:46,132 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 07:04:46,132 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 07:04:46,132 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 07:04:46,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 07:04:46,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 07:04:46,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 07:04:46,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 07:04:46,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 07:04:46,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 07:04:46,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 07:04:46,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 07:04:46,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:04:46 BoogieIcfgContainer [2021-11-20 07:04:46,139 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-20 07:04:46,140 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-20 07:04:46,140 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-20 07:04:46,140 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-20 07:04:46,141 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:04:30" (3/4) ... [2021-11-20 07:04:46,143 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-20 07:04:46,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2021-11-20 07:04:46,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_prev_is_valid [2021-11-20 07:04:46,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-11-20 07:04:46,150 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-11-20 07:04:46,155 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2021-11-20 07:04:46,156 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-20 07:04:46,156 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-20 07:04:46,157 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-20 07:04:46,181 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((node == node && node == node) && node == 0) && #memory_$Pointer$[node][node] == rval) && !(rval == 0)) && \result == 0) && after == rval) && #memory_$Pointer$[node][node] == after) && after == \result) && 0 == #memory_$Pointer$[node][node]) && \result == after) && !(node == #memory_$Pointer$[node][node])) && #memory_$Pointer$[#memory_$Pointer$[node][node]][8] == node) && #memory_$Pointer$[rval][8] == node) && !(#memory_$Pointer$[\result][8] == 0) [2021-11-20 07:04:46,206 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/witness.graphml [2021-11-20 07:04:46,207 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-20 07:04:46,207 INFO L158 Benchmark]: Toolchain (without parser) took 19246.51ms. Allocated memory was 100.7MB in the beginning and 234.9MB in the end (delta: 134.2MB). Free memory was 74.5MB in the beginning and 107.9MB in the end (delta: -33.4MB). Peak memory consumption was 101.9MB. Max. memory is 16.1GB. [2021-11-20 07:04:46,208 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 76.3MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 07:04:46,208 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2443.85ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 74.1MB in the beginning and 80.8MB in the end (delta: -6.7MB). Peak memory consumption was 54.6MB. Max. memory is 16.1GB. [2021-11-20 07:04:46,209 INFO L158 Benchmark]: Boogie Procedure Inliner took 157.67ms. Allocated memory is still 121.6MB. Free memory was 80.8MB in the beginning and 75.2MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-20 07:04:46,210 INFO L158 Benchmark]: Boogie Preprocessor took 38.86ms. Allocated memory is still 121.6MB. Free memory was 75.2MB in the beginning and 73.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 07:04:46,210 INFO L158 Benchmark]: RCFGBuilder took 609.55ms. Allocated memory is still 121.6MB. Free memory was 73.1MB in the beginning and 56.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-11-20 07:04:46,211 INFO L158 Benchmark]: TraceAbstraction took 15923.74ms. Allocated memory was 121.6MB in the beginning and 234.9MB in the end (delta: 113.2MB). Free memory was 55.6MB in the beginning and 112.1MB in the end (delta: -56.5MB). Peak memory consumption was 116.5MB. Max. memory is 16.1GB. [2021-11-20 07:04:46,211 INFO L158 Benchmark]: Witness Printer took 66.69ms. Allocated memory is still 234.9MB. Free memory was 112.1MB in the beginning and 107.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-20 07:04:46,214 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.24ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 76.3MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2443.85ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 74.1MB in the beginning and 80.8MB in the end (delta: -6.7MB). Peak memory consumption was 54.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 157.67ms. Allocated memory is still 121.6MB. Free memory was 80.8MB in the beginning and 75.2MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.86ms. Allocated memory is still 121.6MB. Free memory was 75.2MB in the beginning and 73.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 609.55ms. Allocated memory is still 121.6MB. Free memory was 73.1MB in the beginning and 56.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15923.74ms. Allocated memory was 121.6MB in the beginning and 234.9MB in the end (delta: 113.2MB). Free memory was 55.6MB in the beginning and 112.1MB in the end (delta: -56.5MB). Peak memory consumption was 116.5MB. Max. memory is 16.1GB. * Witness Printer took 66.69ms. Allocated memory is still 234.9MB. Free memory was 112.1MB in the beginning and 107.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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$.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$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * 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: 15.8s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 352 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 292 mSDsluCounter, 3489 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 136 IncrementalHoareTripleChecker+Unchecked, 2732 mSDsCounter, 205 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1593 IncrementalHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 205 mSolverCounterUnsat, 757 mSDtfsCounter, 1593 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 652 GetRequests, 454 SyntacticMatches, 24 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=13, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 25 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 86 PreInvPairs, 99 NumberOfFragments, 1104 HoareAnnotationTreeSize, 86 FomulaSimplifications, 239 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 18 FomulaSimplificationsInter, 2504 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 999 NumberOfCodeBlocks, 999 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1056 ConstructedInterpolants, 101 QuantifiedInterpolants, 8849 SizeOfPredicates, 54 NumberOfNonLiveVariables, 952 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 575/620 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: 4836]: Loop Invariant [2021-11-20 07:04:46,226 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 07:04:46,226 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 07:04:46,227 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 07:04:46,227 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 07:04:46,227 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 07:04:46,227 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 07:04:46,227 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 07:04:46,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 07:04:46,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 07:04:46,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 07:04:46,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 07:04:46,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 07:04:46,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 07:04:46,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 07:04:46,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 07:04:46,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((node == node && node == node) && node == 0) && #memory_$Pointer$[node][node] == rval) && !(rval == 0)) && \result == 0) && after == rval) && #memory_$Pointer$[node][node] == after) && after == \result) && 0 == #memory_$Pointer$[node][node]) && \result == after) && !(node == #memory_$Pointer$[node][node])) && #memory_$Pointer$[#memory_$Pointer$[node][node]][8] == node) && #memory_$Pointer$[rval][8] == node) && !(#memory_$Pointer$[\result][8] == 0) RESULT: Ultimate proved your program to be correct! [2021-11-20 07:04:46,273 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6592bc5-e205-4c7b-be35-4c25a47fef8d/bin/uautomizer-DQz5hQGWxF/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