./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_hash_iter_begin_harness-1.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_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/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_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_hash_iter_begin_harness-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/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_3d7b42b9-92e1-481a-897f-69be1779168e/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 b875da017a84450a4103e052cdea13d2bfe14ebd5ef6946815ef19c566574bb1 --- 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:58:51,712 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:58:51,715 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:58:51,761 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:58:51,762 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:58:51,766 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:58:51,770 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:58:51,774 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:58:51,776 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:58:51,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:58:51,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:58:51,784 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:58:51,785 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:58:51,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:58:51,787 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:58:51,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:58:51,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:58:51,790 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:58:51,792 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:58:51,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:58:51,795 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:58:51,798 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:58:51,799 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:58:51,800 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:58:51,803 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:58:51,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:58:51,804 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:58:51,805 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:58:51,806 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:58:51,807 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:58:51,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:58:51,808 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:58:51,809 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:58:51,810 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:58:51,811 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:58:51,811 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:58:51,812 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:58:51,812 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:58:51,812 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:58:51,820 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:58:51,823 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:58:51,824 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-21 13:58:51,872 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:58:51,872 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:58:51,873 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:58:51,873 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:58:51,874 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 13:58:51,874 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 13:58:51,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:58:51,876 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:58:51,876 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:58:51,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:58:51,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:58:51,878 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:58:51,878 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 13:58:51,878 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 13:58:51,878 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 13:58:51,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 13:58:51,879 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:58:51,879 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 13:58:51,879 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:58:51,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:58:51,880 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 13:58:51,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:58:51,880 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:58:51,881 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 13:58:51,881 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 13:58:51,881 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 13:58:51,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 13:58:51,881 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 13:58:51,882 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 13:58:51,883 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 13:58:51,883 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_3d7b42b9-92e1-481a-897f-69be1779168e/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_3d7b42b9-92e1-481a-897f-69be1779168e/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 -> b875da017a84450a4103e052cdea13d2bfe14ebd5ef6946815ef19c566574bb1 [2022-11-21 13:58:52,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:58:52,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:58:52,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:58:52,193 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:58:52,193 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:58:52,195 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/aws-c-common/aws_hash_iter_begin_harness-1.i [2022-11-21 13:58:55,421 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:58:56,076 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:58:56,077 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/sv-benchmarks/c/aws-c-common/aws_hash_iter_begin_harness-1.i [2022-11-21 13:58:56,129 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/data/4c260ec96/bcf433af97644327bf3e19af399f7ae1/FLAGf1f8366b9 [2022-11-21 13:58:56,147 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/data/4c260ec96/bcf433af97644327bf3e19af399f7ae1 [2022-11-21 13:58:56,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:58:56,153 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:58:56,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:58:56,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:58:56,160 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:58:56,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:58:56" (1/1) ... [2022-11-21 13:58:56,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@300d75a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:56, skipping insertion in model container [2022-11-21 13:58:56,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:58:56" (1/1) ... [2022-11-21 13:58:56,171 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:58:56,330 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:58:56,636 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_3d7b42b9-92e1-481a-897f-69be1779168e/sv-benchmarks/c/aws-c-common/aws_hash_iter_begin_harness-1.i[4493,4506] [2022-11-21 13:58:56,644 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_3d7b42b9-92e1-481a-897f-69be1779168e/sv-benchmarks/c/aws-c-common/aws_hash_iter_begin_harness-1.i[4553,4566] [2022-11-21 13:58:57,702 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:57,703 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:57,704 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:57,705 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:57,707 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:57,722 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:57,723 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:57,725 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:57,732 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:57,735 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:57,736 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:57,737 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:57,738 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:58,251 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-21 13:58:58,253 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-21 13:58:58,254 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-21 13:58:58,256 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-21 13:58:58,258 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-21 13:58:58,259 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-21 13:58:58,260 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-21 13:58:58,261 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-21 13:58:58,262 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-21 13:58:58,263 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-21 13:58:58,490 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-21 13:58:58,895 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:58,897 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:58,944 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:58,946 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:58,954 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:58,956 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:58,977 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:58,979 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:58,980 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:58,981 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:58,982 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:58,983 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:58,983 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:59,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:58:59,086 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 13:58:59,113 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_3d7b42b9-92e1-481a-897f-69be1779168e/sv-benchmarks/c/aws-c-common/aws_hash_iter_begin_harness-1.i[4493,4506] [2022-11-21 13:58:59,114 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_3d7b42b9-92e1-481a-897f-69be1779168e/sv-benchmarks/c/aws-c-common/aws_hash_iter_begin_harness-1.i[4553,4566] [2022-11-21 13:58:59,165 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:59,166 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:59,166 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:59,167 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:59,167 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:59,176 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:59,177 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:59,182 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:59,183 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:59,184 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:59,184 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:59,185 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:59,185 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:59,222 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-21 13:58:59,223 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-21 13:58:59,224 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-21 13:58:59,224 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-21 13:58:59,225 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-21 13:58:59,226 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-21 13:58:59,229 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-21 13:58:59,230 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-21 13:58:59,230 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-21 13:58:59,231 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-21 13:58:59,263 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-21 13:58:59,381 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:59,381 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:59,391 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:59,392 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:59,395 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:59,396 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:59,410 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:59,412 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:59,412 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:59,413 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:59,414 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:59,415 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:59,416 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-21 13:58:59,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:58:59,801 INFO L208 MainTranslator]: Completed translation [2022-11-21 13:58:59,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:59 WrapperNode [2022-11-21 13:58:59,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:58:59,803 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 13:58:59,804 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 13:58:59,804 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 13:58:59,812 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:58:59" (1/1) ... [2022-11-21 13:58:59,922 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:58:59" (1/1) ... [2022-11-21 13:59:00,020 INFO L138 Inliner]: procedures = 774, calls = 2445, calls flagged for inlining = 67, calls inlined = 11, statements flattened = 623 [2022-11-21 13:59:00,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 13:59:00,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 13:59:00,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 13:59:00,022 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 13:59:00,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:59" (1/1) ... [2022-11-21 13:59:00,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:59" (1/1) ... [2022-11-21 13:59:00,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:59" (1/1) ... [2022-11-21 13:59:00,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:59" (1/1) ... [2022-11-21 13:59:00,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:59" (1/1) ... [2022-11-21 13:59:00,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:59" (1/1) ... [2022-11-21 13:59:00,091 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:59" (1/1) ... [2022-11-21 13:59:00,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:59" (1/1) ... [2022-11-21 13:59:00,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 13:59:00,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 13:59:00,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 13:59:00,107 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 13:59:00,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:59" (1/1) ... [2022-11-21 13:59:00,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:59:00,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:00,148 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 13:59:00,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 13:59:00,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-11-21 13:59:00,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 13:59:00,221 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-11-21 13:59:00,221 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-11-21 13:59:00,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-21 13:59:00,222 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-21 13:59:00,222 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2022-11-21 13:59:00,222 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2022-11-21 13:59:00,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 13:59:00,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 13:59:00,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 13:59:00,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 13:59:00,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 13:59:00,223 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-21 13:59:00,224 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-21 13:59:00,224 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2022-11-21 13:59:00,224 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2022-11-21 13:59:00,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-21 13:59:00,224 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-21 13:59:00,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 13:59:00,225 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-11-21 13:59:00,225 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-11-21 13:59:00,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 13:59:00,225 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-21 13:59:00,225 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-21 13:59:00,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 13:59:00,226 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2022-11-21 13:59:00,226 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2022-11-21 13:59:00,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 13:59:00,226 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_iter_begin [2022-11-21 13:59:00,226 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_iter_begin [2022-11-21 13:59:00,227 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2022-11-21 13:59:00,227 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2022-11-21 13:59:00,227 INFO L130 BoogieDeclarations]: Found specification of procedure s_get_next_element [2022-11-21 13:59:00,227 INFO L138 BoogieDeclarations]: Found implementation of procedure s_get_next_element [2022-11-21 13:59:00,227 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-21 13:59:00,228 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-21 13:59:00,228 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_iter_is_valid [2022-11-21 13:59:00,228 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_iter_is_valid [2022-11-21 13:59:00,228 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2022-11-21 13:59:00,228 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2022-11-21 13:59:00,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-21 13:59:00,229 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2022-11-21 13:59:00,229 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2022-11-21 13:59:00,229 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-11-21 13:59:00,229 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-11-21 13:59:00,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 13:59:00,619 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 13:59:00,621 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 13:59:00,746 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !true; [2022-11-21 13:59:01,794 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 13:59:01,801 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 13:59:01,802 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-21 13:59:01,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:59:01 BoogieIcfgContainer [2022-11-21 13:59:01,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 13:59:01,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 13:59:01,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 13:59:01,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 13:59:01,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:58:56" (1/3) ... [2022-11-21 13:59:01,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@717b8ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:59:01, skipping insertion in model container [2022-11-21 13:59:01,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:58:59" (2/3) ... [2022-11-21 13:59:01,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@717b8ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:59:01, skipping insertion in model container [2022-11-21 13:59:01,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:59:01" (3/3) ... [2022-11-21 13:59:01,813 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_hash_iter_begin_harness-1.i [2022-11-21 13:59:01,840 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 13:59:01,840 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 13:59:01,909 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 13:59:01,920 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;@7a6a447, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 13:59:01,920 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 13:59:01,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 114 states have (on average 1.2456140350877194) internal successors, (142), 113 states have internal predecessors, (142), 40 states have call successors, (40), 17 states have call predecessors, (40), 17 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-11-21 13:59:01,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-11-21 13:59:01,947 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:01,948 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:01,949 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:59:01,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:01,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1612502020, now seen corresponding path program 1 times [2022-11-21 13:59:01,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:01,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121820001] [2022-11-21 13:59:01,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:01,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:02,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:02,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121820001] [2022-11-21 13:59:02,532 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-11-21 13:59:02,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818078253] [2022-11-21 13:59:02,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:02,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:02,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:02,536 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:59:02,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 13:59:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:03,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 2552 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-21 13:59:03,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:59:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2022-11-21 13:59:03,302 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:59:03,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818078253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:59:03,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:59:03,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:59:03,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929269583] [2022-11-21 13:59:03,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:59:03,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 13:59:03,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:03,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 13:59:03,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 13:59:03,343 INFO L87 Difference]: Start difference. First operand has 171 states, 114 states have (on average 1.2456140350877194) internal successors, (142), 113 states have internal predecessors, (142), 40 states have call successors, (40), 17 states have call predecessors, (40), 17 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-21 13:59:03,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:03,388 INFO L93 Difference]: Finished difference Result 333 states and 453 transitions. [2022-11-21 13:59:03,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 13:59:03,391 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 148 [2022-11-21 13:59:03,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:03,401 INFO L225 Difference]: With dead ends: 333 [2022-11-21 13:59:03,402 INFO L226 Difference]: Without dead ends: 164 [2022-11-21 13:59:03,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 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:59:03,410 INFO L413 NwaCegarLoop]: 215 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, 215 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:59:03,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:59:03,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-21 13:59:03,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-11-21 13:59:03,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 106 states have (on average 1.2264150943396226) internal successors, (130), 107 states have internal predecessors, (130), 40 states have call successors, (40), 17 states have call predecessors, (40), 17 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-11-21 13:59:03,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 209 transitions. [2022-11-21 13:59:03,466 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 209 transitions. Word has length 148 [2022-11-21 13:59:03,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:03,466 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 209 transitions. [2022-11-21 13:59:03,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-21 13:59:03,467 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 209 transitions. [2022-11-21 13:59:03,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-11-21 13:59:03,471 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:03,471 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:03,489 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-21 13:59:03,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-21 13:59:03,682 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:59:03,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:03,682 INFO L85 PathProgramCache]: Analyzing trace with hash 818348810, now seen corresponding path program 1 times [2022-11-21 13:59:03,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:03,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154520001] [2022-11-21 13:59:03,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:03,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:03,802 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:59:03,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1940471438] [2022-11-21 13:59:03,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:03,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:03,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:03,804 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:59:03,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 13:59:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:04,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 2580 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 13:59:04,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:59:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-11-21 13:59:05,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:59:05,398 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-11-21 13:59:05,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:05,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154520001] [2022-11-21 13:59:05,399 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:59:05,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940471438] [2022-11-21 13:59:05,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940471438] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-21 13:59:05,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 13:59:05,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 13 [2022-11-21 13:59:05,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003644469] [2022-11-21 13:59:05,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:59:05,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 13:59:05,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:05,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 13:59:05,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-11-21 13:59:05,406 INFO L87 Difference]: Start difference. First operand 164 states and 209 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 5 states have call successors, (24), 4 states have call predecessors, (24), 2 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21) [2022-11-21 13:59:05,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:05,906 INFO L93 Difference]: Finished difference Result 230 states and 298 transitions. [2022-11-21 13:59:05,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:59:05,907 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 5 states have call successors, (24), 4 states have call predecessors, (24), 2 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21) Word has length 154 [2022-11-21 13:59:05,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:05,911 INFO L225 Difference]: With dead ends: 230 [2022-11-21 13:59:05,911 INFO L226 Difference]: Without dead ends: 166 [2022-11-21 13:59:05,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 294 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:59:05,914 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 213 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:05,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 961 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 13:59:05,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-11-21 13:59:05,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-11-21 13:59:05,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 107 states have (on average 1.2242990654205608) internal successors, (131), 109 states have internal predecessors, (131), 40 states have call successors, (40), 17 states have call predecessors, (40), 18 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2022-11-21 13:59:05,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 211 transitions. [2022-11-21 13:59:05,936 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 211 transitions. Word has length 154 [2022-11-21 13:59:05,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:05,937 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 211 transitions. [2022-11-21 13:59:05,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 5 states have call successors, (24), 4 states have call predecessors, (24), 2 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21) [2022-11-21 13:59:05,938 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 211 transitions. [2022-11-21 13:59:05,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-11-21 13:59:05,940 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:05,940 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:05,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 13:59:06,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:06,151 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:59:06,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:06,152 INFO L85 PathProgramCache]: Analyzing trace with hash -226987588, now seen corresponding path program 1 times [2022-11-21 13:59:06,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:06,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368867859] [2022-11-21 13:59:06,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:06,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:06,250 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:59:06,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1929610090] [2022-11-21 13:59:06,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:06,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:06,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:06,252 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:59:06,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 13:59:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:06,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 2585 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 13:59:06,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:59:06,978 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-11-21 13:59:06,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:59:06,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:06,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368867859] [2022-11-21 13:59:06,979 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:59:06,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929610090] [2022-11-21 13:59:06,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929610090] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:59:06,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:59:06,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:59:06,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063239061] [2022-11-21 13:59:06,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:59:06,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:59:06,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:06,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:59:06,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:59:06,983 INFO L87 Difference]: Start difference. First operand 166 states and 211 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-21 13:59:07,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:07,031 INFO L93 Difference]: Finished difference Result 325 states and 414 transitions. [2022-11-21 13:59:07,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:59:07,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) Word has length 155 [2022-11-21 13:59:07,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:07,034 INFO L225 Difference]: With dead ends: 325 [2022-11-21 13:59:07,034 INFO L226 Difference]: Without dead ends: 171 [2022-11-21 13:59:07,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 151 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:59:07,036 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 2 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 819 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:59:07,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 819 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:59:07,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-11-21 13:59:07,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-11-21 13:59:07,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 111 states have (on average 1.2162162162162162) internal successors, (135), 113 states have internal predecessors, (135), 40 states have call successors, (40), 17 states have call predecessors, (40), 19 states have return successors, (41), 40 states have call predecessors, (41), 39 states have call successors, (41) [2022-11-21 13:59:07,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 216 transitions. [2022-11-21 13:59:07,076 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 216 transitions. Word has length 155 [2022-11-21 13:59:07,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:07,076 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 216 transitions. [2022-11-21 13:59:07,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-21 13:59:07,077 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 216 transitions. [2022-11-21 13:59:07,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-11-21 13:59:07,092 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:07,093 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:07,118 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-21 13:59:07,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-21 13:59:07,303 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:59:07,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:07,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1170775228, now seen corresponding path program 1 times [2022-11-21 13:59:07,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:07,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901648700] [2022-11-21 13:59:07,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:07,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:09,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:59:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:09,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 13:59:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:09,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 13:59:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:09,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 13:59:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:09,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 13:59:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:09,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:59:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:09,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:59:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:09,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:59:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:09,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 13:59:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:09,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 13:59:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:09,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:59:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:09,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 13:59:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:09,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-21 13:59:09,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:09,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-21 13:59:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:09,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:59:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:09,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:59:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:09,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:59:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:09,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-21 13:59:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:09,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-21 13:59:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:09,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-21 13:59:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:09,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-21 13:59:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:09,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-21 13:59:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:09,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-21 13:59:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:09,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-21 13:59:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:09,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-21 13:59:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:09,918 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2022-11-21 13:59:09,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:09,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901648700] [2022-11-21 13:59:09,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901648700] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:59:09,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530304254] [2022-11-21 13:59:09,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:09,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:09,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:09,921 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:59:09,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 13:59:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:10,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 2593 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-21 13:59:10,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:59:10,738 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:59:11,083 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-11-21 13:59:11,083 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:59:11,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530304254] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:59:11,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 13:59:11,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 22 [2022-11-21 13:59:11,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718953482] [2022-11-21 13:59:11,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:59:11,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 13:59:11,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:11,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 13:59:11,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2022-11-21 13:59:11,086 INFO L87 Difference]: Start difference. First operand 171 states and 216 transitions. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 9 states have internal predecessors, (87), 4 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2022-11-21 13:59:13,727 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:59:15,782 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:59:18,430 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:59:20,469 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:59:22,510 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:59:24,518 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:59:26,527 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:59:28,539 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:59:30,639 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:59:32,664 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:59:34,710 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:59:34,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:34,770 INFO L93 Difference]: Finished difference Result 390 states and 488 transitions. [2022-11-21 13:59:34,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-21 13:59:34,771 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 9 states have internal predecessors, (87), 4 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 167 [2022-11-21 13:59:34,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:34,774 INFO L225 Difference]: With dead ends: 390 [2022-11-21 13:59:34,774 INFO L226 Difference]: Without dead ends: 243 [2022-11-21 13:59:34,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 205 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:59:34,777 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 141 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 32 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:34,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1329 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 361 Invalid, 11 Unknown, 0 Unchecked, 23.4s Time] [2022-11-21 13:59:34,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-21 13:59:34,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 237. [2022-11-21 13:59:34,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 155 states have (on average 1.2) internal successors, (186), 159 states have internal predecessors, (186), 52 states have call successors, (52), 26 states have call predecessors, (52), 29 states have return successors, (57), 51 states have call predecessors, (57), 51 states have call successors, (57) [2022-11-21 13:59:34,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 295 transitions. [2022-11-21 13:59:34,847 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 295 transitions. Word has length 167 [2022-11-21 13:59:34,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:34,849 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 295 transitions. [2022-11-21 13:59:34,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 9 states have internal predecessors, (87), 4 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2022-11-21 13:59:34,850 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 295 transitions. [2022-11-21 13:59:34,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-11-21 13:59:34,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:34,859 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:34,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 13:59:35,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:35,069 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:59:35,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:35,069 INFO L85 PathProgramCache]: Analyzing trace with hash -695933446, now seen corresponding path program 1 times [2022-11-21 13:59:35,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:35,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271969611] [2022-11-21 13:59:35,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:35,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:35,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:59:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:35,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 13:59:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:35,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 13:59:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:35,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 13:59:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:35,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 13:59:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:35,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:59:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:35,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:59:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:35,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:59:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:35,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 13:59:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:35,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 13:59:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:35,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:59:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:35,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 13:59:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:35,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-21 13:59:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:35,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-21 13:59:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:35,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:59:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:35,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:59:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:35,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:59:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:35,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-21 13:59:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:36,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-21 13:59:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:36,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-21 13:59:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:36,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-21 13:59:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:36,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-21 13:59:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:36,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-21 13:59:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:36,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-21 13:59:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:36,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-21 13:59:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:36,100 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2022-11-21 13:59:36,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:36,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271969611] [2022-11-21 13:59:36,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271969611] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:59:36,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889527002] [2022-11-21 13:59:36,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:36,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:36,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:36,109 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:59:36,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 13:59:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:36,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 2588 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 13:59:36,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:59:36,888 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-11-21 13:59:36,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:59:36,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889527002] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:59:36,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 13:59:36,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2022-11-21 13:59:36,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7125165] [2022-11-21 13:59:36,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:59:36,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:59:36,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:36,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:59:36,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-21 13:59:36,893 INFO L87 Difference]: Start difference. First operand 237 states and 295 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2022-11-21 13:59:37,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:37,149 INFO L93 Difference]: Finished difference Result 453 states and 566 transitions. [2022-11-21 13:59:37,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:59:37,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 167 [2022-11-21 13:59:37,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:37,154 INFO L225 Difference]: With dead ends: 453 [2022-11-21 13:59:37,154 INFO L226 Difference]: Without dead ends: 249 [2022-11-21 13:59:37,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 209 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:59:37,159 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 213 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:37,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 694 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:59:37,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-11-21 13:59:37,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2022-11-21 13:59:37,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 161 states have (on average 1.1987577639751552) internal successors, (193), 166 states have internal predecessors, (193), 54 states have call successors, (54), 26 states have call predecessors, (54), 30 states have return successors, (62), 53 states have call predecessors, (62), 53 states have call successors, (62) [2022-11-21 13:59:37,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 309 transitions. [2022-11-21 13:59:37,203 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 309 transitions. Word has length 167 [2022-11-21 13:59:37,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:37,205 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 309 transitions. [2022-11-21 13:59:37,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2022-11-21 13:59:37,206 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 309 transitions. [2022-11-21 13:59:37,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-11-21 13:59:37,211 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:37,212 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:37,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 13:59:37,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:37,422 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 13:59:37,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:37,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1022744148, now seen corresponding path program 1 times [2022-11-21 13:59:37,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:37,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688393152] [2022-11-21 13:59:37,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:37,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:38,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:59:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:38,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 13:59:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:38,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 13:59:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:38,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 13:59:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:38,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 13:59:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:38,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:59:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:38,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:59:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:38,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:59:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:38,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 13:59:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:38,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 13:59:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:38,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:59:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:38,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 13:59:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:38,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 13:59:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:38,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-21 13:59:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:38,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 13:59:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:38,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:59:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:38,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:59:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:38,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:59:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:38,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-21 13:59:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:38,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-21 13:59:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:38,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-21 13:59:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:38,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-21 13:59:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:38,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-21 13:59:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:38,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-21 13:59:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:38,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-21 13:59:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:38,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-11-21 13:59:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:38,756 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2022-11-21 13:59:38,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:38,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688393152] [2022-11-21 13:59:38,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688393152] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:59:38,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882115594] [2022-11-21 13:59:38,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:38,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:38,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:38,758 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:59:38,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 13:59:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:39,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 2617 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-21 13:59:39,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:59:41,647 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:59:49,717 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:59:57,811 WARN L233 SmtUtils]: Spent 6.03s 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:59:57,845 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-11-21 13:59:57,845 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:59:57,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882115594] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:59:57,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 13:59:57,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2022-11-21 13:59:57,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679957658] [2022-11-21 13:59:57,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:59:57,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 13:59:57,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:57,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 13:59:57,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=202, Unknown=3, NotChecked=28, Total=272 [2022-11-21 13:59:57,848 INFO L87 Difference]: Start difference. First operand 246 states and 309 transitions. Second operand has 8 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 3 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2022-11-21 13:59:59,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:00:02,147 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 14:00:08,189 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 14:00:08,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:00:08,762 INFO L93 Difference]: Finished difference Result 477 states and 607 transitions. [2022-11-21 14:00:08,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 14:00:08,763 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 3 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) Word has length 173 [2022-11-21 14:00:08,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:00:08,794 INFO L225 Difference]: With dead ends: 477 [2022-11-21 14:00:08,794 INFO L226 Difference]: Without dead ends: 260 [2022-11-21 14:00:08,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 216 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 14:00:08,796 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 12 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-21 14:00:08,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1093 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 1 Unknown, 221 Unchecked, 4.7s Time] [2022-11-21 14:00:08,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-11-21 14:00:08,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2022-11-21 14:00:08,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 169 states have (on average 1.1893491124260356) internal successors, (201), 174 states have internal predecessors, (201), 56 states have call successors, (56), 28 states have call predecessors, (56), 32 states have return successors, (64), 55 states have call predecessors, (64), 55 states have call successors, (64) [2022-11-21 14:00:08,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 321 transitions. [2022-11-21 14:00:08,826 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 321 transitions. Word has length 173 [2022-11-21 14:00:08,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:00:08,828 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 321 transitions. [2022-11-21 14:00:08,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 3 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2022-11-21 14:00:08,829 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 321 transitions. [2022-11-21 14:00:08,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-11-21 14:00:08,833 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:00:08,833 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:00:08,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 14:00:09,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-21 14:00:09,044 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:00:09,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:00:09,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1694283435, now seen corresponding path program 1 times [2022-11-21 14:00:09,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:00:09,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41454298] [2022-11-21 14:00:09,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:00:09,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:00:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:11,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 14:00:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:11,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 14:00:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:11,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 14:00:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:11,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:00:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:11,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 14:00:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:11,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:00:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:11,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:00:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:11,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 14:00:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:11,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 14:00:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:11,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 14:00:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:11,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:00:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:11,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 14:00:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:11,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 14:00:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:12,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 14:00:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:12,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-21 14:00:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:12,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 14:00:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:12,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:00:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:12,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:00:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:12,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 14:00:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:12,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 14:00:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:12,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:00:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:12,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-21 14:00:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:12,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-21 14:00:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:12,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-21 14:00:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:12,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-21 14:00:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:12,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-21 14:00:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:12,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-21 14:00:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:12,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-21 14:00:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:12,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-11-21 14:00:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:12,336 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-11-21 14:00:12,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:00:12,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41454298] [2022-11-21 14:00:12,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41454298] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:00:12,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089899431] [2022-11-21 14:00:12,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:00:12,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:00:12,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:00:12,341 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:00:12,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 14:00:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:13,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 2756 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 14:00:13,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:00:13,214 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-11-21 14:00:13,214 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 14:00:13,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089899431] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:00:13,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 14:00:13,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [19] total 24 [2022-11-21 14:00:13,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647022162] [2022-11-21 14:00:13,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:00:13,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 14:00:13,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:00:13,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 14:00:13,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=502, Unknown=0, NotChecked=0, Total=552 [2022-11-21 14:00:13,216 INFO L87 Difference]: Start difference. First operand 258 states and 321 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (28), 4 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-21 14:00:13,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:00:13,298 INFO L93 Difference]: Finished difference Result 490 states and 611 transitions. [2022-11-21 14:00:13,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 14:00:13,299 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (28), 4 states have call predecessors, (28), 2 states have call successors, (28) Word has length 190 [2022-11-21 14:00:13,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:00:13,301 INFO L225 Difference]: With dead ends: 490 [2022-11-21 14:00:13,302 INFO L226 Difference]: Without dead ends: 244 [2022-11-21 14:00:13,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2022-11-21 14:00:13,304 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 2 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 14:00:13,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1238 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 14:00:13,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-11-21 14:00:13,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2022-11-21 14:00:13,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 160 states have (on average 1.18125) internal successors, (189), 165 states have internal predecessors, (189), 53 states have call successors, (53), 26 states have call predecessors, (53), 30 states have return successors, (60), 52 states have call predecessors, (60), 52 states have call successors, (60) [2022-11-21 14:00:13,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 302 transitions. [2022-11-21 14:00:13,336 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 302 transitions. Word has length 190 [2022-11-21 14:00:13,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:00:13,337 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 302 transitions. [2022-11-21 14:00:13,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (28), 4 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-21 14:00:13,337 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 302 transitions. [2022-11-21 14:00:13,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-21 14:00:13,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:00:13,341 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:00:13,362 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 14:00:13,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-21 14:00:13,563 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:00:13,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:00:13,564 INFO L85 PathProgramCache]: Analyzing trace with hash -183837512, now seen corresponding path program 1 times [2022-11-21 14:00:13,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:00:13,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850493450] [2022-11-21 14:00:13,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:00:13,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:00:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:15,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 14:00:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:15,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 14:00:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:15,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 14:00:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:15,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:00:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:15,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 14:00:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:15,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:00:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:15,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:00:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:15,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 14:00:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:15,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 14:00:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:15,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 14:00:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:15,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:00:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:15,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 14:00:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:15,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 14:00:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:15,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 14:00:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:15,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-21 14:00:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:15,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 14:00:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:15,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:00:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:15,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:00:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:15,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 14:00:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:15,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-21 14:00:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:15,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-21 14:00:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:16,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-21 14:00:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:16,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-21 14:00:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:16,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-21 14:00:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:16,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-21 14:00:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:16,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-21 14:00:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:16,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-21 14:00:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:16,244 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-11-21 14:00:16,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:00:16,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850493450] [2022-11-21 14:00:16,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850493450] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:00:16,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500111696] [2022-11-21 14:00:16,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:00:16,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:00:16,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:00:16,247 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:00:16,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 14:00:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:16,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 2647 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-21 14:00:16,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:00:17,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:00:17,190 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 14:00:17,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:00:17,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:00:17,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:00:17,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:00:17,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-11-21 14:00:18,206 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-11-21 14:00:18,207 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 14:00:18,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500111696] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:00:18,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 14:00:18,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [17] total 30 [2022-11-21 14:00:18,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502263418] [2022-11-21 14:00:18,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:00:18,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-21 14:00:18,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:00:18,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-21 14:00:18,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=796, Unknown=0, NotChecked=0, Total=870 [2022-11-21 14:00:18,210 INFO L87 Difference]: Start difference. First operand 244 states and 302 transitions. Second operand has 15 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 8 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2022-11-21 14:00:20,378 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 14:00:22,457 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 14:00:24,475 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 14:00:26,493 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 14:00:28,508 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 14:00:30,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 14:00:32,528 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 14:00:34,578 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 14:00:36,609 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 14:00:38,678 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 14:00:40,732 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 14:00:42,748 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 14:00:44,869 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 14:00:46,884 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 14:00:48,935 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 14:00:50,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:00:50,923 INFO L93 Difference]: Finished difference Result 360 states and 446 transitions. [2022-11-21 14:00:50,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-21 14:00:50,925 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 8 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) Word has length 178 [2022-11-21 14:00:50,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:00:50,927 INFO L225 Difference]: With dead ends: 360 [2022-11-21 14:00:50,927 INFO L226 Difference]: Without dead ends: 281 [2022-11-21 14:00:50,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 211 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=175, Invalid=1717, Unknown=0, NotChecked=0, Total=1892 [2022-11-21 14:00:50,930 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 298 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 111 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.1s IncrementalHoareTripleChecker+Time [2022-11-21 14:00:50,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1096 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 689 Invalid, 15 Unknown, 0 Unchecked, 32.1s Time] [2022-11-21 14:00:50,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-21 14:00:50,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 275. [2022-11-21 14:00:50,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 182 states have (on average 1.1813186813186813) internal successors, (215), 188 states have internal predecessors, (215), 57 states have call successors, (57), 31 states have call predecessors, (57), 35 states have return successors, (63), 55 states have call predecessors, (63), 56 states have call successors, (63) [2022-11-21 14:00:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 335 transitions. [2022-11-21 14:00:50,961 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 335 transitions. Word has length 178 [2022-11-21 14:00:50,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:00:50,962 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 335 transitions. [2022-11-21 14:00:50,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 8 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2022-11-21 14:00:50,962 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 335 transitions. [2022-11-21 14:00:50,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-11-21 14:00:50,966 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:00:50,966 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:00:50,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 14:00:51,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:00:51,180 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:00:51,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:00:51,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1882972669, now seen corresponding path program 1 times [2022-11-21 14:00:51,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:00:51,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246499478] [2022-11-21 14:00:51,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:00:51,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:00:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:53,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 14:00:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:53,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 14:00:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:53,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 14:00:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:53,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:00:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:53,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 14:00:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:53,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:00:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:53,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:00:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:53,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 14:00:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:53,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 14:00:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:53,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 14:00:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:53,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:00:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:53,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 14:00:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:53,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 14:00:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:53,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 14:00:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:53,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-21 14:00:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:53,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 14:00:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:53,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:00:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:53,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:00:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:53,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 14:00:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:54,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-21 14:00:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:54,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-21 14:00:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:54,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-21 14:00:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:54,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-21 14:00:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:54,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-21 14:00:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:54,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-21 14:00:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:54,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-21 14:00:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:54,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-21 14:00:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:54,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:00:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:54,355 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-11-21 14:00:54,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:00:54,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246499478] [2022-11-21 14:00:54,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246499478] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:00:54,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829638828] [2022-11-21 14:00:54,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:00:54,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:00:54,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:00:54,358 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:00:54,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 14:00:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:00:55,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 2674 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-21 14:00:55,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:00:55,447 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-11-21 14:00:55,447 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 14:00:55,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829638828] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:00:55,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 14:00:55,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 22 [2022-11-21 14:00:55,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897354427] [2022-11-21 14:00:55,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:00:55,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 14:00:55,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:00:55,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 14:00:55,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2022-11-21 14:00:55,450 INFO L87 Difference]: Start difference. First operand 275 states and 335 transitions. Second operand has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2022-11-21 14:00:55,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:00:55,655 INFO L93 Difference]: Finished difference Result 393 states and 489 transitions. [2022-11-21 14:00:55,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 14:00:55,657 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 187 [2022-11-21 14:00:55,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:00:55,660 INFO L225 Difference]: With dead ends: 393 [2022-11-21 14:00:55,660 INFO L226 Difference]: Without dead ends: 281 [2022-11-21 14:00:55,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2022-11-21 14:00:55,662 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 2 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 14:00:55,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1146 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 14:00:55,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-21 14:00:55,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 275. [2022-11-21 14:00:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 182 states have (on average 1.1593406593406594) internal successors, (211), 188 states have internal predecessors, (211), 57 states have call successors, (57), 31 states have call predecessors, (57), 35 states have return successors, (63), 55 states have call predecessors, (63), 56 states have call successors, (63) [2022-11-21 14:00:55,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 331 transitions. [2022-11-21 14:00:55,694 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 331 transitions. Word has length 187 [2022-11-21 14:00:55,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:00:55,695 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 331 transitions. [2022-11-21 14:00:55,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2022-11-21 14:00:55,696 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 331 transitions. [2022-11-21 14:00:55,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-11-21 14:00:55,700 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:00:55,700 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:00:55,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-21 14:00:55,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-21 14:00:55,921 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:00:55,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:00:55,921 INFO L85 PathProgramCache]: Analyzing trace with hash 476694279, now seen corresponding path program 2 times [2022-11-21 14:00:55,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:00:55,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366884896] [2022-11-21 14:00:55,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:00:55,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:00:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:00,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 14:01:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:00,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 14:01:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:00,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 14:01:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:00,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:01:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:00,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 14:01:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:00,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:01:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:00,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:01:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:00,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 14:01:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:00,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 14:01:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:00,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 14:01:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:00,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:01:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:00,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 14:01:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:01,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 14:01:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:01,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 14:01:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:01,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-21 14:01:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:01,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 14:01:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:01,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:01:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:01,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:01:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:01,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 14:01:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:01,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-21 14:01:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:01,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-21 14:01:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:01,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 14:01:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:01,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 14:01:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:01,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-21 14:01:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:01,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-21 14:01:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:01,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-21 14:01:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:01,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-11-21 14:01:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:01,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-21 14:01:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:01,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-11-21 14:01:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:01,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:01:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:01,837 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-11-21 14:01:01,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:01,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366884896] [2022-11-21 14:01:01,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366884896] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:01:01,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038981491] [2022-11-21 14:01:01,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 14:01:01,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:01:01,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:01:01,840 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:01:01,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-21 14:01:03,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 14:01:03,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 14:01:03,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 2728 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-21 14:01:03,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:03,358 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-11-21 14:01:03,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 14:01:03,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038981491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:01:03,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 14:01:03,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [25] total 30 [2022-11-21 14:01:03,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580590852] [2022-11-21 14:01:03,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:01:03,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 14:01:03,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:03,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 14:01:03,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=803, Unknown=0, NotChecked=0, Total=870 [2022-11-21 14:01:03,361 INFO L87 Difference]: Start difference. First operand 275 states and 331 transitions. Second operand has 7 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2022-11-21 14:01:03,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:03,555 INFO L93 Difference]: Finished difference Result 367 states and 454 transitions. [2022-11-21 14:01:03,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 14:01:03,556 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 198 [2022-11-21 14:01:03,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:01:03,558 INFO L225 Difference]: With dead ends: 367 [2022-11-21 14:01:03,558 INFO L226 Difference]: Without dead ends: 281 [2022-11-21 14:01:03,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=859, Unknown=0, NotChecked=0, Total=930 [2022-11-21 14:01:03,561 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 2 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 14:01:03,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1156 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 14:01:03,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-21 14:01:03,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2022-11-21 14:01:03,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 186 states have (on average 1.1559139784946237) internal successors, (215), 194 states have internal predecessors, (215), 57 states have call successors, (57), 31 states have call predecessors, (57), 37 states have return successors, (66), 55 states have call predecessors, (66), 56 states have call successors, (66) [2022-11-21 14:01:03,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 338 transitions. [2022-11-21 14:01:03,594 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 338 transitions. Word has length 198 [2022-11-21 14:01:03,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:01:03,595 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 338 transitions. [2022-11-21 14:01:03,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2022-11-21 14:01:03,595 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 338 transitions. [2022-11-21 14:01:03,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-11-21 14:01:03,599 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:01:03,599 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:01:03,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-21 14:01:03,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-21 14:01:03,815 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:01:03,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:03,815 INFO L85 PathProgramCache]: Analyzing trace with hash -3643047, now seen corresponding path program 1 times [2022-11-21 14:01:03,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:03,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820740757] [2022-11-21 14:01:03,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:03,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 14:01:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 14:01:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 14:01:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:01:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 14:01:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:01:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:01:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 14:01:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 14:01:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 14:01:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:01:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 14:01:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 14:01:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 14:01:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-21 14:01:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 14:01:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:01:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:01:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 14:01:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-21 14:01:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-21 14:01:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 14:01:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 14:01:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-21 14:01:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-21 14:01:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-21 14:01:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-11-21 14:01:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 14:01:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-21 14:01:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-11-21 14:01:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:01:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:04,690 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2022-11-21 14:01:04,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:04,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820740757] [2022-11-21 14:01:04,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820740757] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:01:04,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485728593] [2022-11-21 14:01:04,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:04,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:01:04,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:01:04,694 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:01:04,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-21 14:01:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:05,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 2747 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 14:01:05,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:05,644 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2022-11-21 14:01:05,644 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 14:01:05,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485728593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 14:01:05,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 14:01:05,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 8 [2022-11-21 14:01:05,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717189178] [2022-11-21 14:01:05,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 14:01:05,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 14:01:05,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:01:05,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 14:01:05,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-21 14:01:05,649 INFO L87 Difference]: Start difference. First operand 281 states and 338 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-21 14:01:05,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 14:01:05,710 INFO L93 Difference]: Finished difference Result 400 states and 490 transitions. [2022-11-21 14:01:05,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 14:01:05,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 204 [2022-11-21 14:01:05,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 14:01:05,715 INFO L225 Difference]: With dead ends: 400 [2022-11-21 14:01:05,716 INFO L226 Difference]: Without dead ends: 248 [2022-11-21 14:01:05,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-21 14:01:05,718 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 2 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 14:01:05,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 614 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 14:01:05,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-11-21 14:01:05,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2022-11-21 14:01:05,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 164 states have (on average 1.1402439024390243) internal successors, (187), 169 states have internal predecessors, (187), 51 states have call successors, (51), 28 states have call predecessors, (51), 32 states have return successors, (57), 50 states have call predecessors, (57), 50 states have call successors, (57) [2022-11-21 14:01:05,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 295 transitions. [2022-11-21 14:01:05,745 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 295 transitions. Word has length 204 [2022-11-21 14:01:05,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 14:01:05,746 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 295 transitions. [2022-11-21 14:01:05,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-21 14:01:05,747 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 295 transitions. [2022-11-21 14:01:05,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-11-21 14:01:05,750 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 14:01:05,751 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:01:05,771 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-21 14:01:05,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:01:05,965 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 14:01:05,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:05,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1734404003, now seen corresponding path program 3 times [2022-11-21 14:01:05,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:05,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41622838] [2022-11-21 14:01:05,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:05,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:11,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 14:01:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:11,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-21 14:01:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:11,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 14:01:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:11,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-21 14:01:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:11,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-21 14:01:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:11,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:01:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:11,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:01:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:11,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 14:01:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:11,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 14:01:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:11,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 14:01:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:11,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:01:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:11,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-21 14:01:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:12,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 14:01:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:12,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 14:01:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:12,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-21 14:01:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:12,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 14:01:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:12,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:01:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:12,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 14:01:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:12,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 14:01:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:12,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-21 14:01:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:12,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-21 14:01:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:12,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 14:01:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:12,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 14:01:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:12,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-21 14:01:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:12,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-21 14:01:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:12,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-21 14:01:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:12,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-11-21 14:01:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:12,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 14:01:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:12,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 14:01:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:12,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-21 14:01:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:12,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-21 14:01:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:13,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 14:01:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:13,399 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 24 proven. 22 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2022-11-21 14:01:13,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:13,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41622838] [2022-11-21 14:01:13,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41622838] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:01:13,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096462535] [2022-11-21 14:01:13,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 14:01:13,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:01:13,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:01:13,403 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:01:13,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3d7b42b9-92e1-481a-897f-69be1779168e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-21 14:01:15,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-21 14:01:15,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 14:01:15,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 2058 conjuncts, 145 conjunts are in the unsatisfiable core [2022-11-21 14:01:15,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:15,934 INFO L321 Elim1Store]: treesize reduction 80, result has 17.5 percent of original size [2022-11-21 14:01:15,934 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 14:01:15,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:16,007 INFO L321 Elim1Store]: treesize reduction 44, result has 35.3 percent of original size [2022-11-21 14:01:16,008 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 14:01:16,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:16,094 INFO L321 Elim1Store]: treesize reduction 64, result has 36.0 percent of original size [2022-11-21 14:01:16,095 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 14:01:16,156 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-21 14:01:16,157 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 14:01:16,202 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 14:01:16,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 52 [2022-11-21 14:01:16,280 INFO L321 Elim1Store]: treesize reduction 23, result has 39.5 percent of original size [2022-11-21 14:01:16,280 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 1 case distinctions, treesize of input 36 treesize of output 31 [2022-11-21 14:01:19,341 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_13 Int)) (and (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_13) (= (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_13) 0) v_s_get_next_element_~iter.base_BEFORE_CALL_13) (= (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_13) 0) 32))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_13 Int)) (and (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_13) (= (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_13) 0) 0) (= (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_13) 0) v_s_get_next_element_~iter.base_BEFORE_CALL_13))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_13 Int)) (and (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_13) (= (select (select |c_#memory_int| v_s_get_next_element_~iter.base_BEFORE_CALL_13) 32) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_13) 0)) (.cse1 (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_13) 0))) (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (+ 40 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1)))))))) is different from true [2022-11-21 14:02:15,085 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 14:02:23,628 WARN L233 SmtUtils]: Spent 6.25s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:02:31,073 WARN L233 SmtUtils]: Spent 7.12s 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 14:02:41,423 WARN L233 SmtUtils]: Spent 10.08s 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 14:02:50,332 WARN L233 SmtUtils]: Spent 8.66s 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 14:04:07,459 WARN L233 SmtUtils]: Spent 18.19s 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 14:04:23,863 WARN L233 SmtUtils]: Spent 16.07s 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 14:04:42,337 WARN L233 SmtUtils]: Spent 18.09s 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 14:05:16,476 WARN L233 SmtUtils]: Spent 33.04s 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 14:05:35,338 WARN L233 SmtUtils]: Spent 18.19s 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 14:05:37,433 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_aws_hash_table_is_valid_#in~map.base|) |c_aws_hash_table_is_valid_#in~map.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_aws_hash_table_is_valid_#in~map.base|) |c_aws_hash_table_is_valid_#in~map.offset|))) (and (or (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_14 Int)) (and (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_14) (= (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_14) 0) 32) (= (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_14) 0) v_s_get_next_element_~iter.base_BEFORE_CALL_14))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_14 Int)) (and (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_14) (= (select (select |c_#memory_int| v_s_get_next_element_~iter.base_BEFORE_CALL_14) 32) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_14) 0)) (.cse1 (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_14) 0))) (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (+ (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) 40)))))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_14 Int)) (and (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_14) (= (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_14) 0) 0) (= (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_14) 0) v_s_get_next_element_~iter.base_BEFORE_CALL_14)))) (or (let ((.cse2 (select |c_#memory_int| .cse4))) (< (mod (select .cse2 (+ 56 .cse3)) 18446744073709551616) (mod (select .cse2 (+ 40 .cse3)) 18446744073709551616))) (not |c_aws_hash_table_is_valid_#t~short1280|)) (or (not (= 0 .cse3)) (not (= .cse4 0))))) is different from true [2022-11-21 14:05:58,725 WARN L233 SmtUtils]: Spent 18.50s 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 14:06:01,466 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_15 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_15) 0)) (.cse1 (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_15) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) (and (= (select (select |c_#memory_int| v_s_get_next_element_~iter.base_BEFORE_CALL_15) 32) (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (+ 40 .cse2))) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_15) (not (= 0 .cse2)))))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_15 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_15) 0)) (.cse5 (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_15) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse4) .cse5))) (and (not (= .cse3 0)) (= (select (select |c_#memory_int| v_s_get_next_element_~iter.base_BEFORE_CALL_15) 32) (select (select |c_#memory_int| .cse3) (+ 40 (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5)))) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_15))))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_15 Int)) (and (= (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_15) 0) 0) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_15) (= (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_15) 0) v_s_get_next_element_~iter.base_BEFORE_CALL_15))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_15 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_15) 0)) (.cse7 (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_15) 0))) (and (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_15) (= .cse6 v_s_get_next_element_~iter.base_BEFORE_CALL_15) (= 32 .cse7) (not (= 0 (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7)))))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_15 Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_15) 0)) (.cse9 (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_15) 0))) (and (not (= (select (select |c_#memory_$Pointer$.base| .cse8) .cse9) 0)) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_15) (= .cse8 v_s_get_next_element_~iter.base_BEFORE_CALL_15) (= 32 .cse9))))) is different from true [2022-11-21 14:06:19,906 WARN L233 SmtUtils]: Spent 18.09s 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 14:06:22,003 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_15 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_15) 0)) (.cse1 (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_15) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) (and (= (select (select |c_#memory_int| v_s_get_next_element_~iter.base_BEFORE_CALL_15) 32) (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (+ 40 .cse2))) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_15) (not (= 0 .cse2)))))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_15 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_15) 0)) (.cse5 (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_15) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse4) .cse5))) (and (not (= .cse3 0)) (= (select (select |c_#memory_int| v_s_get_next_element_~iter.base_BEFORE_CALL_15) 32) (select (select |c_#memory_int| .cse3) (+ 40 (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5)))) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_15))))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_15 Int)) (and (= (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_15) 0) 0) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_15) (= (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_15) 0) v_s_get_next_element_~iter.base_BEFORE_CALL_15))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_15 Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_15) 0)) (.cse7 (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_15) 0))) (and (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_15) (= .cse6 v_s_get_next_element_~iter.base_BEFORE_CALL_15) (= 32 .cse7) (not (= 0 (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7)))))) (exists ((v_s_get_next_element_~iter.base_BEFORE_CALL_15 Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| v_s_get_next_element_~iter.base_BEFORE_CALL_15) 0)) (.cse9 (select (select |c_#memory_$Pointer$.offset| v_s_get_next_element_~iter.base_BEFORE_CALL_15) 0))) (and (not (= (select (select |c_#memory_$Pointer$.base| .cse8) .cse9) 0)) (<= 2 v_s_get_next_element_~iter.base_BEFORE_CALL_15) (= .cse8 v_s_get_next_element_~iter.base_BEFORE_CALL_15) (= 32 .cse9))))) (not (= (mod |c_assume_abort_if_not_#in~cond| 256) 0))) is different from true [2022-11-21 14:06:23,738 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 14:06:23,747 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 14:06:23,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:23,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 14:06:23,784 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:06:23,785 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 14:06:29,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:29,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:29,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:29,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:29,925 INFO L321 Elim1Store]: treesize reduction 252, result has 4.2 percent of original size [2022-11-21 14:06:29,925 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 14:06:29,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:29,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:29,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:29,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:06:29,987 INFO L321 Elim1Store]: treesize reduction 252, result has 4.2 percent of original size [2022-11-21 14:06:29,987 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 14:06:34,819 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 2 proven. 62 refuted. 0 times theorem prover too weak. 129 trivial. 56 not checked. [2022-11-21 14:06:34,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:07:05,901 WARN L233 SmtUtils]: Spent 10.06s 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 14:07:19,784 WARN L233 SmtUtils]: Spent 10.06s 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 14:07:41,276 WARN L233 SmtUtils]: Spent 10.06s 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 14:07:55,594 WARN L233 SmtUtils]: Spent 10.04s 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 14:08:13,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096462535] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:08:13,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 14:08:13,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 38] total 67 [2022-11-21 14:08:13,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513656008] [2022-11-21 14:08:13,923 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 14:08:13,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-21 14:08:13,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:08:13,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-21 14:08:13,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=5308, Unknown=81, NotChecked=604, Total=6320 [2022-11-21 14:08:13,928 INFO L87 Difference]: Start difference. First operand 248 states and 295 transitions. Second operand has 67 states, 57 states have (on average 3.2280701754385963) internal successors, (184), 52 states have internal predecessors, (184), 25 states have call successors, (61), 16 states have call predecessors, (61), 15 states have return successors, (56), 20 states have call predecessors, (56), 22 states have call successors, (56) [2022-11-21 14:08:16,520 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 14:08:18,769 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 14:08:20,874 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 14:08:27,961 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 14:08:30,441 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 14:08:34,108 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 14:08:36,185 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 14:08:38,592 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 14:08:40,665 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 14:08:43,311 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 14:08:49,542 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 14:08:52,188 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 14:08:54,289 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 14:08:56,690 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 14:08:59,191 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 14:09:01,662 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 14:09:03,845 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 14:09:05,853 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 14:09:07,861 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 14:09:09,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:09:11,773 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 14:09:13,965 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 14:09:15,978 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 14:09:17,989 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 14:09:20,110 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 14:09:22,378 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 14:09:25,343 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 14:09:31,196 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 14:09:37,412 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 14:09:39,478 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 14:09:44,543 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 14:09:46,904 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 14:09:50,562 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 14:09:53,098 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 14:09:59,649 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 14:10:02,011 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 14:10:03,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:10:05,559 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 14:10:07,632 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 14:10:09,720 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 14:10:12,151 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 14:10:14,160 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 14:10:16,173 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 14:10:18,273 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 14:10:20,280 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 14:10:22,361 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 14:10:24,522 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 14:10:28,413 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 14:10:30,698 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 14:10:33,019 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 14:10:35,430 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 14:10:38,429 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 14:10:43,014 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 14:10:49,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:10:52,530 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 14:10:56,691 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 14:10:58,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 14:11:02,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:11:04,728 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 14:11:09,927 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 14:11:32,231 WARN L233 SmtUtils]: Spent 20.10s on a formula simplification. DAG size of input: 80 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:11:34,666 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 14:11:36,762 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 14:11:38,847 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 14:11:40,957 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 14:11:43,158 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 14:11:47,536 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 14:11:50,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 14:11:52,976 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 14:12:05,174 WARN L233 SmtUtils]: Spent 10.06s 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 14:12:07,266 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 14:12:15,615 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 14:12:17,666 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 14:12:19,784 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 14:12:26,191 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 14:12:28,287 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 14:12:38,746 WARN L233 SmtUtils]: Spent 8.28s 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 14:12:59,241 WARN L233 SmtUtils]: Spent 20.22s 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 14:13:01,255 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 14:13:03,333 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 14:13:06,130 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 14:13:18,399 WARN L233 SmtUtils]: Spent 10.07s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)