./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc --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 d8feb785efb60d35f9204dc33a12e80ea59efcec5de2b7c2ff320ef29197b0bd --- 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-5e519f3 [2022-11-02 20:50:36,666 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:50:36,668 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:50:36,712 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:50:36,713 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:50:36,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:50:36,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:50:36,723 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:50:36,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:50:36,734 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:50:36,735 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:50:36,738 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:50:36,738 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:50:36,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:50:36,743 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:50:36,745 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:50:36,747 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:50:36,748 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:50:36,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:50:36,759 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:50:36,760 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:50:36,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:50:36,765 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:50:36,766 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:50:36,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:50:36,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:50:36,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:50:36,779 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:50:36,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:50:36,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:50:36,781 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:50:36,783 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:50:36,785 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:50:36,787 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:50:36,788 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:50:36,788 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:50:36,789 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:50:36,790 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:50:36,790 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:50:36,791 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:50:36,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:50:36,794 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 20:50:36,839 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:50:36,840 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:50:36,840 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:50:36,841 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:50:36,842 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:50:36,842 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:50:36,843 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:50:36,843 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:50:36,843 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:50:36,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:50:36,845 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:50:36,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:50:36,846 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:50:36,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:50:36,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:50:36,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:50:36,846 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:50:36,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:50:36,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:50:36,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:50:36,848 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:50:36,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:50:36,848 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:50:36,848 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:50:36,849 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:50:36,849 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:50:36,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:50:36,851 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:50:36,851 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:50:36,851 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:50:36,852 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_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/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_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc 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 -> d8feb785efb60d35f9204dc33a12e80ea59efcec5de2b7c2ff320ef29197b0bd [2022-11-02 20:50:37,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:50:37,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:50:37,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:50:37,189 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:50:37,190 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:50:37,192 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i [2022-11-02 20:50:37,289 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/data/c5a3b9f69/9f595812ae8b406384afe5d5163c5f08/FLAGe587c105e [2022-11-02 20:50:38,124 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:50:38,125 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i [2022-11-02 20:50:38,161 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/data/c5a3b9f69/9f595812ae8b406384afe5d5163c5f08/FLAGe587c105e [2022-11-02 20:50:38,620 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/data/c5a3b9f69/9f595812ae8b406384afe5d5163c5f08 [2022-11-02 20:50:38,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:50:38,625 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:50:38,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:50:38,631 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:50:38,635 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:50:38,637 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:50:38" (1/1) ... [2022-11-02 20:50:38,638 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7415a4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:38, skipping insertion in model container [2022-11-02 20:50:38,638 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:50:38" (1/1) ... [2022-11-02 20:50:38,647 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:50:38,776 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:50:39,098 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i[4499,4512] [2022-11-02 20:50:39,108 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i[4559,4572] [2022-11-02 20:50:40,068 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:50:40,069 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:50:40,070 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:50:40,071 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:50:40,073 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:50:40,091 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:50:40,092 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:50:40,095 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:50:40,096 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:50:40,552 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-02 20:50:40,554 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-02 20:50:40,555 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-02 20:50:40,557 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-02 20:50:40,560 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-02 20:50:40,561 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-02 20:50:40,562 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-02 20:50:40,563 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-02 20:50:40,564 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-02 20:50:40,565 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-02 20:50:40,797 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-02 20:50:40,941 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:50:40,942 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:50:41,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:50:41,086 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:50:41,141 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i[4499,4512] [2022-11-02 20:50:41,141 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i[4559,4572] [2022-11-02 20:50:41,211 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:50:41,213 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:50:41,214 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:50:41,215 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:50:41,219 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:50:41,228 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:50:41,247 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:50:41,248 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:50:41,249 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:50:41,292 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-02 20:50:41,300 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-02 20:50:41,301 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-02 20:50:41,302 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-02 20:50:41,304 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-02 20:50:41,304 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-02 20:50:41,305 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-02 20:50:41,306 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-02 20:50:41,306 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-02 20:50:41,307 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-02 20:50:41,331 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-02 20:50:41,423 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:50:41,424 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:50:41,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:50:41,858 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:50:41,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:41 WrapperNode [2022-11-02 20:50:41,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:50:41,860 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:50:41,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:50:41,860 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:50:41,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:41" (1/1) ... [2022-11-02 20:50:42,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:41" (1/1) ... [2022-11-02 20:50:42,130 INFO L138 Inliner]: procedures = 690, calls = 2735, calls flagged for inlining = 62, calls inlined = 9, statements flattened = 812 [2022-11-02 20:50:42,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:50:42,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:50:42,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:50:42,133 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:50:42,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:41" (1/1) ... [2022-11-02 20:50:42,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:41" (1/1) ... [2022-11-02 20:50:42,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:41" (1/1) ... [2022-11-02 20:50:42,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:41" (1/1) ... [2022-11-02 20:50:42,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:41" (1/1) ... [2022-11-02 20:50:42,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:41" (1/1) ... [2022-11-02 20:50:42,230 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:41" (1/1) ... [2022-11-02 20:50:42,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:41" (1/1) ... [2022-11-02 20:50:42,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:50:42,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:50:42,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:50:42,245 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:50:42,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:41" (1/1) ... [2022-11-02 20:50:42,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:50:42,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:42,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:50:42,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:50:42,340 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-11-02 20:50:42,340 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-11-02 20:50:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:50:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-11-02 20:50:42,341 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-11-02 20:50:42,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2022-11-02 20:50:42,342 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2022-11-02 20:50:42,342 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2022-11-02 20:50:42,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-02 20:50:42,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-02 20:50:42,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:50:42,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-02 20:50:42,344 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-02 20:50:42,345 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-11-02 20:50:42,345 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-11-02 20:50:42,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-02 20:50:42,345 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-02 20:50:42,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:50:42,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:50:42,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:50:42,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:50:42,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:50:42,346 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-02 20:50:42,347 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-02 20:50:42,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-02 20:50:42,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-02 20:50:42,348 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2022-11-02 20:50:42,348 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2022-11-02 20:50:42,348 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-02 20:50:42,348 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-02 20:50:42,349 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2022-11-02 20:50:42,349 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2022-11-02 20:50:42,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:50:42,350 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-11-02 20:50:42,350 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-11-02 20:50:42,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:50:42,350 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_new_from_array [2022-11-02 20:50:42,351 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_new_from_array [2022-11-02 20:50:42,351 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-11-02 20:50:42,351 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-11-02 20:50:42,351 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-11-02 20:50:42,351 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-11-02 20:50:42,351 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-02 20:50:42,352 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-02 20:50:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:50:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2022-11-02 20:50:42,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:50:42,784 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:50:42,787 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:50:42,962 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !true; [2022-11-02 20:50:44,142 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:50:44,154 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:50:44,155 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 20:50:44,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:50:44 BoogieIcfgContainer [2022-11-02 20:50:44,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:50:44,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:50:44,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:50:44,166 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:50:44,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:50:38" (1/3) ... [2022-11-02 20:50:44,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ecac270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:50:44, skipping insertion in model container [2022-11-02 20:50:44,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:41" (2/3) ... [2022-11-02 20:50:44,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ecac270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:50:44, skipping insertion in model container [2022-11-02 20:50:44,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:50:44" (3/3) ... [2022-11-02 20:50:44,170 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_string_new_from_c_str_harness.i [2022-11-02 20:50:44,193 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:50:44,193 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:50:44,283 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:50:44,304 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;@b50c624, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:50:44,304 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:50:44,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 86 states have internal predecessors, (100), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-11-02 20:50:44,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-02 20:50:44,321 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:44,322 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:50:44,325 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:44,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:44,333 INFO L85 PathProgramCache]: Analyzing trace with hash -555983859, now seen corresponding path program 1 times [2022-11-02 20:50:44,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:44,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381154525] [2022-11-02 20:50:44,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:44,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:45,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:45,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:50:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:45,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:50:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:45,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:45,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:50:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:45,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:50:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:45,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:50:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:45,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 20:50:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:45,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:45,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:50:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:45,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:50:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:45,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-02 20:50:45,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:45,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381154525] [2022-11-02 20:50:45,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381154525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:45,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:45,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:50:45,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702048712] [2022-11-02 20:50:45,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:45,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:50:45,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:45,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:50:45,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:50:45,386 INFO L87 Difference]: Start difference. First operand has 136 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 86 states have internal predecessors, (100), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-02 20:50:45,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:45,964 INFO L93 Difference]: Finished difference Result 283 states and 370 transitions. [2022-11-02 20:50:45,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:50:45,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 74 [2022-11-02 20:50:45,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:45,978 INFO L225 Difference]: With dead ends: 283 [2022-11-02 20:50:45,979 INFO L226 Difference]: Without dead ends: 147 [2022-11-02 20:50:45,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:50:45,986 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 99 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:45,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 198 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:50:46,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-02 20:50:46,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 130. [2022-11-02 20:50:46,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 80 states have (on average 1.15) internal successors, (92), 81 states have internal predecessors, (92), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-11-02 20:50:46,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2022-11-02 20:50:46,045 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 74 [2022-11-02 20:50:46,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:46,046 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2022-11-02 20:50:46,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-02 20:50:46,047 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2022-11-02 20:50:46,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-02 20:50:46,049 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:46,050 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:50:46,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:50:46,050 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:46,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:46,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1001240943, now seen corresponding path program 1 times [2022-11-02 20:50:46,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:46,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344694324] [2022-11-02 20:50:46,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:46,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:46,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:46,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:50:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:46,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:50:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:46,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:46,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:50:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:46,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:50:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:46,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:50:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:46,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 20:50:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:46,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:46,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:50:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:46,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:50:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:46,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:46,972 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-02 20:50:46,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:46,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344694324] [2022-11-02 20:50:46,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344694324] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:46,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:46,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:50:46,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916953256] [2022-11-02 20:50:46,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:46,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:50:46,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:46,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:50:46,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:50:46,977 INFO L87 Difference]: Start difference. First operand 130 states and 159 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-11-02 20:50:47,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:47,878 INFO L93 Difference]: Finished difference Result 196 states and 238 transitions. [2022-11-02 20:50:47,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:50:47,879 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 74 [2022-11-02 20:50:47,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:47,881 INFO L225 Difference]: With dead ends: 196 [2022-11-02 20:50:47,881 INFO L226 Difference]: Without dead ends: 152 [2022-11-02 20:50:47,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:50:47,883 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 101 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:47,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 382 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:50:47,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-02 20:50:47,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 135. [2022-11-02 20:50:47,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 85 states have internal predecessors, (96), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (34), 34 states have call predecessors, (34), 33 states have call successors, (34) [2022-11-02 20:50:47,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 164 transitions. [2022-11-02 20:50:47,904 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 164 transitions. Word has length 74 [2022-11-02 20:50:47,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:47,904 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 164 transitions. [2022-11-02 20:50:47,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-11-02 20:50:47,905 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 164 transitions. [2022-11-02 20:50:47,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-02 20:50:47,907 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:47,907 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:50:47,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:50:47,908 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:47,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:47,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1994019405, now seen corresponding path program 1 times [2022-11-02 20:50:47,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:47,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436595801] [2022-11-02 20:50:47,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:47,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:48,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:48,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:50:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:48,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:50:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:48,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:48,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:50:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:48,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:50:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:48,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:50:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:48,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 20:50:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:48,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:48,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:50:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:48,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:50:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:48,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:48,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:50:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:48,837 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-02 20:50:48,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:48,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436595801] [2022-11-02 20:50:48,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436595801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:48,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:48,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:50:48,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179465137] [2022-11-02 20:50:48,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:48,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:50:48,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:48,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:50:48,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:50:48,840 INFO L87 Difference]: Start difference. First operand 135 states and 164 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-11-02 20:50:50,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:50,045 INFO L93 Difference]: Finished difference Result 217 states and 267 transitions. [2022-11-02 20:50:50,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:50:50,045 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 80 [2022-11-02 20:50:50,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:50,048 INFO L225 Difference]: With dead ends: 217 [2022-11-02 20:50:50,049 INFO L226 Difference]: Without dead ends: 178 [2022-11-02 20:50:50,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:50:50,051 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 180 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:50,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 470 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:50:50,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-02 20:50:50,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 140. [2022-11-02 20:50:50,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 88 states have (on average 1.1363636363636365) internal successors, (100), 89 states have internal predecessors, (100), 34 states have call successors, (34), 15 states have call predecessors, (34), 17 states have return successors, (35), 35 states have call predecessors, (35), 33 states have call successors, (35) [2022-11-02 20:50:50,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 169 transitions. [2022-11-02 20:50:50,075 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 169 transitions. Word has length 80 [2022-11-02 20:50:50,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:50,076 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 169 transitions. [2022-11-02 20:50:50,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-11-02 20:50:50,077 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 169 transitions. [2022-11-02 20:50:50,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-02 20:50:50,078 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:50,079 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:50:50,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:50:50,079 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:50,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:50,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1920697878, now seen corresponding path program 1 times [2022-11-02 20:50:50,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:50,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751253459] [2022-11-02 20:50:50,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:50,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:51,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:51,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:50:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:51,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:50:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:51,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:51,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:50:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:51,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:50:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:51,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:50:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:51,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 20:50:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:51,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:51,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:50:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:51,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:50:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:51,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:51,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:50:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-02 20:50:51,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:51,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751253459] [2022-11-02 20:50:51,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751253459] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:51,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:51,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:50:51,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215083175] [2022-11-02 20:50:51,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:51,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:50:51,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:51,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:50:51,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:50:51,751 INFO L87 Difference]: Start difference. First operand 140 states and 169 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-02 20:50:53,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:53,614 INFO L93 Difference]: Finished difference Result 178 states and 219 transitions. [2022-11-02 20:50:53,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:50:53,620 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 82 [2022-11-02 20:50:53,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:53,622 INFO L225 Difference]: With dead ends: 178 [2022-11-02 20:50:53,622 INFO L226 Difference]: Without dead ends: 161 [2022-11-02 20:50:53,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:50:53,623 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 185 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:53,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 744 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 20:50:53,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-11-02 20:50:53,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 126. [2022-11-02 20:50:53,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 78 states have internal predecessors, (86), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-11-02 20:50:53,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 151 transitions. [2022-11-02 20:50:53,660 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 151 transitions. Word has length 82 [2022-11-02 20:50:53,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:53,661 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 151 transitions. [2022-11-02 20:50:53,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-02 20:50:53,662 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 151 transitions. [2022-11-02 20:50:53,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-11-02 20:50:53,663 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:53,664 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2022-11-02 20:50:53,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:50:53,666 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:53,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:53,666 INFO L85 PathProgramCache]: Analyzing trace with hash -870191708, now seen corresponding path program 1 times [2022-11-02 20:50:53,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:53,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657577063] [2022-11-02 20:50:53,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:53,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:54,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:54,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:50:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:54,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:50:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:54,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:54,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:50:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:54,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:50:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:54,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:50:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:54,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:50:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:54,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:50:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:54,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:50:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:54,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:54,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:50:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:54,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:54,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:54,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:50:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:54,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:50:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:54,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:50:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:54,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:54,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-02 20:50:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:54,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-02 20:50:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:54,768 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-11-02 20:50:54,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:54,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657577063] [2022-11-02 20:50:54,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657577063] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:54,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:54,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:50:54,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340809509] [2022-11-02 20:50:54,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:54,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:50:54,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:54,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:50:54,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:50:54,772 INFO L87 Difference]: Start difference. First operand 126 states and 151 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-02 20:50:56,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:56,061 INFO L93 Difference]: Finished difference Result 206 states and 249 transitions. [2022-11-02 20:50:56,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:50:56,062 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 123 [2022-11-02 20:50:56,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:56,064 INFO L225 Difference]: With dead ends: 206 [2022-11-02 20:50:56,064 INFO L226 Difference]: Without dead ends: 151 [2022-11-02 20:50:56,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:50:56,066 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 159 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:56,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 464 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:50:56,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-02 20:50:56,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 131. [2022-11-02 20:50:56,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 81 states have (on average 1.1111111111111112) internal successors, (90), 82 states have internal predecessors, (90), 33 states have call successors, (33), 15 states have call predecessors, (33), 16 states have return successors, (33), 33 states have call predecessors, (33), 32 states have call successors, (33) [2022-11-02 20:50:56,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 156 transitions. [2022-11-02 20:50:56,082 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 156 transitions. Word has length 123 [2022-11-02 20:50:56,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:56,083 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 156 transitions. [2022-11-02 20:50:56,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-02 20:50:56,083 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 156 transitions. [2022-11-02 20:50:56,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-02 20:50:56,085 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:56,086 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2022-11-02 20:50:56,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:50:56,086 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:56,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:56,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1724885987, now seen corresponding path program 1 times [2022-11-02 20:50:56,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:56,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555768542] [2022-11-02 20:50:56,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:56,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:56,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:50:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:56,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:50:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:56,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:50:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:56,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:56,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:50:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:56,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:50:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:56,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:50:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:56,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:50:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:56,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:50:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:56,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:50:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:56,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:57,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:50:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:57,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:57,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:57,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:50:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:57,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:50:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:57,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:50:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:57,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:50:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:57,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:50:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:57,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-02 20:50:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:57,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 20:50:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:57,295 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-11-02 20:50:57,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:57,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555768542] [2022-11-02 20:50:57,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555768542] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:57,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:57,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:50:57,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782637799] [2022-11-02 20:50:57,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:57,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:50:57,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:57,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:50:57,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:50:57,302 INFO L87 Difference]: Start difference. First operand 131 states and 156 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2022-11-02 20:50:58,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:50:58,755 INFO L93 Difference]: Finished difference Result 212 states and 257 transitions. [2022-11-02 20:50:58,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:50:58,756 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) Word has length 129 [2022-11-02 20:50:58,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:50:58,757 INFO L225 Difference]: With dead ends: 212 [2022-11-02 20:50:58,757 INFO L226 Difference]: Without dead ends: 143 [2022-11-02 20:50:58,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:50:58,759 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 276 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:50:58,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 466 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 20:50:58,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-02 20:50:58,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 124. [2022-11-02 20:50:58,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 77 states have internal predecessors, (83), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-02 20:50:58,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 146 transitions. [2022-11-02 20:50:58,787 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 146 transitions. Word has length 129 [2022-11-02 20:50:58,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:50:58,788 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 146 transitions. [2022-11-02 20:50:58,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2022-11-02 20:50:58,789 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 146 transitions. [2022-11-02 20:50:58,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-02 20:50:58,797 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:50:58,798 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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-02 20:50:58,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:50:58,798 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:50:58,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:58,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1745997560, now seen corresponding path program 1 times [2022-11-02 20:50:58,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:58,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272315080] [2022-11-02 20:50:58,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:58,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:01,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:01,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:51:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:01,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:51:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:01,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:01,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:51:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:01,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:51:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:01,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:51:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:01,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:51:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:01,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:51:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:01,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:51:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:01,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:01,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:51:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:02,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:02,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:02,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:51:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:02,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:51:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:02,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:51:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:02,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:02,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:51:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:02,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:02,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:51:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:02,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-02 20:51:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:03,009 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-02 20:51:03,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:03,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272315080] [2022-11-02 20:51:03,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272315080] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:03,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:03,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-11-02 20:51:03,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906236831] [2022-11-02 20:51:03,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:03,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-02 20:51:03,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:03,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-02 20:51:03,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:51:03,012 INFO L87 Difference]: Start difference. First operand 124 states and 146 transitions. Second operand has 22 states, 20 states have (on average 3.25) internal successors, (65), 17 states have internal predecessors, (65), 8 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) [2022-11-02 20:51:06,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:06,249 INFO L93 Difference]: Finished difference Result 190 states and 229 transitions. [2022-11-02 20:51:06,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-02 20:51:06,250 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.25) internal successors, (65), 17 states have internal predecessors, (65), 8 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) Word has length 134 [2022-11-02 20:51:06,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:06,252 INFO L225 Difference]: With dead ends: 190 [2022-11-02 20:51:06,252 INFO L226 Difference]: Without dead ends: 143 [2022-11-02 20:51:06,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=172, Invalid=1388, Unknown=0, NotChecked=0, Total=1560 [2022-11-02 20:51:06,256 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 87 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 1842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:06,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1084 Invalid, 1842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-02 20:51:06,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-02 20:51:06,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2022-11-02 20:51:06,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 88 states have internal predecessors, (93), 34 states have call successors, (34), 15 states have call predecessors, (34), 17 states have return successors, (35), 33 states have call predecessors, (35), 33 states have call successors, (35) [2022-11-02 20:51:06,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 162 transitions. [2022-11-02 20:51:06,274 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 162 transitions. Word has length 134 [2022-11-02 20:51:06,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:06,275 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 162 transitions. [2022-11-02 20:51:06,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.25) internal successors, (65), 17 states have internal predecessors, (65), 8 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) [2022-11-02 20:51:06,275 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 162 transitions. [2022-11-02 20:51:06,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-11-02 20:51:06,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:06,278 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2022-11-02 20:51:06,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:51:06,278 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:06,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:06,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1524709556, now seen corresponding path program 1 times [2022-11-02 20:51:06,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:06,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699440416] [2022-11-02 20:51:06,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:06,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:06,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:06,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:51:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:06,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:51:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:06,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:06,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:51:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:06,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:51:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:06,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:51:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:06,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:51:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:06,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:51:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:06,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:51:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:06,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:06,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:51:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:06,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:51:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:06,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:06,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:06,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:51:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:06,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:51:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:07,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:51:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:07,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:07,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:51:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:07,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:07,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-02 20:51:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:07,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-02 20:51:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:07,123 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-02 20:51:07,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:07,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699440416] [2022-11-02 20:51:07,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699440416] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:07,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:07,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:51:07,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447827029] [2022-11-02 20:51:07,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:07,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:51:07,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:07,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:51:07,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:51:07,127 INFO L87 Difference]: Start difference. First operand 137 states and 162 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-02 20:51:08,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:08,572 INFO L93 Difference]: Finished difference Result 225 states and 261 transitions. [2022-11-02 20:51:08,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:51:08,573 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) Word has length 140 [2022-11-02 20:51:08,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:08,575 INFO L225 Difference]: With dead ends: 225 [2022-11-02 20:51:08,575 INFO L226 Difference]: Without dead ends: 119 [2022-11-02 20:51:08,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:51:08,577 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 91 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:08,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 478 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-02 20:51:08,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-02 20:51:08,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-11-02 20:51:08,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 73 states have (on average 1.082191780821918) internal successors, (79), 74 states have internal predecessors, (79), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-02 20:51:08,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2022-11-02 20:51:08,595 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 140 [2022-11-02 20:51:08,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:08,596 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2022-11-02 20:51:08,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-02 20:51:08,597 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2022-11-02 20:51:08,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-02 20:51:08,599 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:08,599 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2022-11-02 20:51:08,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:51:08,600 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:08,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:08,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1517224244, now seen corresponding path program 1 times [2022-11-02 20:51:08,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:08,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570010758] [2022-11-02 20:51:08,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:08,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:09,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:09,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:51:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:09,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:51:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:09,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:09,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:51:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:09,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:51:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:09,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:51:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:09,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:51:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:09,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:51:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:09,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:51:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:09,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:09,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:51:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:09,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:09,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:09,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:51:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:09,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:51:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:09,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:51:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:09,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:09,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:51:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:09,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:09,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:51:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:09,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 20:51:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:09,632 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-02 20:51:09,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:09,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570010758] [2022-11-02 20:51:09,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570010758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:09,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:09,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:51:09,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728378611] [2022-11-02 20:51:09,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:09,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:51:09,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:09,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:51:09,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:51:09,635 INFO L87 Difference]: Start difference. First operand 119 states and 140 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-02 20:51:10,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:10,539 INFO L93 Difference]: Finished difference Result 166 states and 196 transitions. [2022-11-02 20:51:10,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:51:10,540 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2022-11-02 20:51:10,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:10,542 INFO L225 Difference]: With dead ends: 166 [2022-11-02 20:51:10,542 INFO L226 Difference]: Without dead ends: 120 [2022-11-02 20:51:10,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:51:10,543 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 117 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:10,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 296 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:51:10,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-02 20:51:10,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-11-02 20:51:10,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 75 states have internal predecessors, (80), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-02 20:51:10,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 141 transitions. [2022-11-02 20:51:10,557 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 141 transitions. Word has length 135 [2022-11-02 20:51:10,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:10,558 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 141 transitions. [2022-11-02 20:51:10,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-02 20:51:10,558 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 141 transitions. [2022-11-02 20:51:10,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-02 20:51:10,560 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:10,560 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2022-11-02 20:51:10,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:51:10,561 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:10,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:10,561 INFO L85 PathProgramCache]: Analyzing trace with hash -473758278, now seen corresponding path program 1 times [2022-11-02 20:51:10,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:10,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151075187] [2022-11-02 20:51:10,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:10,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:13,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:13,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:51:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:13,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:51:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:13,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:13,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:51:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:13,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:51:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:13,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:51:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:13,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:51:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:13,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:51:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:13,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:51:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:14,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:14,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:51:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:14,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:14,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:14,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:51:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:14,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:51:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:14,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:51:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:14,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:14,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:51:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:14,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:14,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:51:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:15,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-02 20:51:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:15,113 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-11-02 20:51:15,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:15,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151075187] [2022-11-02 20:51:15,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151075187] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:15,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076751754] [2022-11-02 20:51:15,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:15,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:51:15,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:15,122 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:51:15,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:51:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:15,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 2934 conjuncts, 118 conjunts are in the unsatisfiable core [2022-11-02 20:51:15,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:17,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:51:25,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:51:25,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:51:25,429 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-02 20:51:25,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 33 [2022-11-02 20:51:25,564 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-02 20:51:25,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 36 [2022-11-02 20:51:26,817 INFO L356 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-02 20:51:26,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 71 [2022-11-02 20:51:27,022 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-02 20:51:27,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:51:44,080 WARN L234 SmtUtils]: Spent 14.07s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:51:44,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076751754] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:44,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:51:44,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 37] total 57 [2022-11-02 20:51:44,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677148260] [2022-11-02 20:51:44,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:51:44,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-02 20:51:44,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:44,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-02 20:51:44,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=4118, Unknown=3, NotChecked=0, Total=4290 [2022-11-02 20:51:44,089 INFO L87 Difference]: Start difference. First operand 120 states and 141 transitions. Second operand has 57 states, 50 states have (on average 2.48) internal successors, (124), 42 states have internal predecessors, (124), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) [2022-11-02 20:51:52,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:52,359 INFO L93 Difference]: Finished difference Result 174 states and 206 transitions. [2022-11-02 20:51:52,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-02 20:51:52,360 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 50 states have (on average 2.48) internal successors, (124), 42 states have internal predecessors, (124), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) Word has length 136 [2022-11-02 20:51:52,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:52,362 INFO L225 Difference]: With dead ends: 174 [2022-11-02 20:51:52,362 INFO L226 Difference]: Without dead ends: 123 [2022-11-02 20:51:52,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 30.0s TimeCoverageRelationStatistics Valid=464, Invalid=9039, Unknown=3, NotChecked=0, Total=9506 [2022-11-02 20:51:52,367 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 223 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 4139 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 4605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 4139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:52,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1414 Invalid, 4605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 4139 Invalid, 0 Unknown, 221 Unchecked, 4.9s Time] [2022-11-02 20:51:52,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-02 20:51:52,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2022-11-02 20:51:52,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 75 states have (on average 1.08) internal successors, (81), 76 states have internal predecessors, (81), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-02 20:51:52,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2022-11-02 20:51:52,381 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 142 transitions. Word has length 136 [2022-11-02 20:51:52,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:52,382 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 142 transitions. [2022-11-02 20:51:52,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 50 states have (on average 2.48) internal successors, (124), 42 states have internal predecessors, (124), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) [2022-11-02 20:51:52,382 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 142 transitions. [2022-11-02 20:51:52,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-02 20:51:52,384 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:52,384 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2022-11-02 20:51:52,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-02 20:51:52,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 20:51:52,611 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:52,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:52,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1103785842, now seen corresponding path program 2 times [2022-11-02 20:51:52,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:52,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710723748] [2022-11-02 20:51:52,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:52,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:51:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:51:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:51:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:51:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:51:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:51:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:51:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:51:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:51:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:51:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:51:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:51:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:51:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:57,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:57,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:51:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:57,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-02 20:51:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:57,572 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-11-02 20:51:57,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:57,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710723748] [2022-11-02 20:51:57,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710723748] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:57,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669678393] [2022-11-02 20:51:57,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:51:57,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:51:57,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:57,574 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:51:57,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:52:01,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:52:01,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:52:01,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 3065 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-02 20:52:01,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:01,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:52:05,547 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1284 Int) (v_ArrVal_1291 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1326_11| Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_1284) (+ |v_#Ultimate.C_memcpy_#t~loopctr1326_11| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1291))) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1326_11|))) is different from true [2022-11-02 20:52:13,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:52:13,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:52:13,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:52:13,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-02 20:52:13,691 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-02 20:52:13,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2022-11-02 20:52:14,863 INFO L356 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-02 20:52:14,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 61 [2022-11-02 20:52:15,053 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 150 trivial. 2 not checked. [2022-11-02 20:52:15,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:52:32,114 WARN L234 SmtUtils]: Spent 14.08s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:52:32,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669678393] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:32,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:52:32,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28] total 50 [2022-11-02 20:52:32,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102287977] [2022-11-02 20:52:32,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:52:32,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-02 20:52:32,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:32,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-02 20:52:32,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=3163, Unknown=3, NotChecked=112, Total=3422 [2022-11-02 20:52:32,120 INFO L87 Difference]: Start difference. First operand 121 states and 142 transitions. Second operand has 50 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 37 states have internal predecessors, (107), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-11-02 20:52:57,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:57,701 INFO L93 Difference]: Finished difference Result 173 states and 205 transitions. [2022-11-02 20:52:57,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-02 20:52:57,702 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 37 states have internal predecessors, (107), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) Word has length 137 [2022-11-02 20:52:57,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:57,704 INFO L225 Difference]: With dead ends: 173 [2022-11-02 20:52:57,704 INFO L226 Difference]: Without dead ends: 122 [2022-11-02 20:52:57,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 51.0s TimeCoverageRelationStatistics Valid=331, Invalid=6805, Unknown=8, NotChecked=166, Total=7310 [2022-11-02 20:52:57,708 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 101 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 2842 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 3854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 2842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 901 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:57,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1630 Invalid, 3854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 2842 Invalid, 0 Unknown, 901 Unchecked, 4.2s Time] [2022-11-02 20:52:57,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-02 20:52:57,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-11-02 20:52:57,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 77 states have internal predecessors, (82), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-02 20:52:57,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 143 transitions. [2022-11-02 20:52:57,727 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 143 transitions. Word has length 137 [2022-11-02 20:52:57,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:57,728 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 143 transitions. [2022-11-02 20:52:57,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 37 states have internal predecessors, (107), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-11-02 20:52:57,729 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 143 transitions. [2022-11-02 20:52:57,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-02 20:52:57,731 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:57,731 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:57,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:57,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:57,947 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:57,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:57,947 INFO L85 PathProgramCache]: Analyzing trace with hash 840196154, now seen corresponding path program 3 times [2022-11-02 20:52:57,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:57,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437388292] [2022-11-02 20:52:57,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:57,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:01,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:01,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:53:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:01,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:53:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:01,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:01,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:53:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:01,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:53:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:01,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:53:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:01,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:53:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:01,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:53:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:01,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:53:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:53:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:53:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:53:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:53:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:53:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:02,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:53:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:03,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-02 20:53:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:03,564 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-11-02 20:53:03,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:03,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437388292] [2022-11-02 20:53:03,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437388292] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:03,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137950598] [2022-11-02 20:53:03,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:53:03,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:03,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:03,567 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:03,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:53:13,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-02 20:53:13,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:53:13,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 2868 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-02 20:53:13,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:13,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:53:29,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2022-11-02 20:53:29,237 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-02 20:53:29,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 35 [2022-11-02 20:53:30,312 INFO L356 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-02 20:53:30,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 69 [2022-11-02 20:53:30,495 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-02 20:53:30,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:34,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137950598] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:34,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:53:34,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 29] total 52 [2022-11-02 20:53:34,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411334221] [2022-11-02 20:53:34,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:34,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-02 20:53:34,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:34,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-02 20:53:34,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=3502, Unknown=2, NotChecked=0, Total=3660 [2022-11-02 20:53:34,312 INFO L87 Difference]: Start difference. First operand 122 states and 143 transitions. Second operand has 52 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 39 states have internal predecessors, (109), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-11-02 20:53:41,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:41,757 INFO L93 Difference]: Finished difference Result 175 states and 208 transitions. [2022-11-02 20:53:41,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-02 20:53:41,758 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 39 states have internal predecessors, (109), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) Word has length 138 [2022-11-02 20:53:41,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:41,759 INFO L225 Difference]: With dead ends: 175 [2022-11-02 20:53:41,759 INFO L226 Difference]: Without dead ends: 124 [2022-11-02 20:53:41,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=328, Invalid=6642, Unknown=2, NotChecked=0, Total=6972 [2022-11-02 20:53:41,763 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 127 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 2780 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 3343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 423 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:41,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1609 Invalid, 3343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2780 Invalid, 0 Unknown, 423 Unchecked, 4.3s Time] [2022-11-02 20:53:41,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-02 20:53:41,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-11-02 20:53:41,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 77 states have (on average 1.077922077922078) internal successors, (83), 78 states have internal predecessors, (83), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-02 20:53:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2022-11-02 20:53:41,779 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 138 [2022-11-02 20:53:41,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:41,780 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2022-11-02 20:53:41,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 39 states have internal predecessors, (109), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-11-02 20:53:41,781 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2022-11-02 20:53:41,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-02 20:53:41,783 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:41,783 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 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] [2022-11-02 20:53:41,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:41,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:41,998 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:41,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:41,999 INFO L85 PathProgramCache]: Analyzing trace with hash 974095886, now seen corresponding path program 4 times [2022-11-02 20:53:41,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:41,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48777201] [2022-11-02 20:53:41,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:41,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:45,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:45,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:53:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:45,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:53:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:45,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:45,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:53:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:45,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:53:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:45,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:53:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:45,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:53:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:45,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:53:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:45,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:53:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:45,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:45,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:53:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:46,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:46,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:46,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:53:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:46,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:53:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:46,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:53:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:46,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:46,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:53:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:46,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:46,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 20:53:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:47,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-02 20:53:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:47,391 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-11-02 20:53:47,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:47,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48777201] [2022-11-02 20:53:47,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48777201] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:47,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459541647] [2022-11-02 20:53:47,392 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 20:53:47,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:47,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:47,393 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:47,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89fd48b7-02f3-42f2-8db7-62e3797b5b7d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:53:49,337 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 20:53:49,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:53:49,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 3327 conjuncts, 190 conjunts are in the unsatisfiable core [2022-11-02 20:53:49,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:50,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9