./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_hash_table_foreach_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_hash_table_foreach_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a --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 44162e1142387f3513ac3cf9af71d3c7aa6399e99cd364d08a07ceb8efc80a41 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 13:42:29,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:42:29,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:42:29,089 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:42:29,089 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:42:29,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:42:29,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:42:29,094 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:42:29,097 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:42:29,098 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:42:29,099 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:42:29,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:42:29,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:42:29,102 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:42:29,104 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:42:29,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:42:29,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:42:29,115 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:42:29,117 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:42:29,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:42:29,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:42:29,124 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:42:29,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:42:29,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:42:29,131 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:42:29,132 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:42:29,132 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:42:29,133 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:42:29,144 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:42:29,146 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:42:29,146 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:42:29,147 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:42:29,148 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:42:29,149 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:42:29,151 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:42:29,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:42:29,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:42:29,152 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:42:29,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:42:29,161 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:42:29,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:42:29,165 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-21 13:42:29,225 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:42:29,226 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:42:29,227 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:42:29,227 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:42:29,228 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 13:42:29,229 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 13:42:29,230 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:42:29,230 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:42:29,230 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:42:29,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:42:29,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:42:29,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:42:29,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 13:42:29,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 13:42:29,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 13:42:29,234 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 13:42:29,234 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:42:29,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 13:42:29,235 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:42:29,235 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:42:29,235 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 13:42:29,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:42:29,236 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:42:29,236 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 13:42:29,237 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 13:42:29,237 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 13:42:29,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 13:42:29,237 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 13:42:29,238 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 13:42:29,239 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 13:42:29,239 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_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/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_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a 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 -> 44162e1142387f3513ac3cf9af71d3c7aa6399e99cd364d08a07ceb8efc80a41 [2022-11-21 13:42:29,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:42:29,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:42:29,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:42:29,683 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:42:29,684 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:42:29,685 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/aws-c-common/aws_hash_table_foreach_harness.i [2022-11-21 13:42:33,342 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:42:34,030 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:42:34,031 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/sv-benchmarks/c/aws-c-common/aws_hash_table_foreach_harness.i [2022-11-21 13:42:34,078 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/data/8815e6632/211942b486594c97b9f871ff71809ae5/FLAG2bd617653 [2022-11-21 13:42:34,104 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/data/8815e6632/211942b486594c97b9f871ff71809ae5 [2022-11-21 13:42:34,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:42:34,114 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:42:34,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:42:34,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:42:34,122 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:42:34,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:42:34" (1/1) ... [2022-11-21 13:42:34,124 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@784eb3f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:34, skipping insertion in model container [2022-11-21 13:42:34,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:42:34" (1/1) ... [2022-11-21 13:42:34,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:42:34,280 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:42:34,583 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/sv-benchmarks/c/aws-c-common/aws_hash_table_foreach_harness.i[4496,4509] [2022-11-21 13:42:34,594 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/sv-benchmarks/c/aws-c-common/aws_hash_table_foreach_harness.i[4556,4569] [2022-11-21 13:42:35,938 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:35,939 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:35,940 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:35,941 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:35,942 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:35,958 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:35,959 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:35,962 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:35,963 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:35,965 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:35,966 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:35,967 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:35,968 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:36,524 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-21 13:42:36,525 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-21 13:42:36,527 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-21 13:42:36,529 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-21 13:42:36,531 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-21 13:42:36,532 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-21 13:42:36,533 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-21 13:42:36,534 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-21 13:42:36,535 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-21 13:42:36,535 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-21 13:42:36,775 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-21 13:42:37,304 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,307 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,345 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,349 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,357 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,359 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,383 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,384 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,385 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,386 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,387 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,388 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,388 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:42:37,489 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 13:42:37,508 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/sv-benchmarks/c/aws-c-common/aws_hash_table_foreach_harness.i[4496,4509] [2022-11-21 13:42:37,508 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/sv-benchmarks/c/aws-c-common/aws_hash_table_foreach_harness.i[4556,4569] [2022-11-21 13:42:37,572 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,573 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,573 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,574 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,575 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,583 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,586 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,591 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,592 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,593 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,594 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,595 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,595 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,655 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-21 13:42:37,657 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-21 13:42:37,658 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-21 13:42:37,659 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-21 13:42:37,660 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-21 13:42:37,661 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-21 13:42:37,663 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-21 13:42:37,663 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-21 13:42:37,664 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-21 13:42:37,664 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-21 13:42:37,704 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-21 13:42:37,819 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,820 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,829 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,830 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,834 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,835 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,853 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,855 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,856 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,857 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,857 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,859 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,859 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:42:37,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:42:38,383 INFO L208 MainTranslator]: Completed translation [2022-11-21 13:42:38,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:38 WrapperNode [2022-11-21 13:42:38,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:42:38,386 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 13:42:38,386 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 13:42:38,387 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 13:42:38,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:38" (1/1) ... [2022-11-21 13:42:38,561 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:38" (1/1) ... [2022-11-21 13:42:38,686 INFO L138 Inliner]: procedures = 775, calls = 2434, calls flagged for inlining = 69, calls inlined = 18, statements flattened = 937 [2022-11-21 13:42:38,691 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 13:42:38,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 13:42:38,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 13:42:38,693 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 13:42:38,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:38" (1/1) ... [2022-11-21 13:42:38,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:38" (1/1) ... [2022-11-21 13:42:38,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:38" (1/1) ... [2022-11-21 13:42:38,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:38" (1/1) ... [2022-11-21 13:42:38,806 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:38" (1/1) ... [2022-11-21 13:42:38,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:38" (1/1) ... [2022-11-21 13:42:38,824 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:38" (1/1) ... [2022-11-21 13:42:38,830 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:38" (1/1) ... [2022-11-21 13:42:38,842 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 13:42:38,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 13:42:38,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 13:42:38,843 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 13:42:38,844 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:38" (1/1) ... [2022-11-21 13:42:38,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:42:38,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:42:38,900 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 13:42:38,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 13:42:38,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-11-21 13:42:38,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 13:42:38,962 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-11-21 13:42:38,962 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-11-21 13:42:38,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-21 13:42:38,962 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-21 13:42:38,964 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2022-11-21 13:42:38,964 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2022-11-21 13:42:38,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 13:42:38,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 13:42:38,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 13:42:38,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 13:42:38,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 13:42:38,965 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-21 13:42:38,966 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-21 13:42:38,966 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2022-11-21 13:42:38,966 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2022-11-21 13:42:38,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-21 13:42:38,966 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-21 13:42:38,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 13:42:38,967 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-11-21 13:42:38,967 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-11-21 13:42:38,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 13:42:38,967 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-21 13:42:38,968 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-21 13:42:38,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 13:42:38,968 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2022-11-21 13:42:38,968 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2022-11-21 13:42:38,968 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_equals [2022-11-21 13:42:38,969 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_equals [2022-11-21 13:42:38,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 13:42:38,969 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2022-11-21 13:42:38,969 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2022-11-21 13:42:38,970 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-21 13:42:38,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-21 13:42:38,970 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_hasher [2022-11-21 13:42:38,970 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_hasher [2022-11-21 13:42:38,970 INFO L130 BoogieDeclarations]: Found specification of procedure s_get_next_element [2022-11-21 13:42:38,970 INFO L138 BoogieDeclarations]: Found implementation of procedure s_get_next_element [2022-11-21 13:42:38,971 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-21 13:42:38,971 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-21 13:42:38,972 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_int [2022-11-21 13:42:38,972 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_int [2022-11-21 13:42:38,976 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_iter_is_valid [2022-11-21 13:42:38,977 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_iter_is_valid [2022-11-21 13:42:38,977 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2022-11-21 13:42:38,977 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2022-11-21 13:42:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-21 13:42:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2022-11-21 13:42:38,979 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2022-11-21 13:42:38,979 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-11-21 13:42:38,980 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-11-21 13:42:38,984 INFO L130 BoogieDeclarations]: Found specification of procedure s_remove_entry [2022-11-21 13:42:38,984 INFO L138 BoogieDeclarations]: Found implementation of procedure s_remove_entry [2022-11-21 13:42:38,984 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-11-21 13:42:38,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-11-21 13:42:38,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 13:42:39,600 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 13:42:39,604 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 13:42:39,972 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume !true; [2022-11-21 13:42:39,973 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !true; [2022-11-21 13:42:41,052 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !true; [2022-11-21 13:42:41,077 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 13:42:41,085 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 13:42:41,085 INFO L300 CfgBuilder]: Removed 13 assume(true) statements. [2022-11-21 13:42:41,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:42:41 BoogieIcfgContainer [2022-11-21 13:42:41,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 13:42:41,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 13:42:41,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 13:42:41,093 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 13:42:41,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:42:34" (1/3) ... [2022-11-21 13:42:41,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57551159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:42:41, skipping insertion in model container [2022-11-21 13:42:41,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:42:38" (2/3) ... [2022-11-21 13:42:41,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57551159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:42:41, skipping insertion in model container [2022-11-21 13:42:41,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:42:41" (3/3) ... [2022-11-21 13:42:41,096 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_hash_table_foreach_harness.i [2022-11-21 13:42:41,152 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 13:42:41,152 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 13:42:41,293 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 13:42:41,299 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@477dc24e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 13:42:41,299 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 13:42:41,304 INFO L276 IsEmpty]: Start isEmpty. Operand has 288 states, 187 states have (on average 1.267379679144385) internal successors, (237), 184 states have internal predecessors, (237), 81 states have call successors, (81), 22 states have call predecessors, (81), 22 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2022-11-21 13:42:41,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-21 13:42:41,317 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:41,318 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:42:41,318 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:42:41,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:41,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1669380125, now seen corresponding path program 1 times [2022-11-21 13:42:41,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:41,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086124298] [2022-11-21 13:42:41,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:41,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:41,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:41,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086124298] [2022-11-21 13:42:41,921 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-11-21 13:42:41,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716109018] [2022-11-21 13:42:41,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:41,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:42:41,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:42:41,930 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:42:41,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 13:42:42,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:42,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 2409 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-21 13:42:42,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:42:42,786 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-11-21 13:42:42,786 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:42:42,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716109018] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:42:42,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:42:42,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:42:42,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034470815] [2022-11-21 13:42:42,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:42:42,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 13:42:42,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:42,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 13:42:42,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 13:42:42,829 INFO L87 Difference]: Start difference. First operand has 288 states, 187 states have (on average 1.267379679144385) internal successors, (237), 184 states have internal predecessors, (237), 81 states have call successors, (81), 22 states have call predecessors, (81), 22 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-21 13:42:42,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:42:42,897 INFO L93 Difference]: Finished difference Result 567 states and 831 transitions. [2022-11-21 13:42:42,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 13:42:42,899 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2022-11-21 13:42:42,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:42:42,910 INFO L225 Difference]: With dead ends: 567 [2022-11-21 13:42:42,910 INFO L226 Difference]: Without dead ends: 282 [2022-11-21 13:42:42,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 13:42:42,919 INFO L413 NwaCegarLoop]: 385 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, 385 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:42:42,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:42:42,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-21 13:42:42,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2022-11-21 13:42:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 178 states have (on average 1.2303370786516854) internal successors, (219), 179 states have internal predecessors, (219), 81 states have call successors, (81), 22 states have call predecessors, (81), 22 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2022-11-21 13:42:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 380 transitions. [2022-11-21 13:42:43,007 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 380 transitions. Word has length 120 [2022-11-21 13:42:43,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:42:43,007 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 380 transitions. [2022-11-21 13:42:43,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-21 13:42:43,008 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 380 transitions. [2022-11-21 13:42:43,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-11-21 13:42:43,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:43,012 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:42:43,027 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 13:42:43,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-21 13:42:43,222 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:42:43,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:43,223 INFO L85 PathProgramCache]: Analyzing trace with hash -262655291, now seen corresponding path program 1 times [2022-11-21 13:42:43,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:43,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237509203] [2022-11-21 13:42:43,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:43,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:43,377 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:42:43,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1446319222] [2022-11-21 13:42:43,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:43,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:42:43,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:42:43,383 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:42:43,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 13:42:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:44,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 2437 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 13:42:44,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:42:44,431 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-11-21 13:42:44,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:42:44,729 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-11-21 13:42:44,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:44,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237509203] [2022-11-21 13:42:44,730 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:42:44,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446319222] [2022-11-21 13:42:44,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446319222] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-21 13:42:44,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 13:42:44,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 13 [2022-11-21 13:42:44,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384537879] [2022-11-21 13:42:44,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:42:44,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 13:42:44,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:44,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 13:42:44,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-11-21 13:42:44,741 INFO L87 Difference]: Start difference. First operand 282 states and 380 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 5 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2022-11-21 13:42:45,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:42:45,298 INFO L93 Difference]: Finished difference Result 512 states and 707 transitions. [2022-11-21 13:42:45,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:42:45,299 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 5 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 126 [2022-11-21 13:42:45,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:42:45,305 INFO L225 Difference]: With dead ends: 512 [2022-11-21 13:42:45,306 INFO L226 Difference]: Without dead ends: 299 [2022-11-21 13:42:45,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-11-21 13:42:45,315 INFO L413 NwaCegarLoop]: 341 mSDtfsCounter, 408 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:42:45,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1675 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 13:42:45,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-11-21 13:42:45,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2022-11-21 13:42:45,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 188 states have (on average 1.2287234042553192) internal successors, (231), 190 states have internal predecessors, (231), 86 states have call successors, (86), 23 states have call predecessors, (86), 24 states have return successors, (92), 85 states have call predecessors, (92), 85 states have call successors, (92) [2022-11-21 13:42:45,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 409 transitions. [2022-11-21 13:42:45,370 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 409 transitions. Word has length 126 [2022-11-21 13:42:45,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:42:45,377 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 409 transitions. [2022-11-21 13:42:45,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 5 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2022-11-21 13:42:45,377 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 409 transitions. [2022-11-21 13:42:45,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-21 13:42:45,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:45,388 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:42:45,405 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 13:42:45,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:42:45,589 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:42:45,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:45,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1695610635, now seen corresponding path program 1 times [2022-11-21 13:42:45,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:45,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146418383] [2022-11-21 13:42:45,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:45,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:45,709 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:42:45,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2031134127] [2022-11-21 13:42:45,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:45,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:42:45,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:42:45,711 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:42:45,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 13:42:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:46,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 2442 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 13:42:46,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:42:46,405 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-11-21 13:42:46,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:42:46,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:46,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146418383] [2022-11-21 13:42:46,406 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:42:46,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031134127] [2022-11-21 13:42:46,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031134127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:42:46,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:42:46,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:42:46,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074678308] [2022-11-21 13:42:46,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:42:46,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:42:46,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:46,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:42:46,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:42:46,409 INFO L87 Difference]: Start difference. First operand 299 states and 409 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-21 13:42:46,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:42:46,490 INFO L93 Difference]: Finished difference Result 558 states and 771 transitions. [2022-11-21 13:42:46,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:42:46,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 127 [2022-11-21 13:42:46,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:42:46,495 INFO L225 Difference]: With dead ends: 558 [2022-11-21 13:42:46,495 INFO L226 Difference]: Without dead ends: 304 [2022-11-21 13:42:46,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:42:46,500 INFO L413 NwaCegarLoop]: 377 mSDtfsCounter, 2 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:42:46,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1503 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:42:46,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-11-21 13:42:46,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2022-11-21 13:42:46,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 192 states have (on average 1.2239583333333333) internal successors, (235), 194 states have internal predecessors, (235), 86 states have call successors, (86), 23 states have call predecessors, (86), 25 states have return successors, (93), 86 states have call predecessors, (93), 85 states have call successors, (93) [2022-11-21 13:42:46,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 414 transitions. [2022-11-21 13:42:46,547 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 414 transitions. Word has length 127 [2022-11-21 13:42:46,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:42:46,548 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 414 transitions. [2022-11-21 13:42:46,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-21 13:42:46,548 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 414 transitions. [2022-11-21 13:42:46,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-11-21 13:42:46,551 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:42:46,552 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:42:46,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 13:42:46,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:42:46,761 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:42:46,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:42:46,762 INFO L85 PathProgramCache]: Analyzing trace with hash 818445258, now seen corresponding path program 1 times [2022-11-21 13:42:46,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:42:46,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547813107] [2022-11-21 13:42:46,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:46,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:42:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:48,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:42:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:48,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 13:42:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:48,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 13:42:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:48,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 13:42:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:48,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 13:42:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:48,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:42:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:48,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:42:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:48,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:42:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:48,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 13:42:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:48,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 13:42:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:48,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:42:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:48,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 13:42:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:49,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-21 13:42:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:49,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-21 13:42:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:49,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 13:42:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:49,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-21 13:42:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:49,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-21 13:42:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:49,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-21 13:42:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:49,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-21 13:42:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:49,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-21 13:42:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:49,179 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-11-21 13:42:49,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:42:49,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547813107] [2022-11-21 13:42:49,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547813107] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:42:49,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474575905] [2022-11-21 13:42:49,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:42:49,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:42:49,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:42:49,182 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:42:49,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 13:42:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:42:49,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 2446 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-21 13:42:49,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:42:50,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:42:50,551 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-21 13:42:50,552 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:42:50,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474575905] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:42:50,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 13:42:50,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 22 [2022-11-21 13:42:50,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866917211] [2022-11-21 13:42:50,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:42:50,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 13:42:50,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:42:50,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 13:42:50,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2022-11-21 13:42:50,555 INFO L87 Difference]: Start difference. First operand 304 states and 414 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2022-11-21 13:42:53,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2022-11-21 13:42:55,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:42:57,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:42:59,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:43:01,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:43:03,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:43:05,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:43:07,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:43:09,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:43:12,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:43:14,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:43:16,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:43:18,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:43:18,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:43:18,128 INFO L93 Difference]: Finished difference Result 611 states and 830 transitions. [2022-11-21 13:43:18,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-21 13:43:18,129 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 133 [2022-11-21 13:43:18,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:43:18,131 INFO L225 Difference]: With dead ends: 611 [2022-11-21 13:43:18,132 INFO L226 Difference]: Without dead ends: 371 [2022-11-21 13:43:18,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2022-11-21 13:43:18,134 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 180 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 40 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 2223 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:43:18,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 2223 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 374 Invalid, 13 Unknown, 0 Unchecked, 27.3s Time] [2022-11-21 13:43:18,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-11-21 13:43:18,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 364. [2022-11-21 13:43:18,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 233 states have (on average 1.2145922746781115) internal successors, (283), 237 states have internal predecessors, (283), 94 states have call successors, (94), 32 states have call predecessors, (94), 36 states have return successors, (105), 94 states have call predecessors, (105), 93 states have call successors, (105) [2022-11-21 13:43:18,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 482 transitions. [2022-11-21 13:43:18,167 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 482 transitions. Word has length 133 [2022-11-21 13:43:18,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:43:18,168 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 482 transitions. [2022-11-21 13:43:18,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2022-11-21 13:43:18,168 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 482 transitions. [2022-11-21 13:43:18,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-11-21 13:43:18,170 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:43:18,170 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:43:18,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 13:43:18,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:43:18,380 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:43:18,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:43:18,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1772385416, now seen corresponding path program 1 times [2022-11-21 13:43:18,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:43:18,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800453990] [2022-11-21 13:43:18,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:43:18,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:43:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:18,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:43:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:18,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 13:43:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:18,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 13:43:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:18,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 13:43:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:19,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 13:43:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:19,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:43:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:19,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:43:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:19,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:43:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:19,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 13:43:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:19,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 13:43:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:19,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:43:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:19,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 13:43:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:19,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-21 13:43:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:19,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-21 13:43:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:19,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 13:43:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:19,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-21 13:43:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:19,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-21 13:43:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:19,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-21 13:43:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:19,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-21 13:43:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:19,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-21 13:43:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-11-21 13:43:19,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:43:19,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800453990] [2022-11-21 13:43:19,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800453990] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:43:19,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921322750] [2022-11-21 13:43:19,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:43:19,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:43:19,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:43:19,288 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:43:19,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 13:43:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:19,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 2441 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 13:43:19,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:43:20,119 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-21 13:43:20,119 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:43:20,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921322750] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:43:20,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 13:43:20,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2022-11-21 13:43:20,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721092198] [2022-11-21 13:43:20,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:43:20,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:43:20,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:43:20,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:43:20,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-21 13:43:20,123 INFO L87 Difference]: Start difference. First operand 364 states and 482 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-11-21 13:43:20,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:43:20,564 INFO L93 Difference]: Finished difference Result 647 states and 874 transitions. [2022-11-21 13:43:20,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:43:20,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 133 [2022-11-21 13:43:20,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:43:20,575 INFO L225 Difference]: With dead ends: 647 [2022-11-21 13:43:20,575 INFO L226 Difference]: Without dead ends: 376 [2022-11-21 13:43:20,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-11-21 13:43:20,579 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 409 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:43:20,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 1254 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:43:20,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-11-21 13:43:20,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 373. [2022-11-21 13:43:20,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 239 states have (on average 1.213389121338912) internal successors, (290), 244 states have internal predecessors, (290), 96 states have call successors, (96), 32 states have call predecessors, (96), 37 states have return successors, (110), 96 states have call predecessors, (110), 95 states have call successors, (110) [2022-11-21 13:43:20,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 496 transitions. [2022-11-21 13:43:20,635 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 496 transitions. Word has length 133 [2022-11-21 13:43:20,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:43:20,636 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 496 transitions. [2022-11-21 13:43:20,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-11-21 13:43:20,636 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 496 transitions. [2022-11-21 13:43:20,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-21 13:43:20,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:43:20,639 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:43:20,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 13:43:20,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:43:20,850 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:43:20,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:43:20,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1889144309, now seen corresponding path program 1 times [2022-11-21 13:43:20,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:43:20,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921634417] [2022-11-21 13:43:20,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:43:20,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:43:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:21,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:43:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:21,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 13:43:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:21,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 13:43:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:21,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 13:43:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:21,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 13:43:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:21,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:43:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:21,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:43:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:21,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:43:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:21,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 13:43:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:21,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 13:43:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:21,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:43:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:21,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 13:43:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:22,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 13:43:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:22,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-21 13:43:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:22,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 13:43:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:22,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-21 13:43:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:22,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 13:43:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:22,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-21 13:43:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:22,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-21 13:43:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:22,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-21 13:43:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:22,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-21 13:43:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:22,316 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-11-21 13:43:22,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:43:22,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921634417] [2022-11-21 13:43:22,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921634417] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:43:22,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604184188] [2022-11-21 13:43:22,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:43:22,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:43:22,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:43:22,319 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:43:22,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 13:43:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:23,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 2470 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-21 13:43:23,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:43:25,224 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= 0 (select (select |c_#memory_$Pointer$.offset| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset)))) (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= (select (select |c_#memory_$Pointer$.base| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset) 0)))) is different from true [2022-11-21 13:43:33,300 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:43:41,373 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:43:41,399 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-21 13:43:41,400 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:43:41,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604184188] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:43:41,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 13:43:41,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2022-11-21 13:43:41,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367930390] [2022-11-21 13:43:41,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:43:41,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 13:43:41,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:43:41,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 13:43:41,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=202, Unknown=3, NotChecked=28, Total=272 [2022-11-21 13:43:41,403 INFO L87 Difference]: Start difference. First operand 373 states and 496 transitions. Second operand has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2022-11-21 13:43:43,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:43:45,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:43:51,501 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:43:52,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:43:52,273 INFO L93 Difference]: Finished difference Result 671 states and 920 transitions. [2022-11-21 13:43:52,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 13:43:52,274 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 139 [2022-11-21 13:43:52,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:43:52,276 INFO L225 Difference]: With dead ends: 671 [2022-11-21 13:43:52,277 INFO L226 Difference]: Without dead ends: 387 [2022-11-21 13:43:52,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 24.6s TimeCoverageRelationStatistics Valid=67, Invalid=314, Unknown=3, NotChecked=36, Total=420 [2022-11-21 13:43:52,279 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 12 mSDsluCounter, 1703 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 397 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-21 13:43:52,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2079 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 218 Invalid, 1 Unknown, 397 Unchecked, 4.6s Time] [2022-11-21 13:43:52,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-11-21 13:43:52,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 385. [2022-11-21 13:43:52,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 247 states have (on average 1.2064777327935223) internal successors, (298), 252 states have internal predecessors, (298), 98 states have call successors, (98), 34 states have call predecessors, (98), 39 states have return successors, (112), 98 states have call predecessors, (112), 97 states have call successors, (112) [2022-11-21 13:43:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 508 transitions. [2022-11-21 13:43:52,311 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 508 transitions. Word has length 139 [2022-11-21 13:43:52,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:43:52,311 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 508 transitions. [2022-11-21 13:43:52,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2022-11-21 13:43:52,312 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 508 transitions. [2022-11-21 13:43:52,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-11-21 13:43:52,314 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:43:52,314 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:43:52,331 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 13:43:52,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:43:52,524 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:43:52,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:43:52,524 INFO L85 PathProgramCache]: Analyzing trace with hash -817837060, now seen corresponding path program 1 times [2022-11-21 13:43:52,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:43:52,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854325143] [2022-11-21 13:43:52,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:43:52,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:43:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:54,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:43:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:54,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 13:43:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:54,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 13:43:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:54,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 13:43:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:54,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 13:43:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:54,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:43:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:54,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:43:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:54,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:43:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:54,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 13:43:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:54,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 13:43:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:54,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:43:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:54,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 13:43:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:54,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 13:43:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:54,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:43:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:54,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-21 13:43:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:54,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 13:43:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:54,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-21 13:43:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:54,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-21 13:43:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:55,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-21 13:43:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:55,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-21 13:43:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:55,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-21 13:43:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:55,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-21 13:43:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:43:55,275 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-21 13:43:55,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:43:55,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854325143] [2022-11-21 13:43:55,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854325143] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:43:55,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:43:55,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-21 13:43:55,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656024089] [2022-11-21 13:43:55,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:43:55,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-21 13:43:55,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:43:55,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-21 13:43:55,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-11-21 13:43:55,278 INFO L87 Difference]: Start difference. First operand 385 states and 508 transitions. Second operand has 18 states, 16 states have (on average 4.375) internal successors, (70), 13 states have internal predecessors, (70), 8 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-11-21 13:44:00,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:44:00,159 INFO L93 Difference]: Finished difference Result 643 states and 874 transitions. [2022-11-21 13:44:00,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-21 13:44:00,160 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.375) internal successors, (70), 13 states have internal predecessors, (70), 8 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 144 [2022-11-21 13:44:00,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:44:00,163 INFO L225 Difference]: With dead ends: 643 [2022-11-21 13:44:00,163 INFO L226 Difference]: Without dead ends: 411 [2022-11-21 13:44:00,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=985, Unknown=0, NotChecked=0, Total=1190 [2022-11-21 13:44:00,165 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 412 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 3799 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1718 SdHoareTripleChecker+Invalid, 4018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 3799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:44:00,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 1718 Invalid, 4018 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [219 Valid, 3799 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-11-21 13:44:00,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-11-21 13:44:00,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 400. [2022-11-21 13:44:00,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 265 states have internal predecessors, (311), 100 states have call successors, (100), 34 states have call predecessors, (100), 42 states have return successors, (125), 100 states have call predecessors, (125), 99 states have call successors, (125) [2022-11-21 13:44:00,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 536 transitions. [2022-11-21 13:44:00,248 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 536 transitions. Word has length 144 [2022-11-21 13:44:00,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:44:00,249 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 536 transitions. [2022-11-21 13:44:00,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.375) internal successors, (70), 13 states have internal predecessors, (70), 8 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-11-21 13:44:00,250 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 536 transitions. [2022-11-21 13:44:00,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-11-21 13:44:00,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:44:00,252 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:44:00,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 13:44:00,252 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:44:00,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:44:00,253 INFO L85 PathProgramCache]: Analyzing trace with hash -951850566, now seen corresponding path program 1 times [2022-11-21 13:44:00,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:44:00,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075377584] [2022-11-21 13:44:00,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:00,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:44:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:01,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:44:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:01,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 13:44:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:02,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 13:44:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:02,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 13:44:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:02,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 13:44:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:02,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:44:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:02,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:44:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:02,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:44:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:02,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 13:44:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:02,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 13:44:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:02,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:44:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:02,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 13:44:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:02,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 13:44:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:02,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:44:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:02,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-21 13:44:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:02,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 13:44:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:02,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-21 13:44:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:02,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-21 13:44:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:02,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-21 13:44:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:02,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-21 13:44:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:02,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-21 13:44:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:02,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-21 13:44:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:02,893 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-11-21 13:44:02,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:44:02,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075377584] [2022-11-21 13:44:02,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075377584] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:44:02,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293979934] [2022-11-21 13:44:02,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:02,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:44:02,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:44:02,899 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:44:02,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 13:44:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:03,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 2495 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-21 13:44:03,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:44:03,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:44:03,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-21 13:44:03,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:44:04,118 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-21 13:44:04,118 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:44:04,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293979934] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:44:04,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 13:44:04,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [18] total 29 [2022-11-21 13:44:04,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618342055] [2022-11-21 13:44:04,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:44:04,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-21 13:44:04,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:44:04,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-21 13:44:04,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2022-11-21 13:44:04,120 INFO L87 Difference]: Start difference. First operand 400 states and 536 transitions. Second operand has 13 states, 11 states have (on average 6.909090909090909) internal successors, (76), 12 states have internal predecessors, (76), 8 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-11-21 13:44:06,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:44:08,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:44:10,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:44:12,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:44:14,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2022-11-21 13:44:16,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:44:18,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:44:20,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:44:22,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:44:24,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:44:26,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:44:28,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:44:32,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:44:34,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:44:36,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:44:38,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:44:40,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:44:42,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:44:44,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:44:46,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:44:46,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:44:46,689 INFO L93 Difference]: Finished difference Result 838 states and 1151 transitions. [2022-11-21 13:44:46,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 13:44:46,690 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.909090909090909) internal successors, (76), 12 states have internal predecessors, (76), 8 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 144 [2022-11-21 13:44:46,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:44:46,692 INFO L225 Difference]: With dead ends: 838 [2022-11-21 13:44:46,692 INFO L226 Difference]: Without dead ends: 555 [2022-11-21 13:44:46,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=187, Invalid=1535, Unknown=0, NotChecked=0, Total=1722 [2022-11-21 13:44:46,695 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 822 mSDsluCounter, 2267 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 363 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 2628 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:44:46,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 2628 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 964 Invalid, 20 Unknown, 0 Unchecked, 42.1s Time] [2022-11-21 13:44:46,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2022-11-21 13:44:46,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 543. [2022-11-21 13:44:46,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 346 states have (on average 1.216763005780347) internal successors, (421), 358 states have internal predecessors, (421), 142 states have call successors, (142), 47 states have call predecessors, (142), 54 states have return successors, (160), 137 states have call predecessors, (160), 140 states have call successors, (160) [2022-11-21 13:44:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 723 transitions. [2022-11-21 13:44:46,750 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 723 transitions. Word has length 144 [2022-11-21 13:44:46,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:44:46,751 INFO L495 AbstractCegarLoop]: Abstraction has 543 states and 723 transitions. [2022-11-21 13:44:46,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.909090909090909) internal successors, (76), 12 states have internal predecessors, (76), 8 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-11-21 13:44:46,751 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 723 transitions. [2022-11-21 13:44:46,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-11-21 13:44:46,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:44:46,754 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:44:46,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 13:44:46,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-21 13:44:46,965 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:44:46,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:44:46,966 INFO L85 PathProgramCache]: Analyzing trace with hash 2132172247, now seen corresponding path program 1 times [2022-11-21 13:44:46,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:44:46,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749604267] [2022-11-21 13:44:46,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:46,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:44:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:49,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:44:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:49,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 13:44:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:49,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 13:44:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:49,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 13:44:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:49,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 13:44:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:49,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:44:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:49,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:44:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:49,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:44:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:49,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 13:44:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:49,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 13:44:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:49,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:44:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:49,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 13:44:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:49,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 13:44:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:49,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:44:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:49,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-21 13:44:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:49,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 13:44:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:49,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-21 13:44:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:49,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-21 13:44:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:49,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-21 13:44:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:49,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:44:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:49,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 13:44:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:49,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-21 13:44:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:49,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-21 13:44:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:50,107 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-21 13:44:50,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:44:50,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749604267] [2022-11-21 13:44:50,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749604267] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:44:50,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:44:50,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-21 13:44:50,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001369776] [2022-11-21 13:44:50,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:44:50,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-21 13:44:50,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:44:50,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-21 13:44:50,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2022-11-21 13:44:50,110 INFO L87 Difference]: Start difference. First operand 543 states and 723 transitions. Second operand has 19 states, 16 states have (on average 4.5625) internal successors, (73), 14 states have internal predecessors, (73), 9 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (23), 7 states have call predecessors, (23), 8 states have call successors, (23) [2022-11-21 13:44:54,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:44:54,422 INFO L93 Difference]: Finished difference Result 953 states and 1299 transitions. [2022-11-21 13:44:54,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-21 13:44:54,423 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 4.5625) internal successors, (73), 14 states have internal predecessors, (73), 9 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (23), 7 states have call predecessors, (23), 8 states have call successors, (23) Word has length 148 [2022-11-21 13:44:54,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:44:54,432 INFO L225 Difference]: With dead ends: 953 [2022-11-21 13:44:54,432 INFO L226 Difference]: Without dead ends: 561 [2022-11-21 13:44:54,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=1003, Unknown=0, NotChecked=0, Total=1190 [2022-11-21 13:44:54,437 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 418 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 3446 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 3647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 3446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-21 13:44:54,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1479 Invalid, 3647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 3446 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-11-21 13:44:54,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2022-11-21 13:44:54,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 541. [2022-11-21 13:44:54,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 345 states have (on average 1.2173913043478262) internal successors, (420), 356 states have internal predecessors, (420), 142 states have call successors, (142), 47 states have call predecessors, (142), 53 states have return successors, (155), 137 states have call predecessors, (155), 140 states have call successors, (155) [2022-11-21 13:44:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 717 transitions. [2022-11-21 13:44:54,496 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 717 transitions. Word has length 148 [2022-11-21 13:44:54,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:44:54,497 INFO L495 AbstractCegarLoop]: Abstraction has 541 states and 717 transitions. [2022-11-21 13:44:54,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 4.5625) internal successors, (73), 14 states have internal predecessors, (73), 9 states have call successors, (24), 6 states have call predecessors, (24), 4 states have return successors, (23), 7 states have call predecessors, (23), 8 states have call successors, (23) [2022-11-21 13:44:54,497 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 717 transitions. [2022-11-21 13:44:54,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-11-21 13:44:54,500 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:44:54,500 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:44:54,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 13:44:54,500 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:44:54,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:44:54,501 INFO L85 PathProgramCache]: Analyzing trace with hash -737363795, now seen corresponding path program 1 times [2022-11-21 13:44:54,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:44:54,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933566245] [2022-11-21 13:44:54,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:54,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:44:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:57,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:44:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:57,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 13:44:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:57,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 13:44:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:57,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 13:44:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:57,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 13:44:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:57,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:44:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:57,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:44:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:57,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:44:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:57,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 13:44:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:57,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 13:44:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:57,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:44:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:57,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 13:44:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:57,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 13:44:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:57,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:44:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:57,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-21 13:44:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:57,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 13:44:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:57,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-21 13:44:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:57,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-21 13:44:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:57,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-21 13:44:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:57,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-21 13:44:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:57,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-21 13:44:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:57,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-21 13:44:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:57,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 13:44:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:57,807 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-11-21 13:44:57,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:44:57,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933566245] [2022-11-21 13:44:57,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933566245] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:44:57,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309769112] [2022-11-21 13:44:57,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:57,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:44:57,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:44:57,811 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:44:57,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 13:44:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:44:58,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 2527 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-21 13:44:58,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:44:58,684 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-11-21 13:44:58,685 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:44:58,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309769112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:44:58,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 13:44:58,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2022-11-21 13:44:58,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755800064] [2022-11-21 13:44:58,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:44:58,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:44:58,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:44:58,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:44:58,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2022-11-21 13:44:58,687 INFO L87 Difference]: Start difference. First operand 541 states and 717 transitions. Second operand has 7 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-11-21 13:44:58,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:44:58,976 INFO L93 Difference]: Finished difference Result 970 states and 1312 transitions. [2022-11-21 13:44:58,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:44:58,977 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 153 [2022-11-21 13:44:58,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:44:58,981 INFO L225 Difference]: With dead ends: 970 [2022-11-21 13:44:58,981 INFO L226 Difference]: Without dead ends: 550 [2022-11-21 13:44:58,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-11-21 13:44:58,984 INFO L413 NwaCegarLoop]: 356 mSDtfsCounter, 2 mSDsluCounter, 1719 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2075 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:44:58,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2075 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:44:58,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-11-21 13:44:59,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 538. [2022-11-21 13:44:59,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 343 states have (on average 1.215743440233236) internal successors, (417), 353 states have internal predecessors, (417), 142 states have call successors, (142), 47 states have call predecessors, (142), 52 states have return successors, (154), 137 states have call predecessors, (154), 140 states have call successors, (154) [2022-11-21 13:44:59,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 713 transitions. [2022-11-21 13:44:59,039 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 713 transitions. Word has length 153 [2022-11-21 13:44:59,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:44:59,040 INFO L495 AbstractCegarLoop]: Abstraction has 538 states and 713 transitions. [2022-11-21 13:44:59,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-11-21 13:44:59,041 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 713 transitions. [2022-11-21 13:44:59,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-11-21 13:44:59,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:44:59,043 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:44:59,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 13:44:59,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:44:59,260 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:44:59,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:44:59,261 INFO L85 PathProgramCache]: Analyzing trace with hash 538022179, now seen corresponding path program 2 times [2022-11-21 13:44:59,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:44:59,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837272432] [2022-11-21 13:44:59,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:44:59,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:44:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:03,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:45:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:03,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 13:45:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:03,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 13:45:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:03,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 13:45:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:04,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 13:45:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:04,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:45:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:04,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:45:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:04,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:45:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:04,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 13:45:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:04,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 13:45:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:04,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:45:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:04,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 13:45:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:04,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 13:45:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:04,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:45:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:04,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-21 13:45:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:04,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 13:45:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:04,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 13:45:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:04,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:45:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:04,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-21 13:45:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:04,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-21 13:45:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:04,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-21 13:45:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:04,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-21 13:45:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:04,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-21 13:45:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:04,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-21 13:45:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:04,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 13:45:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:04,950 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-11-21 13:45:04,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:04,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837272432] [2022-11-21 13:45:04,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837272432] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:45:04,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658960944] [2022-11-21 13:45:04,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:45:04,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:45:04,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:45:04,953 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:45:04,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 13:45:05,797 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:45:05,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:45:05,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 2581 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-21 13:45:05,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:45:06,010 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-11-21 13:45:06,010 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:45:06,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658960944] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:06,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 13:45:06,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [24] total 29 [2022-11-21 13:45:06,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780718707] [2022-11-21 13:45:06,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:06,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:45:06,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:06,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:45:06,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=748, Unknown=0, NotChecked=0, Total=812 [2022-11-21 13:45:06,012 INFO L87 Difference]: Start difference. First operand 538 states and 713 transitions. Second operand has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-11-21 13:45:06,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:06,329 INFO L93 Difference]: Finished difference Result 954 states and 1294 transitions. [2022-11-21 13:45:06,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:45:06,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 164 [2022-11-21 13:45:06,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:06,334 INFO L225 Difference]: With dead ends: 954 [2022-11-21 13:45:06,334 INFO L226 Difference]: Without dead ends: 550 [2022-11-21 13:45:06,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=802, Unknown=0, NotChecked=0, Total=870 [2022-11-21 13:45:06,337 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 2 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2086 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:06,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2086 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:45:06,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-11-21 13:45:06,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2022-11-21 13:45:06,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 351 states have (on average 1.210826210826211) internal successors, (425), 365 states have internal predecessors, (425), 142 states have call successors, (142), 47 states have call predecessors, (142), 56 states have return successors, (160), 137 states have call predecessors, (160), 140 states have call successors, (160) [2022-11-21 13:45:06,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 727 transitions. [2022-11-21 13:45:06,389 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 727 transitions. Word has length 164 [2022-11-21 13:45:06,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:06,389 INFO L495 AbstractCegarLoop]: Abstraction has 550 states and 727 transitions. [2022-11-21 13:45:06,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-11-21 13:45:06,390 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 727 transitions. [2022-11-21 13:45:06,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-11-21 13:45:06,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:06,392 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:06,409 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-21 13:45:06,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:45:06,609 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:45:06,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:06,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2001607967, now seen corresponding path program 3 times [2022-11-21 13:45:06,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:06,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963646590] [2022-11-21 13:45:06,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:06,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:11,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:45:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:11,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 13:45:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:11,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 13:45:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:11,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 13:45:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:11,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 13:45:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:11,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:45:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:11,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:45:11,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:11,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:45:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:11,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 13:45:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:11,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 13:45:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:11,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:45:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:11,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 13:45:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:11,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 13:45:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:11,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:45:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:11,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-21 13:45:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:11,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 13:45:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:11,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 13:45:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:11,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:45:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:11,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-21 13:45:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:11,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-21 13:45:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:12,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-21 13:45:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:12,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-21 13:45:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:12,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 13:45:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:12,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:45:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:12,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-21 13:45:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:12,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-21 13:45:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:12,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 13:45:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-11-21 13:45:12,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:12,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963646590] [2022-11-21 13:45:12,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963646590] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:45:12,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265388382] [2022-11-21 13:45:12,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 13:45:12,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:45:12,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:45:12,532 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:45:12,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db27ba7d-569f-4d10-ad2b-446a42e9f30e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-21 13:45:13,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-21 13:45:13,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:45:13,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 2058 conjuncts, 141 conjunts are in the unsatisfiable core [2022-11-21 13:45:13,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:45:13,838 INFO L321 Elim1Store]: treesize reduction 80, result has 17.5 percent of original size [2022-11-21 13:45:13,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 86 [2022-11-21 13:45:13,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:45:13,900 INFO L321 Elim1Store]: treesize reduction 44, result has 35.3 percent of original size [2022-11-21 13:45:13,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 69 [2022-11-21 13:45:13,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:45:13,956 INFO L321 Elim1Store]: treesize reduction 64, result has 36.0 percent of original size [2022-11-21 13:45:13,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 78 [2022-11-21 13:45:13,992 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-21 13:45:13,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 56 [2022-11-21 13:45:14,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 13:45:14,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2022-11-21 13:45:14,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2022-11-21 13:45:16,849 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_10 Int)) (and (= v_s_get_next_element_~iter.base_BEFORE_CALL_10 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_10) 0)) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_10) (= (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_10) 0) 32))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_10 Int)) (and (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_10) 0)) (.cse1 (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_10) 0))) (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (+ 40 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1)))) (select (select |c_#memory_int| v_s_get_next_element_~iter.base_BEFORE_CALL_10) 32)) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_10))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_10 Int)) (and (= v_s_get_next_element_~iter.base_BEFORE_CALL_10 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_10) 0)) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_10) (= (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_10) 0) 0)))) is different from true [2022-11-21 13:46:02,931 WARN L233 SmtUtils]: Spent 6.73s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:46:17,623 WARN L233 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:46:25,921 WARN L233 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:46:34,214 WARN L233 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:46:36,259 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_11 Int)) (and (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_11) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_11) 0)) (.cse1 (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_11) 0))) (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (+ 40 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1)))) (select (select |c_#memory_int| v_s_get_next_element_~iter.base_BEFORE_CALL_11) 32)))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_11 Int)) (and (= (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_11) 0) 32) (= v_s_get_next_element_~iter.base_BEFORE_CALL_11 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_11) 0)) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_11))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_11 Int)) (and (= (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_11) 0) 0) (= v_s_get_next_element_~iter.base_BEFORE_CALL_11 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_11) 0)) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_11)))) (or (exists ((|v_aws_hash_table_is_valid_#in~map.base_BEFORE_CALL_1| Int) (|v_aws_hash_table_is_valid_#in~map.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_hash_table_is_valid_#in~map.base_BEFORE_CALL_1|) |v_aws_hash_table_is_valid_#in~map.offset_BEFORE_CALL_1|) 0))) (exists ((|v_aws_hash_table_is_valid_#in~map.base_BEFORE_CALL_1| Int) (|v_aws_hash_table_is_valid_#in~map.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_hash_table_is_valid_#in~map.base_BEFORE_CALL_1|) |v_aws_hash_table_is_valid_#in~map.offset_BEFORE_CALL_1|) 0))))) is different from true [2022-11-21 13:46:52,697 WARN L233 SmtUtils]: Spent 16.15s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:47:09,107 WARN L233 SmtUtils]: Spent 16.10s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:47:44,492 WARN L233 SmtUtils]: Spent 34.58s on a formula simplification. DAG size of input: 68 DAG size of output: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:48:01,756 WARN L233 SmtUtils]: Spent 16.57s on a formula simplification. DAG size of input: 74 DAG size of output: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:48:10,787 WARN L233 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:48:27,651 WARN L233 SmtUtils]: Spent 16.23s on a formula simplification. DAG size of input: 62 DAG size of output: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:48:30,370 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_12 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (and (= (select (select |c_#memory_int| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 32) (select (select |c_#memory_int| .cse0) (+ 40 (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2)))) (not (= .cse0 0)) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_12))))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_12 Int)) (and (= (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0) 0) (= (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0) v_s_get_next_element_~iter.base_BEFORE_CALL_12) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_12))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_12 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0)) (.cse5 (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5))) (and (not (= .cse3 0)) (= (select (select |c_#memory_int| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 32) (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse4) .cse5)) (+ 40 .cse3))) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_12))))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_12 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0)) (.cse6 (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0))) (and (= 32 .cse6) (= .cse7 v_s_get_next_element_~iter.base_BEFORE_CALL_12) (not (= (select (select |c_#memory_$Pointer$.base| .cse7) .cse6) 0)) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_12)))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_12 Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0)) (.cse8 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_12) 0))) (and (not (= (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9) 0)) (= 32 .cse9) (= .cse8 v_s_get_next_element_~iter.base_BEFORE_CALL_12) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_12))))) is different from true [2022-11-21 13:48:45,321 WARN L233 SmtUtils]: Spent 14.65s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:49:01,950 WARN L233 SmtUtils]: Spent 16.31s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:49:03,353 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:49:03,355 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:49:03,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:49:03,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:49:03,378 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:49:03,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 145 treesize of output 121 [2022-11-21 13:49:06,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:49:06,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:49:06,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:49:06,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:49:06,661 INFO L321 Elim1Store]: treesize reduction 252, result has 4.2 percent of original size [2022-11-21 13:49:06,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 127 [2022-11-21 13:49:06,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:49:06,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:49:06,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:49:06,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:49:06,710 INFO L321 Elim1Store]: treesize reduction 252, result has 4.2 percent of original size [2022-11-21 13:49:06,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 127 [2022-11-21 13:49:10,759 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 2 proven. 65 refuted. 0 times theorem prover too weak. 84 trivial. 45 not checked. [2022-11-21 13:49:10,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:49:32,990 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:49:45,706 WARN L233 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:50:00,524 WARN L233 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:50:11,606 WARN L233 SmtUtils]: Spent 8.85s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:50:22,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265388382] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:50:22,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:50:22,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 38] total 66 [2022-11-21 13:50:22,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30471231] [2022-11-21 13:50:22,256 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:50:22,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-21 13:50:22,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:50:22,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-21 13:50:22,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=5372, Unknown=35, NotChecked=450, Total=6162 [2022-11-21 13:50:22,260 INFO L87 Difference]: Start difference. First operand 550 states and 727 transitions. Second operand has 66 states, 56 states have (on average 2.9107142857142856) internal successors, (163), 51 states have internal predecessors, (163), 24 states have call successors, (52), 15 states have call predecessors, (52), 15 states have return successors, (49), 19 states have call predecessors, (49), 21 states have call successors, (49) [2022-11-21 13:50:24,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:50:27,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:50:32,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:50:34,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:50:37,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:50:40,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:50:42,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:50:44,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2022-11-21 13:50:49,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:50:51,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:50:53,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:50:58,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:51:00,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:51:02,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:51:04,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:51:07,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:51:09,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:51:11,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:51:14,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:51:16,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:51:18,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:51:20,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:51:22,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:51:24,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:51:27,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:51:29,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:51:32,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:51:34,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:51:36,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:51:38,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:51:42,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:51:47,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:51:49,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:51:53,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:51:56,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:51:58,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:52:01,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:52:03,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:52:05,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:52:08,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:52:13,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:52:15,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:52:19,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:52:21,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:52:23,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:52:25,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:52:27,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:52:30,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:52:55,021 WARN L233 SmtUtils]: Spent 23.76s on a formula simplification. DAG size of input: 93 DAG size of output: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:53:22,137 WARN L233 SmtUtils]: Spent 26.70s on a formula simplification. DAG size of input: 95 DAG size of output: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:53:33,140 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:53:39,596 WARN L233 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:53:46,828 WARN L233 SmtUtils]: Spent 6.95s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:54:11,956 WARN L233 SmtUtils]: Spent 20.15s on a formula simplification. DAG size of input: 97 DAG size of output: 80 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:54:24,372 WARN L233 SmtUtils]: Spent 12.21s on a formula simplification. DAG size of input: 87 DAG size of output: 87 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:54:26,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:54:57,453 WARN L233 SmtUtils]: Spent 18.05s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:54:59,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:55:11,541 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:55:30,699 WARN L233 SmtUtils]: Spent 18.06s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:55:32,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:55:34,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:55:50,557 WARN L233 SmtUtils]: Spent 15.53s on a formula simplification that was a NOOP. DAG size: 78 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:55:52,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:56:09,650 WARN L233 SmtUtils]: Spent 14.12s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:56:30,235 WARN L233 SmtUtils]: Spent 20.20s on a formula simplification. DAG size of input: 113 DAG size of output: 96 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:57:07,161 WARN L233 SmtUtils]: Spent 26.33s on a formula simplification. DAG size of input: 88 DAG size of output: 62 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)