./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--usb--class--cdc-acm.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--usb--class--cdc-acm.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8 --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 234112184b071eb42f340136dfce6e1a552d788d086baea007a05a3140f2d157 --- 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-2329fc7 [2022-12-13 20:32:19,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 20:32:19,199 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 20:32:19,222 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 20:32:19,222 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 20:32:19,223 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 20:32:19,223 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 20:32:19,224 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 20:32:19,225 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 20:32:19,226 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 20:32:19,237 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 20:32:19,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 20:32:19,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 20:32:19,239 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 20:32:19,239 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 20:32:19,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 20:32:19,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 20:32:19,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 20:32:19,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 20:32:19,243 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 20:32:19,244 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 20:32:19,245 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 20:32:19,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 20:32:19,247 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 20:32:19,249 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 20:32:19,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 20:32:19,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 20:32:19,250 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 20:32:19,250 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 20:32:19,251 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 20:32:19,251 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 20:32:19,251 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 20:32:19,252 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 20:32:19,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 20:32:19,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 20:32:19,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 20:32:19,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 20:32:19,254 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 20:32:19,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 20:32:19,254 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 20:32:19,255 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 20:32:19,256 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-12-13 20:32:19,270 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 20:32:19,270 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 20:32:19,270 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 20:32:19,271 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 20:32:19,271 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 20:32:19,271 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 20:32:19,272 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 20:32:19,272 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 20:32:19,272 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 20:32:19,272 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 20:32:19,272 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 20:32:19,272 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 20:32:19,272 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 20:32:19,272 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 20:32:19,272 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 20:32:19,273 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 20:32:19,273 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 20:32:19,273 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 20:32:19,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 20:32:19,273 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 20:32:19,273 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 20:32:19,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:32:19,273 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 20:32:19,273 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 20:32:19,273 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 20:32:19,274 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 20:32:19,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 20:32:19,274 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 20:32:19,274 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 20:32:19,274 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 20:32:19,274 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 20:32:19,274 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 20:32:19,274 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/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_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8 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 -> 234112184b071eb42f340136dfce6e1a552d788d086baea007a05a3140f2d157 [2022-12-13 20:32:19,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 20:32:19,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 20:32:19,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 20:32:19,508 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 20:32:19,508 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 20:32:19,509 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--usb--class--cdc-acm.ko-entry_point.cil.out.i [2022-12-13 20:32:22,112 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 20:32:22,512 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 20:32:22,513 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--usb--class--cdc-acm.ko-entry_point.cil.out.i [2022-12-13 20:32:22,542 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/data/93cb76e47/6972d070cae94d33994dcda85cc366eb/FLAG503836e59 [2022-12-13 20:32:22,556 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/data/93cb76e47/6972d070cae94d33994dcda85cc366eb [2022-12-13 20:32:22,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 20:32:22,560 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 20:32:22,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 20:32:22,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 20:32:22,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 20:32:22,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:32:22" (1/1) ... [2022-12-13 20:32:22,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d52a21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:22, skipping insertion in model container [2022-12-13 20:32:22,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:32:22" (1/1) ... [2022-12-13 20:32:22,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 20:32:22,684 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 20:32:23,144 WARN L623 FunctionHandler]: Unknown extern function __bad_percpu_size [2022-12-13 20:32:23,184 WARN L623 FunctionHandler]: Unknown extern function __cmpxchg_wrong_size [2022-12-13 20:32:23,255 WARN L623 FunctionHandler]: Unknown extern function _raw_spin_lock [2022-12-13 20:32:23,266 WARN L623 FunctionHandler]: Unknown extern function _raw_spin_lock_irq [2022-12-13 20:32:23,278 WARN L623 FunctionHandler]: Unknown extern function _raw_spin_unlock [2022-12-13 20:32:23,290 WARN L623 FunctionHandler]: Unknown extern function _raw_spin_unlock_irq [2022-12-13 20:32:23,301 WARN L623 FunctionHandler]: Unknown extern function _raw_spin_unlock_irqrestore [2022-12-13 20:32:23,398 WARN L623 FunctionHandler]: Unknown extern function debug_lockdep_rcu_enabled [2022-12-13 20:32:23,400 WARN L623 FunctionHandler]: Unknown extern function debug_lockdep_rcu_enabled [2022-12-13 20:32:23,400 WARN L623 FunctionHandler]: Unknown extern function idr_find_slowpath [2022-12-13 20:32:23,486 WARN L623 FunctionHandler]: Unknown extern function __might_fault [2022-12-13 20:32:23,487 WARN L623 FunctionHandler]: Unknown extern function _copy_from_user [2022-12-13 20:32:23,487 WARN L623 FunctionHandler]: Unknown extern function __copy_from_user_overflow [2022-12-13 20:32:23,491 WARN L623 FunctionHandler]: Unknown extern function __might_fault [2022-12-13 20:32:23,492 WARN L623 FunctionHandler]: Unknown extern function _copy_to_user [2022-12-13 20:32:23,492 WARN L623 FunctionHandler]: Unknown extern function __copy_to_user_overflow [2022-12-13 20:32:23,506 WARN L623 FunctionHandler]: Unknown extern function __tty_alloc_driver [2022-12-13 20:32:23,530 WARN L623 FunctionHandler]: Unknown extern function tty_termios_baud_rate [2022-12-13 20:32:23,572 WARN L623 FunctionHandler]: Unknown extern function tty_insert_flip_string_fixed_flag [2022-12-13 20:32:23,700 WARN L623 FunctionHandler]: Unknown extern function __init_waitqueue_head [2022-12-13 20:32:23,701 WARN L623 FunctionHandler]: Unknown extern function __raw_spin_lock_init [2022-12-13 20:32:23,775 WARN L623 FunctionHandler]: Unknown extern function mutex_lock_nested [2022-12-13 20:32:23,776 WARN L623 FunctionHandler]: Unknown extern function mutex_lock_nested [2022-12-13 20:32:23,776 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 20:32:23,777 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 20:32:23,777 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 20:32:23,780 WARN L623 FunctionHandler]: Unknown extern function mutex_lock_nested [2022-12-13 20:32:23,781 WARN L623 FunctionHandler]: Unknown extern function idr_alloc [2022-12-13 20:32:23,781 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 20:32:23,785 WARN L623 FunctionHandler]: Unknown extern function mutex_lock_nested [2022-12-13 20:32:23,785 WARN L623 FunctionHandler]: Unknown extern function idr_remove [2022-12-13 20:32:23,786 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 20:32:23,789 WARN L623 FunctionHandler]: Unknown extern function usb_autopm_get_interface [2022-12-13 20:32:23,790 WARN L623 FunctionHandler]: Unknown extern function usb_control_msg [2022-12-13 20:32:23,792 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:23,793 WARN L623 FunctionHandler]: Unknown extern function usb_autopm_put_interface [2022-12-13 20:32:23,809 WARN L623 FunctionHandler]: Unknown extern function usb_autopm_put_interface_async [2022-12-13 20:32:23,813 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 20:32:23,818 WARN L623 FunctionHandler]: Unknown extern function sprintf [2022-12-13 20:32:23,827 WARN L623 FunctionHandler]: Unknown extern function sprintf [2022-12-13 20:32:23,834 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:23,836 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:23,839 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:23,841 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:23,842 WARN L623 FunctionHandler]: Unknown extern function tty_port_tty_hangup [2022-12-13 20:32:23,845 WARN L623 FunctionHandler]: Unknown extern function __wake_up [2022-12-13 20:32:23,847 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:23,849 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 20:32:23,853 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 20:32:23,861 WARN L623 FunctionHandler]: Unknown extern function tty_flip_buffer_push [2022-12-13 20:32:23,866 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:23,868 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:23,877 WARN L623 FunctionHandler]: Unknown extern function tty_port_tty_wakeup [2022-12-13 20:32:23,881 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:23,882 WARN L623 FunctionHandler]: Unknown extern function tty_standard_install [2022-12-13 20:32:23,883 WARN L623 FunctionHandler]: Unknown extern function tty_port_put [2022-12-13 20:32:23,887 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:23,888 WARN L623 FunctionHandler]: Unknown extern function tty_port_open [2022-12-13 20:32:23,892 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 20:32:23,897 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:23,898 WARN L623 FunctionHandler]: Unknown extern function mutex_lock_nested [2022-12-13 20:32:23,899 WARN L623 FunctionHandler]: Unknown extern function usb_autopm_get_interface [2022-12-13 20:32:23,899 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 20:32:23,900 WARN L623 FunctionHandler]: Unknown extern function usb_autopm_put_interface [2022-12-13 20:32:23,901 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 20:32:23,901 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-12-13 20:32:23,901 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-12-13 20:32:23,902 WARN L623 FunctionHandler]: Unknown extern function usb_autopm_put_interface [2022-12-13 20:32:23,902 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 20:32:23,907 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:23,908 WARN L623 FunctionHandler]: Unknown extern function usb_put_intf [2022-12-13 20:32:23,908 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 20:32:23,908 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 20:32:23,913 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:23,914 WARN L623 FunctionHandler]: Unknown extern function usb_autopm_get_interface_no_resume [2022-12-13 20:32:23,914 WARN L623 FunctionHandler]: Unknown extern function usb_autopm_put_interface [2022-12-13 20:32:23,915 WARN L623 FunctionHandler]: Unknown extern function usb_get_from_anchor [2022-12-13 20:32:23,915 WARN L623 FunctionHandler]: Unknown extern function usb_autopm_put_interface_async [2022-12-13 20:32:23,916 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-12-13 20:32:23,916 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-12-13 20:32:23,916 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-12-13 20:32:23,921 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:23,922 WARN L623 FunctionHandler]: Unknown extern function tty_port_put [2022-12-13 20:32:23,926 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:23,927 WARN L623 FunctionHandler]: Unknown extern function tty_port_hangup [2022-12-13 20:32:23,932 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:23,932 WARN L623 FunctionHandler]: Unknown extern function tty_port_close [2022-12-13 20:32:23,937 WARN L623 FunctionHandler]: Unknown extern function usb_autopm_get_interface_async [2022-12-13 20:32:23,938 WARN L623 FunctionHandler]: Unknown extern function usb_anchor_urb [2022-12-13 20:32:23,957 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:23,977 WARN L623 FunctionHandler]: Unknown extern function mutex_lock_nested [2022-12-13 20:32:23,977 WARN L623 FunctionHandler]: Unknown extern function capable [2022-12-13 20:32:23,978 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 20:32:23,984 WARN L623 FunctionHandler]: Unknown extern function add_wait_queue [2022-12-13 20:32:23,985 WARN L623 FunctionHandler]: Unknown extern function __xchg_wrong_size [2022-12-13 20:32:23,985 WARN L623 FunctionHandler]: Unknown extern function schedule [2022-12-13 20:32:23,986 WARN L623 FunctionHandler]: Unknown extern function remove_wait_queue [2022-12-13 20:32:23,995 WARN L623 FunctionHandler]: Unknown extern function usb_autopm_get_interface [2022-12-13 20:32:23,995 WARN L623 FunctionHandler]: Unknown extern function usb_autopm_put_interface [2022-12-13 20:32:23,999 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 20:32:24,001 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,005 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 20:32:24,009 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 20:32:24,025 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 20:32:24,031 WARN L623 FunctionHandler]: Unknown extern function usb_ifnum_to_if [2022-12-13 20:32:24,031 WARN L623 FunctionHandler]: Unknown extern function usb_ifnum_to_if [2022-12-13 20:32:24,031 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 20:32:24,033 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,033 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 20:32:24,034 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 20:32:24,034 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 20:32:24,035 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 20:32:24,037 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,038 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,038 WARN L623 FunctionHandler]: Unknown extern function usb_ifnum_to_if [2022-12-13 20:32:24,039 WARN L623 FunctionHandler]: Unknown extern function usb_ifnum_to_if [2022-12-13 20:32:24,040 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,040 WARN L623 FunctionHandler]: Unknown extern function dev_warn [2022-12-13 20:32:24,041 WARN L623 FunctionHandler]: Unknown extern function usb_ifnum_to_if [2022-12-13 20:32:24,041 WARN L623 FunctionHandler]: Unknown extern function usb_ifnum_to_if [2022-12-13 20:32:24,042 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,043 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,044 WARN L623 FunctionHandler]: Unknown extern function dev_warn [2022-12-13 20:32:24,044 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 20:32:24,046 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,047 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,049 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,050 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,051 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 20:32:24,051 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 20:32:24,052 WARN L623 FunctionHandler]: Unknown extern function __init_work [2022-12-13 20:32:24,052 WARN L623 FunctionHandler]: Unknown extern function lockdep_init_map [2022-12-13 20:32:24,052 WARN L623 FunctionHandler]: Unknown extern function __init_waitqueue_head [2022-12-13 20:32:24,053 WARN L623 FunctionHandler]: Unknown extern function __raw_spin_lock_init [2022-12-13 20:32:24,053 WARN L623 FunctionHandler]: Unknown extern function __raw_spin_lock_init [2022-12-13 20:32:24,053 WARN L623 FunctionHandler]: Unknown extern function __mutex_init [2022-12-13 20:32:24,054 WARN L623 FunctionHandler]: Unknown extern function tty_port_init [2022-12-13 20:32:24,058 WARN L623 FunctionHandler]: Unknown extern function device_create_file [2022-12-13 20:32:24,059 WARN L623 FunctionHandler]: Unknown extern function device_create_file [2022-12-13 20:32:24,059 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 20:32:24,060 WARN L623 FunctionHandler]: Unknown extern function device_create_file [2022-12-13 20:32:24,060 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-12-13 20:32:24,060 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 20:32:24,061 WARN L623 FunctionHandler]: Unknown extern function _dev_info [2022-12-13 20:32:24,061 WARN L623 FunctionHandler]: Unknown extern function usb_driver_claim_interface [2022-12-13 20:32:24,062 WARN L623 FunctionHandler]: Unknown extern function usb_get_intf [2022-12-13 20:32:24,062 WARN L623 FunctionHandler]: Unknown extern function tty_port_register_device [2022-12-13 20:32:24,062 WARN L623 FunctionHandler]: Unknown extern function usb_clear_halt [2022-12-13 20:32:24,063 WARN L623 FunctionHandler]: Unknown extern function usb_clear_halt [2022-12-13 20:32:24,063 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-12-13 20:32:24,063 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-12-13 20:32:24,064 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 20:32:24,064 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-12-13 20:32:24,064 WARN L623 FunctionHandler]: Unknown extern function usb_free_urb [2022-12-13 20:32:24,064 WARN L623 FunctionHandler]: Unknown extern function usb_free_urb [2022-12-13 20:32:24,065 WARN L623 FunctionHandler]: Unknown extern function usb_free_urb [2022-12-13 20:32:24,065 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 20:32:24,065 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 20:32:24,070 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,070 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-12-13 20:32:24,070 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-12-13 20:32:24,071 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-12-13 20:32:24,075 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,076 WARN L623 FunctionHandler]: Unknown extern function mutex_lock_nested [2022-12-13 20:32:24,076 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-12-13 20:32:24,076 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-12-13 20:32:24,076 WARN L623 FunctionHandler]: Unknown extern function __wake_up [2022-12-13 20:32:24,076 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-12-13 20:32:24,077 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 20:32:24,077 WARN L623 FunctionHandler]: Unknown extern function tty_port_tty_get [2022-12-13 20:32:24,077 WARN L623 FunctionHandler]: Unknown extern function tty_vhangup [2022-12-13 20:32:24,077 WARN L623 FunctionHandler]: Unknown extern function tty_kref_put [2022-12-13 20:32:24,078 WARN L623 FunctionHandler]: Unknown extern function tty_unregister_device [2022-12-13 20:32:24,078 WARN L623 FunctionHandler]: Unknown extern function usb_free_urb [2022-12-13 20:32:24,078 WARN L623 FunctionHandler]: Unknown extern function usb_free_urb [2022-12-13 20:32:24,078 WARN L623 FunctionHandler]: Unknown extern function usb_free_urb [2022-12-13 20:32:24,079 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 20:32:24,079 WARN L623 FunctionHandler]: Unknown extern function usb_driver_release_interface [2022-12-13 20:32:24,079 WARN L623 FunctionHandler]: Unknown extern function tty_port_put [2022-12-13 20:32:24,086 WARN L623 FunctionHandler]: Unknown extern function usb_get_from_anchor [2022-12-13 20:32:24,090 WARN L623 FunctionHandler]: Unknown extern function tty_port_tty_hangup [2022-12-13 20:32:24,103 WARN L623 FunctionHandler]: Unknown extern function tty_set_operations [2022-12-13 20:32:24,103 WARN L623 FunctionHandler]: Unknown extern function tty_register_driver [2022-12-13 20:32:24,104 WARN L623 FunctionHandler]: Unknown extern function put_tty_driver [2022-12-13 20:32:24,104 WARN L623 FunctionHandler]: Unknown extern function tty_unregister_driver [2022-12-13 20:32:24,104 WARN L623 FunctionHandler]: Unknown extern function put_tty_driver [2022-12-13 20:32:24,105 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 20:32:24,108 WARN L623 FunctionHandler]: Unknown extern function tty_unregister_driver [2022-12-13 20:32:24,108 WARN L623 FunctionHandler]: Unknown extern function put_tty_driver [2022-12-13 20:32:24,121 WARN L623 FunctionHandler]: Unknown extern function ldv_initialize [2022-12-13 20:32:24,127 WARN L623 FunctionHandler]: Unknown extern function ldv_check_final_state [2022-12-13 20:32:24,129 WARN L623 FunctionHandler]: Unknown extern function queue_work_on [2022-12-13 20:32:24,129 WARN L623 FunctionHandler]: Unknown extern function queue_delayed_work_on [2022-12-13 20:32:24,130 WARN L623 FunctionHandler]: Unknown extern function queue_work_on [2022-12-13 20:32:24,130 WARN L623 FunctionHandler]: Unknown extern function flush_workqueue [2022-12-13 20:32:24,130 WARN L623 FunctionHandler]: Unknown extern function queue_delayed_work_on [2022-12-13 20:32:24,132 WARN L623 FunctionHandler]: Unknown extern function cancel_work_sync [2022-12-13 20:32:24,133 WARN L623 FunctionHandler]: Unknown extern function usb_register_driver [2022-12-13 20:32:24,133 WARN L623 FunctionHandler]: Unknown extern function usb_deregister [2022-12-13 20:32:24,137 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--usb--class--cdc-acm.ko-entry_point.cil.out.i[254896,254909] [2022-12-13 20:32:24,151 WARN L623 FunctionHandler]: Unknown extern function ldv_some_page [2022-12-13 20:32:24,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:32:24,212 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 20:32:24,259 WARN L623 FunctionHandler]: Unknown extern function __bad_percpu_size [2022-12-13 20:32:24,260 WARN L623 FunctionHandler]: Unknown extern function __cmpxchg_wrong_size [2022-12-13 20:32:24,262 WARN L623 FunctionHandler]: Unknown extern function _raw_spin_lock [2022-12-13 20:32:24,263 WARN L623 FunctionHandler]: Unknown extern function _raw_spin_lock_irq [2022-12-13 20:32:24,263 WARN L623 FunctionHandler]: Unknown extern function _raw_spin_unlock [2022-12-13 20:32:24,263 WARN L623 FunctionHandler]: Unknown extern function _raw_spin_unlock_irq [2022-12-13 20:32:24,263 WARN L623 FunctionHandler]: Unknown extern function _raw_spin_unlock_irqrestore [2022-12-13 20:32:24,265 WARN L623 FunctionHandler]: Unknown extern function debug_lockdep_rcu_enabled [2022-12-13 20:32:24,266 WARN L623 FunctionHandler]: Unknown extern function debug_lockdep_rcu_enabled [2022-12-13 20:32:24,266 WARN L623 FunctionHandler]: Unknown extern function idr_find_slowpath [2022-12-13 20:32:24,269 WARN L623 FunctionHandler]: Unknown extern function __might_fault [2022-12-13 20:32:24,269 WARN L623 FunctionHandler]: Unknown extern function _copy_from_user [2022-12-13 20:32:24,269 WARN L623 FunctionHandler]: Unknown extern function __copy_from_user_overflow [2022-12-13 20:32:24,270 WARN L623 FunctionHandler]: Unknown extern function __might_fault [2022-12-13 20:32:24,270 WARN L623 FunctionHandler]: Unknown extern function _copy_to_user [2022-12-13 20:32:24,270 WARN L623 FunctionHandler]: Unknown extern function __copy_to_user_overflow [2022-12-13 20:32:24,271 WARN L623 FunctionHandler]: Unknown extern function __tty_alloc_driver [2022-12-13 20:32:24,272 WARN L623 FunctionHandler]: Unknown extern function tty_termios_baud_rate [2022-12-13 20:32:24,273 WARN L623 FunctionHandler]: Unknown extern function tty_insert_flip_string_fixed_flag [2022-12-13 20:32:24,278 WARN L623 FunctionHandler]: Unknown extern function __init_waitqueue_head [2022-12-13 20:32:24,278 WARN L623 FunctionHandler]: Unknown extern function __raw_spin_lock_init [2022-12-13 20:32:24,300 WARN L623 FunctionHandler]: Unknown extern function mutex_lock_nested [2022-12-13 20:32:24,300 WARN L623 FunctionHandler]: Unknown extern function mutex_lock_nested [2022-12-13 20:32:24,301 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 20:32:24,301 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 20:32:24,301 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 20:32:24,302 WARN L623 FunctionHandler]: Unknown extern function mutex_lock_nested [2022-12-13 20:32:24,302 WARN L623 FunctionHandler]: Unknown extern function idr_alloc [2022-12-13 20:32:24,302 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 20:32:24,302 WARN L623 FunctionHandler]: Unknown extern function mutex_lock_nested [2022-12-13 20:32:24,302 WARN L623 FunctionHandler]: Unknown extern function idr_remove [2022-12-13 20:32:24,303 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 20:32:24,303 WARN L623 FunctionHandler]: Unknown extern function usb_autopm_get_interface [2022-12-13 20:32:24,303 WARN L623 FunctionHandler]: Unknown extern function usb_control_msg [2022-12-13 20:32:24,304 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,305 WARN L623 FunctionHandler]: Unknown extern function usb_autopm_put_interface [2022-12-13 20:32:24,306 WARN L623 FunctionHandler]: Unknown extern function usb_autopm_put_interface_async [2022-12-13 20:32:24,307 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 20:32:24,308 WARN L623 FunctionHandler]: Unknown extern function sprintf [2022-12-13 20:32:24,310 WARN L623 FunctionHandler]: Unknown extern function sprintf [2022-12-13 20:32:24,313 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,315 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,316 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,318 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,319 WARN L623 FunctionHandler]: Unknown extern function tty_port_tty_hangup [2022-12-13 20:32:24,321 WARN L623 FunctionHandler]: Unknown extern function __wake_up [2022-12-13 20:32:24,322 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,323 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 20:32:24,325 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 20:32:24,326 WARN L623 FunctionHandler]: Unknown extern function tty_flip_buffer_push [2022-12-13 20:32:24,329 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,330 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,334 WARN L623 FunctionHandler]: Unknown extern function tty_port_tty_wakeup [2022-12-13 20:32:24,336 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,337 WARN L623 FunctionHandler]: Unknown extern function tty_standard_install [2022-12-13 20:32:24,338 WARN L623 FunctionHandler]: Unknown extern function tty_port_put [2022-12-13 20:32:24,339 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,340 WARN L623 FunctionHandler]: Unknown extern function tty_port_open [2022-12-13 20:32:24,341 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 20:32:24,343 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,343 WARN L623 FunctionHandler]: Unknown extern function mutex_lock_nested [2022-12-13 20:32:24,343 WARN L623 FunctionHandler]: Unknown extern function usb_autopm_get_interface [2022-12-13 20:32:24,344 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 20:32:24,344 WARN L623 FunctionHandler]: Unknown extern function usb_autopm_put_interface [2022-12-13 20:32:24,345 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 20:32:24,345 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-12-13 20:32:24,345 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-12-13 20:32:24,345 WARN L623 FunctionHandler]: Unknown extern function usb_autopm_put_interface [2022-12-13 20:32:24,345 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 20:32:24,347 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,348 WARN L623 FunctionHandler]: Unknown extern function usb_put_intf [2022-12-13 20:32:24,348 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 20:32:24,348 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 20:32:24,349 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,350 WARN L623 FunctionHandler]: Unknown extern function usb_autopm_get_interface_no_resume [2022-12-13 20:32:24,350 WARN L623 FunctionHandler]: Unknown extern function usb_autopm_put_interface [2022-12-13 20:32:24,350 WARN L623 FunctionHandler]: Unknown extern function usb_get_from_anchor [2022-12-13 20:32:24,351 WARN L623 FunctionHandler]: Unknown extern function usb_autopm_put_interface_async [2022-12-13 20:32:24,351 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-12-13 20:32:24,351 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-12-13 20:32:24,352 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-12-13 20:32:24,354 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,354 WARN L623 FunctionHandler]: Unknown extern function tty_port_put [2022-12-13 20:32:24,356 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,356 WARN L623 FunctionHandler]: Unknown extern function tty_port_hangup [2022-12-13 20:32:24,358 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,358 WARN L623 FunctionHandler]: Unknown extern function tty_port_close [2022-12-13 20:32:24,360 WARN L623 FunctionHandler]: Unknown extern function usb_autopm_get_interface_async [2022-12-13 20:32:24,361 WARN L623 FunctionHandler]: Unknown extern function usb_anchor_urb [2022-12-13 20:32:24,364 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,375 WARN L623 FunctionHandler]: Unknown extern function mutex_lock_nested [2022-12-13 20:32:24,375 WARN L623 FunctionHandler]: Unknown extern function capable [2022-12-13 20:32:24,376 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 20:32:24,378 WARN L623 FunctionHandler]: Unknown extern function add_wait_queue [2022-12-13 20:32:24,378 WARN L623 FunctionHandler]: Unknown extern function __xchg_wrong_size [2022-12-13 20:32:24,379 WARN L623 FunctionHandler]: Unknown extern function schedule [2022-12-13 20:32:24,379 WARN L623 FunctionHandler]: Unknown extern function remove_wait_queue [2022-12-13 20:32:24,381 WARN L623 FunctionHandler]: Unknown extern function usb_autopm_get_interface [2022-12-13 20:32:24,381 WARN L623 FunctionHandler]: Unknown extern function usb_autopm_put_interface [2022-12-13 20:32:24,384 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 20:32:24,385 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,386 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 20:32:24,387 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 20:32:24,388 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 20:32:24,390 WARN L623 FunctionHandler]: Unknown extern function usb_ifnum_to_if [2022-12-13 20:32:24,390 WARN L623 FunctionHandler]: Unknown extern function usb_ifnum_to_if [2022-12-13 20:32:24,391 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 20:32:24,392 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,392 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 20:32:24,393 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 20:32:24,393 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 20:32:24,393 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 20:32:24,395 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,396 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,396 WARN L623 FunctionHandler]: Unknown extern function usb_ifnum_to_if [2022-12-13 20:32:24,396 WARN L623 FunctionHandler]: Unknown extern function usb_ifnum_to_if [2022-12-13 20:32:24,397 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,397 WARN L623 FunctionHandler]: Unknown extern function dev_warn [2022-12-13 20:32:24,398 WARN L623 FunctionHandler]: Unknown extern function usb_ifnum_to_if [2022-12-13 20:32:24,398 WARN L623 FunctionHandler]: Unknown extern function usb_ifnum_to_if [2022-12-13 20:32:24,399 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,400 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,401 WARN L623 FunctionHandler]: Unknown extern function dev_warn [2022-12-13 20:32:24,401 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 20:32:24,403 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,405 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,407 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,408 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,408 WARN L623 FunctionHandler]: Unknown extern function dev_err [2022-12-13 20:32:24,408 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 20:32:24,410 WARN L623 FunctionHandler]: Unknown extern function __init_work [2022-12-13 20:32:24,410 WARN L623 FunctionHandler]: Unknown extern function lockdep_init_map [2022-12-13 20:32:24,410 WARN L623 FunctionHandler]: Unknown extern function __init_waitqueue_head [2022-12-13 20:32:24,411 WARN L623 FunctionHandler]: Unknown extern function __raw_spin_lock_init [2022-12-13 20:32:24,411 WARN L623 FunctionHandler]: Unknown extern function __raw_spin_lock_init [2022-12-13 20:32:24,411 WARN L623 FunctionHandler]: Unknown extern function __mutex_init [2022-12-13 20:32:24,412 WARN L623 FunctionHandler]: Unknown extern function tty_port_init [2022-12-13 20:32:24,419 WARN L623 FunctionHandler]: Unknown extern function device_create_file [2022-12-13 20:32:24,420 WARN L623 FunctionHandler]: Unknown extern function device_create_file [2022-12-13 20:32:24,420 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 20:32:24,420 WARN L623 FunctionHandler]: Unknown extern function device_create_file [2022-12-13 20:32:24,421 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-12-13 20:32:24,421 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 20:32:24,422 WARN L623 FunctionHandler]: Unknown extern function _dev_info [2022-12-13 20:32:24,422 WARN L623 FunctionHandler]: Unknown extern function usb_driver_claim_interface [2022-12-13 20:32:24,422 WARN L623 FunctionHandler]: Unknown extern function usb_get_intf [2022-12-13 20:32:24,423 WARN L623 FunctionHandler]: Unknown extern function tty_port_register_device [2022-12-13 20:32:24,423 WARN L623 FunctionHandler]: Unknown extern function usb_clear_halt [2022-12-13 20:32:24,423 WARN L623 FunctionHandler]: Unknown extern function usb_clear_halt [2022-12-13 20:32:24,424 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-12-13 20:32:24,424 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-12-13 20:32:24,424 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 20:32:24,424 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-12-13 20:32:24,424 WARN L623 FunctionHandler]: Unknown extern function usb_free_urb [2022-12-13 20:32:24,425 WARN L623 FunctionHandler]: Unknown extern function usb_free_urb [2022-12-13 20:32:24,425 WARN L623 FunctionHandler]: Unknown extern function usb_free_urb [2022-12-13 20:32:24,425 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 20:32:24,425 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-12-13 20:32:24,428 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,428 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-12-13 20:32:24,428 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-12-13 20:32:24,428 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-12-13 20:32:24,430 WARN L623 FunctionHandler]: Unknown extern function __dynamic_dev_dbg [2022-12-13 20:32:24,430 WARN L623 FunctionHandler]: Unknown extern function mutex_lock_nested [2022-12-13 20:32:24,430 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-12-13 20:32:24,430 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-12-13 20:32:24,430 WARN L623 FunctionHandler]: Unknown extern function __wake_up [2022-12-13 20:32:24,431 WARN L623 FunctionHandler]: Unknown extern function device_remove_file [2022-12-13 20:32:24,431 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-12-13 20:32:24,431 WARN L623 FunctionHandler]: Unknown extern function tty_port_tty_get [2022-12-13 20:32:24,431 WARN L623 FunctionHandler]: Unknown extern function tty_vhangup [2022-12-13 20:32:24,431 WARN L623 FunctionHandler]: Unknown extern function tty_kref_put [2022-12-13 20:32:24,431 WARN L623 FunctionHandler]: Unknown extern function tty_unregister_device [2022-12-13 20:32:24,432 WARN L623 FunctionHandler]: Unknown extern function usb_free_urb [2022-12-13 20:32:24,432 WARN L623 FunctionHandler]: Unknown extern function usb_free_urb [2022-12-13 20:32:24,432 WARN L623 FunctionHandler]: Unknown extern function usb_free_urb [2022-12-13 20:32:24,432 WARN L623 FunctionHandler]: Unknown extern function usb_free_coherent [2022-12-13 20:32:24,433 WARN L623 FunctionHandler]: Unknown extern function usb_driver_release_interface [2022-12-13 20:32:24,433 WARN L623 FunctionHandler]: Unknown extern function tty_port_put [2022-12-13 20:32:24,435 WARN L623 FunctionHandler]: Unknown extern function usb_get_from_anchor [2022-12-13 20:32:24,436 WARN L623 FunctionHandler]: Unknown extern function tty_port_tty_hangup [2022-12-13 20:32:24,450 WARN L623 FunctionHandler]: Unknown extern function tty_set_operations [2022-12-13 20:32:24,450 WARN L623 FunctionHandler]: Unknown extern function tty_register_driver [2022-12-13 20:32:24,451 WARN L623 FunctionHandler]: Unknown extern function put_tty_driver [2022-12-13 20:32:24,451 WARN L623 FunctionHandler]: Unknown extern function tty_unregister_driver [2022-12-13 20:32:24,451 WARN L623 FunctionHandler]: Unknown extern function put_tty_driver [2022-12-13 20:32:24,452 WARN L623 FunctionHandler]: Unknown extern function printk [2022-12-13 20:32:24,452 WARN L623 FunctionHandler]: Unknown extern function tty_unregister_driver [2022-12-13 20:32:24,453 WARN L623 FunctionHandler]: Unknown extern function put_tty_driver [2022-12-13 20:32:24,458 WARN L623 FunctionHandler]: Unknown extern function ldv_initialize [2022-12-13 20:32:24,465 WARN L623 FunctionHandler]: Unknown extern function ldv_check_final_state [2022-12-13 20:32:24,467 WARN L623 FunctionHandler]: Unknown extern function queue_work_on [2022-12-13 20:32:24,467 WARN L623 FunctionHandler]: Unknown extern function queue_delayed_work_on [2022-12-13 20:32:24,468 WARN L623 FunctionHandler]: Unknown extern function queue_work_on [2022-12-13 20:32:24,468 WARN L623 FunctionHandler]: Unknown extern function flush_workqueue [2022-12-13 20:32:24,468 WARN L623 FunctionHandler]: Unknown extern function queue_delayed_work_on [2022-12-13 20:32:24,470 WARN L623 FunctionHandler]: Unknown extern function cancel_work_sync [2022-12-13 20:32:24,471 WARN L623 FunctionHandler]: Unknown extern function usb_register_driver [2022-12-13 20:32:24,471 WARN L623 FunctionHandler]: Unknown extern function usb_deregister [2022-12-13 20:32:24,472 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--usb--class--cdc-acm.ko-entry_point.cil.out.i[254896,254909] [2022-12-13 20:32:24,473 WARN L623 FunctionHandler]: Unknown extern function ldv_some_page [2022-12-13 20:32:24,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:32:24,623 INFO L208 MainTranslator]: Completed translation [2022-12-13 20:32:24,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:24 WrapperNode [2022-12-13 20:32:24,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 20:32:24,624 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 20:32:24,624 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 20:32:24,624 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 20:32:24,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:24" (1/1) ... [2022-12-13 20:32:24,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:24" (1/1) ... [2022-12-13 20:32:24,811 INFO L138 Inliner]: procedures = 286, calls = 3934, calls flagged for inlining = 140, calls inlined = 119, statements flattened = 8095 [2022-12-13 20:32:24,811 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 20:32:24,812 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 20:32:24,812 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 20:32:24,812 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 20:32:24,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:24" (1/1) ... [2022-12-13 20:32:24,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:24" (1/1) ... [2022-12-13 20:32:24,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:24" (1/1) ... [2022-12-13 20:32:24,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:24" (1/1) ... [2022-12-13 20:32:24,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:24" (1/1) ... [2022-12-13 20:32:24,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:24" (1/1) ... [2022-12-13 20:32:25,015 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:24" (1/1) ... [2022-12-13 20:32:25,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:24" (1/1) ... [2022-12-13 20:32:25,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 20:32:25,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 20:32:25,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 20:32:25,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 20:32:25,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:24" (1/1) ... [2022-12-13 20:32:25,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:32:25,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:32:25,080 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 20:32:25,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 20:32:25,140 INFO L130 BoogieDeclarations]: Found specification of procedure acm_disconnect [2022-12-13 20:32:25,140 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_disconnect [2022-12-13 20:32:25,140 INFO L130 BoogieDeclarations]: Found specification of procedure tty_port_tty_hangup [2022-12-13 20:32:25,140 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_port_tty_hangup [2022-12-13 20:32:25,140 INFO L130 BoogieDeclarations]: Found specification of procedure __cmpxchg_wrong_size [2022-12-13 20:32:25,140 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-12-13 20:32:25,140 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-12-13 20:32:25,140 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-12-13 20:32:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-12-13 20:32:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-12-13 20:32:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-12-13 20:32:25,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-12-13 20:32:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-12-13 20:32:25,141 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-12-13 20:32:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_int [2022-12-13 20:32:25,141 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_int [2022-12-13 20:32:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_cleanup [2022-12-13 20:32:25,141 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_cleanup [2022-12-13 20:32:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure debug_lockdep_rcu_enabled [2022-12-13 20:32:25,141 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_lockdep_rcu_enabled [2022-12-13 20:32:25,141 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-12-13 20:32:25,142 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-12-13 20:32:25,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2022-12-13 20:32:25,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2022-12-13 20:32:25,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-12-13 20:32:25,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-12-13 20:32:25,142 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_maxp [2022-12-13 20:32:25,142 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_maxp [2022-12-13 20:32:25,142 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface [2022-12-13 20:32:25,142 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface [2022-12-13 20:32:25,142 INFO L130 BoogieDeclarations]: Found specification of procedure acm_write_buffers_free [2022-12-13 20:32:25,142 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_write_buffers_free [2022-12-13 20:32:25,142 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-12-13 20:32:25,142 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-12-13 20:32:25,142 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-12-13 20:32:25,143 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-12-13 20:32:25,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-12-13 20:32:25,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-12-13 20:32:25,143 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2022-12-13 20:32:25,143 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2022-12-13 20:32:25,143 INFO L130 BoogieDeclarations]: Found specification of procedure device_create_file [2022-12-13 20:32:25,143 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create_file [2022-12-13 20:32:25,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-12-13 20:32:25,143 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-12-13 20:32:25,143 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 20:32:25,143 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 20:32:25,143 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-12-13 20:32:25,143 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-12-13 20:32:25,143 INFO L130 BoogieDeclarations]: Found specification of procedure tty_port_put [2022-12-13 20:32:25,144 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_port_put [2022-12-13 20:32:25,144 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_chars_in_buffer [2022-12-13 20:32:25,144 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_chars_in_buffer [2022-12-13 20:32:25,144 INFO L130 BoogieDeclarations]: Found specification of procedure acm_resume [2022-12-13 20:32:25,144 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_resume [2022-12-13 20:32:25,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 20:32:25,144 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-12-13 20:32:25,144 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-12-13 20:32:25,144 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-12-13 20:32:25,144 INFO L130 BoogieDeclarations]: Found specification of procedure acm_ctrl_msg [2022-12-13 20:32:25,144 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_ctrl_msg [2022-12-13 20:32:25,144 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-12-13 20:32:25,144 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-12-13 20:32:25,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 20:32:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_hangup [2022-12-13 20:32:25,145 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_hangup [2022-12-13 20:32:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ifnum_to_if [2022-12-13 20:32:25,145 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ifnum_to_if [2022-12-13 20:32:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock [2022-12-13 20:32:25,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock [2022-12-13 20:32:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-12-13 20:32:25,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-12-13 20:32:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-12-13 20:32:25,145 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-12-13 20:32:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure acm_softint [2022-12-13 20:32:25,145 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_softint [2022-12-13 20:32:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 20:32:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 20:32:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2022-12-13 20:32:25,146 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2022-12-13 20:32:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure put_tty_driver [2022-12-13 20:32:25,146 INFO L138 BoogieDeclarations]: Found implementation of procedure put_tty_driver [2022-12-13 20:32:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-12-13 20:32:25,146 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-12-13 20:32:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-12-13 20:32:25,146 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-12-13 20:32:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_tiocmget [2022-12-13 20:32:25,146 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_tiocmget [2022-12-13 20:32:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-12-13 20:32:25,146 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-12-13 20:32:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_set_termios [2022-12-13 20:32:25,146 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_set_termios [2022-12-13 20:32:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure usb_clear_halt [2022-12-13 20:32:25,147 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_clear_halt [2022-12-13 20:32:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_from_anchor [2022-12-13 20:32:25,147 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_from_anchor [2022-12-13 20:32:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-12-13 20:32:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_break_ctl [2022-12-13 20:32:25,147 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_break_ctl [2022-12-13 20:32:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-12-13 20:32:25,147 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-12-13 20:32:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-12-13 20:32:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface [2022-12-13 20:32:25,147 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface [2022-12-13 20:32:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 20:32:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure acm_start_wb [2022-12-13 20:32:25,147 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_start_wb [2022-12-13 20:32:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-12-13 20:32:25,148 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-12-13 20:32:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-12-13 20:32:25,148 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-12-13 20:32:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-12-13 20:32:25,148 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-12-13 20:32:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_throttle [2022-12-13 20:32:25,148 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_throttle [2022-12-13 20:32:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure acm_wb_is_avail [2022-12-13 20:32:25,148 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_wb_is_avail [2022-12-13 20:32:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-12-13 20:32:25,148 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-12-13 20:32:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-12-13 20:32:25,148 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-12-13 20:32:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-12-13 20:32:25,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-12-13 20:32:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_write_room [2022-12-13 20:32:25,149 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_write_room [2022-12-13 20:32:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure acm_submit_read_urb [2022-12-13 20:32:25,149 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_submit_read_urb [2022-12-13 20:32:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2022-12-13 20:32:25,149 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2022-12-13 20:32:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-12-13 20:32:25,149 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-12-13 20:32:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 20:32:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure acm_set_control [2022-12-13 20:32:25,149 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_set_control [2022-12-13 20:32:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-12-13 20:32:25,150 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-12-13 20:32:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure acm_write_done [2022-12-13 20:32:25,150 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_write_done [2022-12-13 20:32:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_ioctl [2022-12-13 20:32:25,150 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_ioctl [2022-12-13 20:32:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure acm_release_minor [2022-12-13 20:32:25,150 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_release_minor [2022-12-13 20:32:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2022-12-13 20:32:25,150 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2022-12-13 20:32:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-12-13 20:32:25,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-12-13 20:32:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure __read_once_size [2022-12-13 20:32:25,150 INFO L138 BoogieDeclarations]: Found implementation of procedure __read_once_size [2022-12-13 20:32:25,150 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface_async [2022-12-13 20:32:25,151 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface_async [2022-12-13 20:32:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_unthrottle [2022-12-13 20:32:25,151 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_unthrottle [2022-12-13 20:32:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-12-13 20:32:25,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-12-13 20:32:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 20:32:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-12-13 20:32:25,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-12-13 20:32:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 20:32:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 20:32:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-12-13 20:32:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2022-12-13 20:32:25,151 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2022-12-13 20:32:25,151 INFO L130 BoogieDeclarations]: Found specification of procedure acm_port_dtr_rts [2022-12-13 20:32:25,151 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_port_dtr_rts [2022-12-13 20:32:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-12-13 20:32:25,152 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-12-13 20:32:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-12-13 20:32:25,152 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-12-13 20:32:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure acm_read_buffers_free [2022-12-13 20:32:25,152 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_read_buffers_free [2022-12-13 20:32:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure acm_submit_read_urbs [2022-12-13 20:32:25,152 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_submit_read_urbs [2022-12-13 20:32:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_install [2022-12-13 20:32:25,152 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_install [2022-12-13 20:32:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure stop_data_traffic [2022-12-13 20:32:25,152 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_data_traffic [2022-12-13 20:32:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2022-12-13 20:32:25,152 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2022-12-13 20:32:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-12-13 20:32:25,153 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-12-13 20:32:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 20:32:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-12-13 20:32:25,153 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-12-13 20:32:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2022-12-13 20:32:25,153 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2022-12-13 20:32:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_tiocmset [2022-12-13 20:32:25,153 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_tiocmset [2022-12-13 20:32:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 20:32:25,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 20:32:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure tty_unregister_driver [2022-12-13 20:32:25,153 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_unregister_driver [2022-12-13 20:32:25,153 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-12-13 20:32:25,153 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-12-13 20:32:25,675 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 20:32:25,677 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 20:32:25,883 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-12-13 20:32:41,657 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 20:32:41,669 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 20:32:41,669 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 20:32:41,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:32:41 BoogieIcfgContainer [2022-12-13 20:32:41,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 20:32:41,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 20:32:41,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 20:32:41,675 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 20:32:41,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:32:22" (1/3) ... [2022-12-13 20:32:41,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269d9825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:32:41, skipping insertion in model container [2022-12-13 20:32:41,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:24" (2/3) ... [2022-12-13 20:32:41,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269d9825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:32:41, skipping insertion in model container [2022-12-13 20:32:41,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:32:41" (3/3) ... [2022-12-13 20:32:41,677 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-43_2a-drivers--usb--class--cdc-acm.ko-entry_point.cil.out.i [2022-12-13 20:32:41,690 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 20:32:41,690 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 20:32:41,745 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 20:32:41,750 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;@170f3c27, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 20:32:41,750 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 20:32:41,756 INFO L276 IsEmpty]: Start isEmpty. Operand has 1503 states, 1073 states have (on average 1.3410997204100652) internal successors, (1439), 1089 states have internal predecessors, (1439), 343 states have call successors, (343), 86 states have call predecessors, (343), 85 states have return successors, (334), 334 states have call predecessors, (334), 334 states have call successors, (334) [2022-12-13 20:32:41,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2022-12-13 20:32:41,782 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:32:41,782 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 20:32:41,783 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:32:41,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:41,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1204096760, now seen corresponding path program 1 times [2022-12-13 20:32:41,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:41,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223976520] [2022-12-13 20:32:41,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:41,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:32:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:32:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:32:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 20:32:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:32:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:32:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 20:32:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:32:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:32:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:32:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:32:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:32:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 20:32:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:32:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:32:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 20:32:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:32:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:32:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:32:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:32:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:32:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-12-13 20:32:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:32:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:32:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-12-13 20:32:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:32:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:32:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 20:32:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:32:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:32:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-12-13 20:32:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:32:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:32:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-12-13 20:32:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:32:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:32:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 20:32:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:32:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:32:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-12-13 20:32:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:32:43,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:32:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-12-13 20:32:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:32:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 20:32:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:32:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-12-13 20:32:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:32:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-12-13 20:32:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:32:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-12-13 20:32:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:32:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-12-13 20:32:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:32:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-12-13 20:32:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:32:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2022-12-13 20:32:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:32:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2022-12-13 20:32:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2022-12-13 20:32:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1526 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1526 trivial. 0 not checked. [2022-12-13 20:32:43,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:43,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223976520] [2022-12-13 20:32:43,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223976520] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:32:43,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:32:43,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 20:32:43,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028598680] [2022-12-13 20:32:43,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:32:43,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:32:43,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:43,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:32:43,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:32:43,767 INFO L87 Difference]: Start difference. First operand has 1503 states, 1073 states have (on average 1.3410997204100652) internal successors, (1439), 1089 states have internal predecessors, (1439), 343 states have call successors, (343), 86 states have call predecessors, (343), 85 states have return successors, (334), 334 states have call predecessors, (334), 334 states have call successors, (334) Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-12-13 20:32:48,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:32:50,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:32:56,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:32:58,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:33:00,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:33:02,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:33:04,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:33:06,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:33:09,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:33:09,091 INFO L93 Difference]: Finished difference Result 3949 states and 5681 transitions. [2022-12-13 20:33:09,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:33:09,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 352 [2022-12-13 20:33:09,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:33:09,115 INFO L225 Difference]: With dead ends: 3949 [2022-12-13 20:33:09,115 INFO L226 Difference]: Without dead ends: 2410 [2022-12-13 20:33:09,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-12-13 20:33:09,128 INFO L413 NwaCegarLoop]: 1977 mSDtfsCounter, 2185 mSDsluCounter, 3654 mSDsCounter, 0 mSdLazyCounter, 2198 mSolverCounterSat, 1200 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2306 SdHoareTripleChecker+Valid, 5631 SdHoareTripleChecker+Invalid, 3406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1200 IncrementalHoareTripleChecker+Valid, 2198 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:33:09,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2306 Valid, 5631 Invalid, 3406 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1200 Valid, 2198 Invalid, 8 Unknown, 0 Unchecked, 25.0s Time] [2022-12-13 20:33:09,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2022-12-13 20:33:09,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2313. [2022-12-13 20:33:09,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 1683 states have (on average 1.3398692810457515) internal successors, (2255), 1690 states have internal predecessors, (2255), 490 states have call successors, (490), 140 states have call predecessors, (490), 139 states have return successors, (489), 489 states have call predecessors, (489), 489 states have call successors, (489) [2022-12-13 20:33:09,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3234 transitions. [2022-12-13 20:33:09,258 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3234 transitions. Word has length 352 [2022-12-13 20:33:09,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:33:09,259 INFO L495 AbstractCegarLoop]: Abstraction has 2313 states and 3234 transitions. [2022-12-13 20:33:09,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-12-13 20:33:09,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3234 transitions. [2022-12-13 20:33:09,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2022-12-13 20:33:09,265 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:33:09,266 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 20:33:09,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 20:33:09,266 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:33:09,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:33:09,266 INFO L85 PathProgramCache]: Analyzing trace with hash -978835745, now seen corresponding path program 1 times [2022-12-13 20:33:09,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:33:09,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769960854] [2022-12-13 20:33:09,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:33:09,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:33:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:33:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 20:33:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 20:33:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:33:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 20:33:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 20:33:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:33:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-12-13 20:33:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-12-13 20:33:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 20:33:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-12-13 20:33:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-12-13 20:33:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 20:33:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-12-13 20:33:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-12-13 20:33:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 20:33:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-12-13 20:33:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-12-13 20:33:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-12-13 20:33:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-12-13 20:33:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-12-13 20:33:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2022-12-13 20:33:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2022-12-13 20:33:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2022-12-13 20:33:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2022-12-13 20:33:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-12-13 20:33:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:10,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1526 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1526 trivial. 0 not checked. [2022-12-13 20:33:10,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:33:10,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769960854] [2022-12-13 20:33:10,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769960854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:33:10,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:33:10,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 20:33:10,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592068496] [2022-12-13 20:33:10,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:33:10,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:33:10,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:33:10,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:33:10,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:33:10,629 INFO L87 Difference]: Start difference. First operand 2313 states and 3234 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-12-13 20:33:15,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:33:17,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:33:22,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:33:24,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:33:27,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:33:29,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:33:31,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:33:33,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:33:36,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:33:36,159 INFO L93 Difference]: Finished difference Result 6757 states and 9485 transitions. [2022-12-13 20:33:36,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:33:36,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 354 [2022-12-13 20:33:36,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:33:36,190 INFO L225 Difference]: With dead ends: 6757 [2022-12-13 20:33:36,191 INFO L226 Difference]: Without dead ends: 4497 [2022-12-13 20:33:36,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-12-13 20:33:36,198 INFO L413 NwaCegarLoop]: 1984 mSDtfsCounter, 2838 mSDsluCounter, 3517 mSDsCounter, 0 mSdLazyCounter, 2361 mSolverCounterSat, 1466 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3068 SdHoareTripleChecker+Valid, 5501 SdHoareTripleChecker+Invalid, 3835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1466 IncrementalHoareTripleChecker+Valid, 2361 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.2s IncrementalHoareTripleChecker+Time [2022-12-13 20:33:36,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3068 Valid, 5501 Invalid, 3835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1466 Valid, 2361 Invalid, 8 Unknown, 0 Unchecked, 25.2s Time] [2022-12-13 20:33:36,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4497 states. [2022-12-13 20:33:36,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4497 to 4310. [2022-12-13 20:33:36,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4310 states, 3151 states have (on average 1.3433830529990478) internal successors, (4233), 3167 states have internal predecessors, (4233), 887 states have call successors, (887), 272 states have call predecessors, (887), 271 states have return successors, (886), 884 states have call predecessors, (886), 886 states have call successors, (886) [2022-12-13 20:33:36,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4310 states to 4310 states and 6006 transitions. [2022-12-13 20:33:36,336 INFO L78 Accepts]: Start accepts. Automaton has 4310 states and 6006 transitions. Word has length 354 [2022-12-13 20:33:36,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:33:36,337 INFO L495 AbstractCegarLoop]: Abstraction has 4310 states and 6006 transitions. [2022-12-13 20:33:36,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-12-13 20:33:36,337 INFO L276 IsEmpty]: Start isEmpty. Operand 4310 states and 6006 transitions. [2022-12-13 20:33:36,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2022-12-13 20:33:36,341 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:33:36,341 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 20:33:36,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 20:33:36,341 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:33:36,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:33:36,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1532904605, now seen corresponding path program 1 times [2022-12-13 20:33:36,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:33:36,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605731333] [2022-12-13 20:33:36,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:33:36,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:33:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:33:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 20:33:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 20:33:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:33:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 20:33:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 20:33:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:33:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-12-13 20:33:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-12-13 20:33:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 20:33:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-12-13 20:33:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-12-13 20:33:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 20:33:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-12-13 20:33:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-12-13 20:33:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 20:33:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-12-13 20:33:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-12-13 20:33:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-12-13 20:33:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-12-13 20:33:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-12-13 20:33:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2022-12-13 20:33:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2022-12-13 20:33:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2022-12-13 20:33:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:37,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1526 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1526 trivial. 0 not checked. [2022-12-13 20:33:37,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:33:37,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605731333] [2022-12-13 20:33:37,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605731333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:33:37,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:33:37,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 20:33:37,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960731811] [2022-12-13 20:33:37,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:33:37,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 20:33:37,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:33:37,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 20:33:37,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:33:37,502 INFO L87 Difference]: Start difference. First operand 4310 states and 6006 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (30), 6 states have call predecessors, (30), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-12-13 20:33:42,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:33:50,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:33:52,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:33:52,884 INFO L93 Difference]: Finished difference Result 11208 states and 15630 transitions. [2022-12-13 20:33:52,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 20:33:52,885 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (30), 6 states have call predecessors, (30), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 354 [2022-12-13 20:33:52,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:33:52,928 INFO L225 Difference]: With dead ends: 11208 [2022-12-13 20:33:52,928 INFO L226 Difference]: Without dead ends: 6951 [2022-12-13 20:33:52,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-12-13 20:33:52,943 INFO L413 NwaCegarLoop]: 1625 mSDtfsCounter, 2814 mSDsluCounter, 3568 mSDsCounter, 0 mSdLazyCounter, 4390 mSolverCounterSat, 1889 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3080 SdHoareTripleChecker+Valid, 5193 SdHoareTripleChecker+Invalid, 6281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1889 IncrementalHoareTripleChecker+Valid, 4390 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:33:52,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3080 Valid, 5193 Invalid, 6281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1889 Valid, 4390 Invalid, 2 Unknown, 0 Unchecked, 15.0s Time] [2022-12-13 20:33:52,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6951 states. [2022-12-13 20:33:53,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6951 to 6666. [2022-12-13 20:33:53,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6666 states, 4861 states have (on average 1.3330590413495165) internal successors, (6480), 4885 states have internal predecessors, (6480), 1365 states have call successors, (1365), 440 states have call predecessors, (1365), 439 states have return successors, (1364), 1362 states have call predecessors, (1364), 1364 states have call successors, (1364) [2022-12-13 20:33:53,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6666 states to 6666 states and 9209 transitions. [2022-12-13 20:33:53,164 INFO L78 Accepts]: Start accepts. Automaton has 6666 states and 9209 transitions. Word has length 354 [2022-12-13 20:33:53,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:33:53,165 INFO L495 AbstractCegarLoop]: Abstraction has 6666 states and 9209 transitions. [2022-12-13 20:33:53,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (30), 6 states have call predecessors, (30), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-12-13 20:33:53,165 INFO L276 IsEmpty]: Start isEmpty. Operand 6666 states and 9209 transitions. [2022-12-13 20:33:53,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2022-12-13 20:33:53,170 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:33:53,170 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 20:33:53,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 20:33:53,171 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:33:53,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:33:53,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1063431697, now seen corresponding path program 1 times [2022-12-13 20:33:53,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:33:53,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887153181] [2022-12-13 20:33:53,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:33:53,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:33:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:33:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 20:33:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 20:33:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:33:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 20:33:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 20:33:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:33:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-12-13 20:33:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-12-13 20:33:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 20:33:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-12-13 20:33:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-12-13 20:33:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 20:33:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-12-13 20:33:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-12-13 20:33:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 20:33:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-12-13 20:33:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-12-13 20:33:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-12-13 20:33:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-12-13 20:33:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-12-13 20:33:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2022-12-13 20:33:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-12-13 20:33:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2022-12-13 20:33:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2022-12-13 20:33:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:33:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:33:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2022-12-13 20:33:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 397 [2022-12-13 20:33:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:33:54,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1725 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2022-12-13 20:33:54,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:33:54,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887153181] [2022-12-13 20:33:54,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887153181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:33:54,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:33:54,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 20:33:54,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827828393] [2022-12-13 20:33:54,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:33:54,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 20:33:54,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:33:54,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 20:33:54,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:33:54,822 INFO L87 Difference]: Start difference. First operand 6666 states and 9209 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (34), 6 states have call predecessors, (34), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-12-13 20:33:59,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:34:01,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:34:08,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:34:10,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:34:13,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:34:13,981 INFO L93 Difference]: Finished difference Result 16626 states and 23843 transitions. [2022-12-13 20:34:13,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:34:13,982 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (34), 6 states have call predecessors, (34), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 410 [2022-12-13 20:34:13,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:34:14,012 INFO L225 Difference]: With dead ends: 16626 [2022-12-13 20:34:14,012 INFO L226 Difference]: Without dead ends: 10027 [2022-12-13 20:34:14,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-12-13 20:34:14,025 INFO L413 NwaCegarLoop]: 2144 mSDtfsCounter, 3599 mSDsluCounter, 5524 mSDsCounter, 0 mSdLazyCounter, 3331 mSolverCounterSat, 1615 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3866 SdHoareTripleChecker+Valid, 7668 SdHoareTripleChecker+Invalid, 4950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1615 IncrementalHoareTripleChecker+Valid, 3331 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.7s IncrementalHoareTripleChecker+Time [2022-12-13 20:34:14,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3866 Valid, 7668 Invalid, 4950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1615 Valid, 3331 Invalid, 4 Unknown, 0 Unchecked, 18.7s Time] [2022-12-13 20:34:14,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10027 states. [2022-12-13 20:34:14,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10027 to 6612. [2022-12-13 20:34:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6612 states, 4821 states have (on average 1.333748185023854) internal successors, (6430), 4847 states have internal predecessors, (6430), 1357 states have call successors, (1357), 434 states have call predecessors, (1357), 433 states have return successors, (1356), 1352 states have call predecessors, (1356), 1356 states have call successors, (1356) [2022-12-13 20:34:14,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6612 states to 6612 states and 9143 transitions. [2022-12-13 20:34:14,307 INFO L78 Accepts]: Start accepts. Automaton has 6612 states and 9143 transitions. Word has length 410 [2022-12-13 20:34:14,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:34:14,308 INFO L495 AbstractCegarLoop]: Abstraction has 6612 states and 9143 transitions. [2022-12-13 20:34:14,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (34), 6 states have call predecessors, (34), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-12-13 20:34:14,308 INFO L276 IsEmpty]: Start isEmpty. Operand 6612 states and 9143 transitions. [2022-12-13 20:34:14,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2022-12-13 20:34:14,313 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:34:14,313 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 20:34:14,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 20:34:14,313 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:34:14,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:34:14,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1096691302, now seen corresponding path program 1 times [2022-12-13 20:34:14,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:34:14,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567348405] [2022-12-13 20:34:14,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:34:14,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:34:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:34:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 20:34:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 20:34:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:34:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 20:34:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 20:34:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:34:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-12-13 20:34:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-12-13 20:34:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 20:34:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-12-13 20:34:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-12-13 20:34:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 20:34:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-12-13 20:34:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-12-13 20:34:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 20:34:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-12-13 20:34:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-12-13 20:34:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-12-13 20:34:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-12-13 20:34:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-12-13 20:34:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2022-12-13 20:34:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-12-13 20:34:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2022-12-13 20:34:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-12-13 20:34:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2022-12-13 20:34:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2022-12-13 20:34:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 401 [2022-12-13 20:34:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2022-12-13 20:34:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2022-12-13 20:34:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2022-12-13 20:34:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:15,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1943 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2022-12-13 20:34:15,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:34:15,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567348405] [2022-12-13 20:34:15,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567348405] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:34:15,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:34:15,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 20:34:15,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889581161] [2022-12-13 20:34:15,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:34:15,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 20:34:15,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:34:15,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 20:34:15,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:34:15,567 INFO L87 Difference]: Start difference. First operand 6612 states and 9143 transitions. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (37), 6 states have call predecessors, (37), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-12-13 20:34:20,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:34:26,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:34:28,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:34:28,557 INFO L93 Difference]: Finished difference Result 13491 states and 18769 transitions. [2022-12-13 20:34:28,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:34:28,557 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (37), 6 states have call predecessors, (37), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 429 [2022-12-13 20:34:28,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:34:28,577 INFO L225 Difference]: With dead ends: 13491 [2022-12-13 20:34:28,577 INFO L226 Difference]: Without dead ends: 6938 [2022-12-13 20:34:28,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-13 20:34:28,587 INFO L413 NwaCegarLoop]: 1706 mSDtfsCounter, 925 mSDsluCounter, 5002 mSDsCounter, 0 mSdLazyCounter, 2558 mSolverCounterSat, 1079 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 6708 SdHoareTripleChecker+Invalid, 3639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1079 IncrementalHoareTripleChecker+Valid, 2558 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2022-12-13 20:34:28,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 6708 Invalid, 3639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1079 Valid, 2558 Invalid, 2 Unknown, 0 Unchecked, 12.7s Time] [2022-12-13 20:34:28,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6938 states. [2022-12-13 20:34:28,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6938 to 6612. [2022-12-13 20:34:28,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6612 states, 4821 states have (on average 1.3320887782617714) internal successors, (6422), 4847 states have internal predecessors, (6422), 1357 states have call successors, (1357), 434 states have call predecessors, (1357), 433 states have return successors, (1356), 1352 states have call predecessors, (1356), 1356 states have call successors, (1356) [2022-12-13 20:34:28,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6612 states to 6612 states and 9135 transitions. [2022-12-13 20:34:28,834 INFO L78 Accepts]: Start accepts. Automaton has 6612 states and 9135 transitions. Word has length 429 [2022-12-13 20:34:28,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:34:28,835 INFO L495 AbstractCegarLoop]: Abstraction has 6612 states and 9135 transitions. [2022-12-13 20:34:28,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (37), 6 states have call predecessors, (37), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-12-13 20:34:28,835 INFO L276 IsEmpty]: Start isEmpty. Operand 6612 states and 9135 transitions. [2022-12-13 20:34:28,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2022-12-13 20:34:28,846 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:34:28,846 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 20:34:28,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 20:34:28,847 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:34:28,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:34:28,847 INFO L85 PathProgramCache]: Analyzing trace with hash -183924160, now seen corresponding path program 1 times [2022-12-13 20:34:28,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:34:28,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041883889] [2022-12-13 20:34:28,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:34:28,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:34:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:34:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 20:34:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 20:34:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:34:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 20:34:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 20:34:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:34:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-12-13 20:34:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-12-13 20:34:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 20:34:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-12-13 20:34:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-12-13 20:34:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:29,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 20:34:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-12-13 20:34:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-12-13 20:34:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 20:34:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-12-13 20:34:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-12-13 20:34:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-12-13 20:34:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-12-13 20:34:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-12-13 20:34:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2022-12-13 20:34:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-12-13 20:34:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2022-12-13 20:34:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-12-13 20:34:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-12-13 20:34:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-12-13 20:34:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2022-12-13 20:34:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 409 [2022-12-13 20:34:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 415 [2022-12-13 20:34:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 421 [2022-12-13 20:34:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 427 [2022-12-13 20:34:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:30,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1943 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1943 trivial. 0 not checked. [2022-12-13 20:34:30,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:34:30,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041883889] [2022-12-13 20:34:30,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041883889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:34:30,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:34:30,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 20:34:30,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774756233] [2022-12-13 20:34:30,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:34:30,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 20:34:30,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:34:30,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 20:34:30,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:34:30,197 INFO L87 Difference]: Start difference. First operand 6612 states and 9135 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (38), 7 states have call predecessors, (38), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-12-13 20:34:36,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:34:38,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:34:44,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:34:46,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:34:49,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:34:49,406 INFO L93 Difference]: Finished difference Result 7195 states and 9971 transitions. [2022-12-13 20:34:49,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 20:34:49,406 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (38), 7 states have call predecessors, (38), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 437 [2022-12-13 20:34:49,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:34:49,431 INFO L225 Difference]: With dead ends: 7195 [2022-12-13 20:34:49,431 INFO L226 Difference]: Without dead ends: 7192 [2022-12-13 20:34:49,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-12-13 20:34:49,434 INFO L413 NwaCegarLoop]: 1708 mSDtfsCounter, 2312 mSDsluCounter, 3979 mSDsCounter, 0 mSdLazyCounter, 2509 mSolverCounterSat, 882 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2537 SdHoareTripleChecker+Valid, 5687 SdHoareTripleChecker+Invalid, 3395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 882 IncrementalHoareTripleChecker+Valid, 2509 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.9s IncrementalHoareTripleChecker+Time [2022-12-13 20:34:49,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2537 Valid, 5687 Invalid, 3395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [882 Valid, 2509 Invalid, 4 Unknown, 0 Unchecked, 18.9s Time] [2022-12-13 20:34:49,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7192 states. [2022-12-13 20:34:49,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7192 to 6836. [2022-12-13 20:34:49,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6836 states, 4974 states have (on average 1.3271009248090069) internal successors, (6601), 5000 states have internal predecessors, (6601), 1384 states have call successors, (1384), 478 states have call predecessors, (1384), 477 states have return successors, (1383), 1379 states have call predecessors, (1383), 1383 states have call successors, (1383) [2022-12-13 20:34:49,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 9368 transitions. [2022-12-13 20:34:49,725 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 9368 transitions. Word has length 437 [2022-12-13 20:34:49,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:34:49,725 INFO L495 AbstractCegarLoop]: Abstraction has 6836 states and 9368 transitions. [2022-12-13 20:34:49,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (38), 7 states have call predecessors, (38), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-12-13 20:34:49,726 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 9368 transitions. [2022-12-13 20:34:49,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2022-12-13 20:34:49,734 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:34:49,734 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 20:34:49,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 20:34:49,735 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:34:49,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:34:49,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1967151106, now seen corresponding path program 1 times [2022-12-13 20:34:49,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:34:49,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018428805] [2022-12-13 20:34:49,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:34:49,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:34:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:34:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 20:34:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 20:34:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:34:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 20:34:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 20:34:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:34:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-12-13 20:34:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-12-13 20:34:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 20:34:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-12-13 20:34:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-12-13 20:34:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:50,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 20:34:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-12-13 20:34:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-12-13 20:34:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 20:34:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-12-13 20:34:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-12-13 20:34:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-12-13 20:34:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-12-13 20:34:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-12-13 20:34:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2022-12-13 20:34:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-12-13 20:34:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2022-12-13 20:34:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-12-13 20:34:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-12-13 20:34:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-12-13 20:34:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2022-12-13 20:34:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:34:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:34:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 408 [2022-12-13 20:34:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 420 [2022-12-13 20:34:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:34:51,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1941 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2022-12-13 20:34:51,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:34:51,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018428805] [2022-12-13 20:34:51,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018428805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:34:51,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:34:51,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 20:34:51,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905008565] [2022-12-13 20:34:51,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:34:51,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 20:34:51,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:34:51,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 20:34:51,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:34:51,182 INFO L87 Difference]: Start difference. First operand 6836 states and 9368 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (37), 7 states have call predecessors, (37), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2022-12-13 20:34:57,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:35:06,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:35:08,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:35:14,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:35:14,142 INFO L93 Difference]: Finished difference Result 18191 states and 25063 transitions. [2022-12-13 20:35:14,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 20:35:14,142 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (37), 7 states have call predecessors, (37), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 437 [2022-12-13 20:35:14,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:35:14,168 INFO L225 Difference]: With dead ends: 18191 [2022-12-13 20:35:14,168 INFO L226 Difference]: Without dead ends: 11422 [2022-12-13 20:35:14,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2022-12-13 20:35:14,187 INFO L413 NwaCegarLoop]: 1941 mSDtfsCounter, 4019 mSDsluCounter, 5269 mSDsCounter, 0 mSdLazyCounter, 5805 mSolverCounterSat, 2547 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4287 SdHoareTripleChecker+Valid, 7210 SdHoareTripleChecker+Invalid, 8355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2547 IncrementalHoareTripleChecker+Valid, 5805 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time [2022-12-13 20:35:14,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4287 Valid, 7210 Invalid, 8355 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2547 Valid, 5805 Invalid, 3 Unknown, 0 Unchecked, 22.2s Time] [2022-12-13 20:35:14,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11422 states. [2022-12-13 20:35:14,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11422 to 10707. [2022-12-13 20:35:14,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10707 states, 7856 states have (on average 1.3242107942973524) internal successors, (10403), 7896 states have internal predecessors, (10403), 2098 states have call successors, (2098), 753 states have call predecessors, (2098), 752 states have return successors, (2097), 2091 states have call predecessors, (2097), 2097 states have call successors, (2097) [2022-12-13 20:35:14,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10707 states to 10707 states and 14598 transitions. [2022-12-13 20:35:14,605 INFO L78 Accepts]: Start accepts. Automaton has 10707 states and 14598 transitions. Word has length 437 [2022-12-13 20:35:14,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:35:14,606 INFO L495 AbstractCegarLoop]: Abstraction has 10707 states and 14598 transitions. [2022-12-13 20:35:14,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (37), 7 states have call predecessors, (37), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2022-12-13 20:35:14,606 INFO L276 IsEmpty]: Start isEmpty. Operand 10707 states and 14598 transitions. [2022-12-13 20:35:14,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2022-12-13 20:35:14,614 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:35:14,614 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 20:35:14,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 20:35:14,614 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:35:14,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:35:14,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1229049773, now seen corresponding path program 1 times [2022-12-13 20:35:14,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:35:14,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816395383] [2022-12-13 20:35:14,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:35:14,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:35:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:35:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 20:35:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 20:35:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:35:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 20:35:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:15,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 20:35:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:35:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-12-13 20:35:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-12-13 20:35:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 20:35:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-12-13 20:35:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-12-13 20:35:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 20:35:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-12-13 20:35:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-12-13 20:35:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 20:35:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-12-13 20:35:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-12-13 20:35:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-12-13 20:35:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-12-13 20:35:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-12-13 20:35:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2022-12-13 20:35:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-12-13 20:35:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2022-12-13 20:35:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2022-12-13 20:35:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2022-12-13 20:35:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2022-12-13 20:35:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 397 [2022-12-13 20:35:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 426 [2022-12-13 20:35:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 432 [2022-12-13 20:35:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 445 [2022-12-13 20:35:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:15,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2160 trivial. 0 not checked. [2022-12-13 20:35:15,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:35:15,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816395383] [2022-12-13 20:35:15,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816395383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:35:15,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:35:15,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 20:35:15,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641518833] [2022-12-13 20:35:15,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:35:15,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 20:35:15,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:35:15,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 20:35:15,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:35:15,755 INFO L87 Difference]: Start difference. First operand 10707 states and 14598 transitions. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (39), 7 states have call predecessors, (39), 1 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2022-12-13 20:35:22,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:35:24,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:35:33,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:35:35,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:35:37,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:35:42,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:35:44,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:35:44,853 INFO L93 Difference]: Finished difference Result 25857 states and 35295 transitions. [2022-12-13 20:35:44,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 20:35:44,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (39), 7 states have call predecessors, (39), 1 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) Word has length 456 [2022-12-13 20:35:44,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:35:44,888 INFO L225 Difference]: With dead ends: 25857 [2022-12-13 20:35:44,888 INFO L226 Difference]: Without dead ends: 15217 [2022-12-13 20:35:44,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2022-12-13 20:35:44,903 INFO L413 NwaCegarLoop]: 2025 mSDtfsCounter, 2960 mSDsluCounter, 5484 mSDsCounter, 0 mSdLazyCounter, 5841 mSolverCounterSat, 1787 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3238 SdHoareTripleChecker+Valid, 7509 SdHoareTripleChecker+Invalid, 7634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1787 IncrementalHoareTripleChecker+Valid, 5841 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.3s IncrementalHoareTripleChecker+Time [2022-12-13 20:35:44,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3238 Valid, 7509 Invalid, 7634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1787 Valid, 5841 Invalid, 6 Unknown, 0 Unchecked, 28.3s Time] [2022-12-13 20:35:44,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15217 states. [2022-12-13 20:35:45,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15217 to 14299. [2022-12-13 20:35:45,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14299 states, 10589 states have (on average 1.3257153650014166) internal successors, (14038), 10636 states have internal predecessors, (14038), 2672 states have call successors, (2672), 1038 states have call predecessors, (2672), 1037 states have return successors, (2671), 2664 states have call predecessors, (2671), 2671 states have call successors, (2671) [2022-12-13 20:35:45,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14299 states to 14299 states and 19381 transitions. [2022-12-13 20:35:45,414 INFO L78 Accepts]: Start accepts. Automaton has 14299 states and 19381 transitions. Word has length 456 [2022-12-13 20:35:45,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:35:45,415 INFO L495 AbstractCegarLoop]: Abstraction has 14299 states and 19381 transitions. [2022-12-13 20:35:45,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (39), 7 states have call predecessors, (39), 1 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2022-12-13 20:35:45,415 INFO L276 IsEmpty]: Start isEmpty. Operand 14299 states and 19381 transitions. [2022-12-13 20:35:45,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2022-12-13 20:35:45,426 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:35:45,426 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 20:35:45,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 20:35:45,426 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:35:45,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:35:45,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1023667841, now seen corresponding path program 1 times [2022-12-13 20:35:45,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:35:45,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362213990] [2022-12-13 20:35:45,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:35:45,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:35:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:35:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 20:35:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 20:35:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:35:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 20:35:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 20:35:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:35:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-12-13 20:35:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-12-13 20:35:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 20:35:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-12-13 20:35:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-12-13 20:35:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 20:35:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-12-13 20:35:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-12-13 20:35:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 20:35:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-12-13 20:35:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:47,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-12-13 20:35:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:48,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:48,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-12-13 20:35:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:48,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:48,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-12-13 20:35:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:48,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:48,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-12-13 20:35:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:48,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:48,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2022-12-13 20:35:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:48,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:48,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-12-13 20:35:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:48,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2022-12-13 20:35:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:48,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:48,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-12-13 20:35:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:48,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-12-13 20:35:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:48,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-12-13 20:35:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:48,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:48,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:48,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2022-12-13 20:35:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:48,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:35:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:48,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:35:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:48,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2022-12-13 20:35:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:48,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 432 [2022-12-13 20:35:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:48,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 444 [2022-12-13 20:35:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:35:48,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1943 trivial. 0 not checked. [2022-12-13 20:35:48,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:35:48,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362213990] [2022-12-13 20:35:48,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362213990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:35:48,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:35:48,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 20:35:48,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317737158] [2022-12-13 20:35:48,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:35:48,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 20:35:48,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:35:48,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 20:35:48,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 20:35:48,148 INFO L87 Difference]: Start difference. First operand 14299 states and 19381 transitions. Second operand has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 4 states have internal predecessors, (128), 2 states have call successors, (38), 7 states have call predecessors, (38), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-12-13 20:35:49,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:35:54,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:35:56,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:35:58,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:36:05,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:36:07,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:36:12,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:36:12,412 INFO L93 Difference]: Finished difference Result 29582 states and 40211 transitions. [2022-12-13 20:36:12,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 20:36:12,414 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 4 states have internal predecessors, (128), 2 states have call successors, (38), 7 states have call predecessors, (38), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 461 [2022-12-13 20:36:12,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:36:12,464 INFO L225 Difference]: With dead ends: 29582 [2022-12-13 20:36:12,464 INFO L226 Difference]: Without dead ends: 15313 [2022-12-13 20:36:12,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2022-12-13 20:36:12,498 INFO L413 NwaCegarLoop]: 1379 mSDtfsCounter, 1517 mSDsluCounter, 5395 mSDsCounter, 0 mSdLazyCounter, 5098 mSolverCounterSat, 1151 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1616 SdHoareTripleChecker+Valid, 6774 SdHoareTripleChecker+Invalid, 6254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1151 IncrementalHoareTripleChecker+Valid, 5098 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.2s IncrementalHoareTripleChecker+Time [2022-12-13 20:36:12,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1616 Valid, 6774 Invalid, 6254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1151 Valid, 5098 Invalid, 5 Unknown, 0 Unchecked, 23.2s Time] [2022-12-13 20:36:12,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15313 states. [2022-12-13 20:36:13,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15313 to 14399. [2022-12-13 20:36:13,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14399 states, 10670 states have (on average 1.3246485473289598) internal successors, (14134), 10718 states have internal predecessors, (14134), 2685 states have call successors, (2685), 1044 states have call predecessors, (2685), 1043 states have return successors, (2684), 2676 states have call predecessors, (2684), 2684 states have call successors, (2684) [2022-12-13 20:36:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14399 states to 14399 states and 19503 transitions. [2022-12-13 20:36:13,085 INFO L78 Accepts]: Start accepts. Automaton has 14399 states and 19503 transitions. Word has length 461 [2022-12-13 20:36:13,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:36:13,086 INFO L495 AbstractCegarLoop]: Abstraction has 14399 states and 19503 transitions. [2022-12-13 20:36:13,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 4 states have internal predecessors, (128), 2 states have call successors, (38), 7 states have call predecessors, (38), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-12-13 20:36:13,086 INFO L276 IsEmpty]: Start isEmpty. Operand 14399 states and 19503 transitions. [2022-12-13 20:36:13,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2022-12-13 20:36:13,096 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:36:13,096 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 20:36:13,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 20:36:13,097 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:36:13,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:36:13,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1356310979, now seen corresponding path program 1 times [2022-12-13 20:36:13,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:36:13,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911428274] [2022-12-13 20:36:13,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:36:13,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:36:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:36:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 20:36:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 20:36:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:36:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 20:36:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 20:36:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:15,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:36:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-12-13 20:36:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-12-13 20:36:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 20:36:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-12-13 20:36:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-12-13 20:36:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 20:36:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-12-13 20:36:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-12-13 20:36:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 20:36:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-12-13 20:36:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-12-13 20:36:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-12-13 20:36:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-12-13 20:36:15,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-12-13 20:36:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2022-12-13 20:36:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-12-13 20:36:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2022-12-13 20:36:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:15,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:16,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-12-13 20:36:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:16,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-12-13 20:36:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:16,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-12-13 20:36:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:16,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:16,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:16,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2022-12-13 20:36:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:16,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:16,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:16,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2022-12-13 20:36:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:16,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 432 [2022-12-13 20:36:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:16,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 444 [2022-12-13 20:36:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:16,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 1941 trivial. 0 not checked. [2022-12-13 20:36:16,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:36:16,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911428274] [2022-12-13 20:36:16,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911428274] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:36:16,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693437742] [2022-12-13 20:36:16,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:36:16,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:36:16,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:36:16,069 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:36:16,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 20:36:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:17,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 10798 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 20:36:18,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:36:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 406 proven. 0 refuted. 0 times theorem prover too weak. 1547 trivial. 0 not checked. [2022-12-13 20:36:18,102 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:36:18,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693437742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:36:18,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:36:18,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2022-12-13 20:36:18,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591715560] [2022-12-13 20:36:18,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:36:18,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:36:18,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:36:18,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:36:18,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-12-13 20:36:18,105 INFO L87 Difference]: Start difference. First operand 14399 states and 19503 transitions. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 3 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2022-12-13 20:36:19,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:36:19,574 INFO L93 Difference]: Finished difference Result 28569 states and 38705 transitions. [2022-12-13 20:36:19,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:36:19,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 3 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) Word has length 461 [2022-12-13 20:36:19,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:36:19,607 INFO L225 Difference]: With dead ends: 28569 [2022-12-13 20:36:19,607 INFO L226 Difference]: Without dead ends: 14281 [2022-12-13 20:36:19,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2022-12-13 20:36:19,631 INFO L413 NwaCegarLoop]: 2071 mSDtfsCounter, 5 mSDsluCounter, 6198 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 8269 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:36:19,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 8269 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-13 20:36:19,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14281 states. [2022-12-13 20:36:20,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14281 to 14197. [2022-12-13 20:36:20,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14197 states, 10512 states have (on average 1.3276255707762556) internal successors, (13956), 10570 states have internal predecessors, (13956), 2657 states have call successors, (2657), 1028 states have call predecessors, (2657), 1027 states have return successors, (2656), 2638 states have call predecessors, (2656), 2656 states have call successors, (2656) [2022-12-13 20:36:20,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14197 states to 14197 states and 19269 transitions. [2022-12-13 20:36:20,094 INFO L78 Accepts]: Start accepts. Automaton has 14197 states and 19269 transitions. Word has length 461 [2022-12-13 20:36:20,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:36:20,094 INFO L495 AbstractCegarLoop]: Abstraction has 14197 states and 19269 transitions. [2022-12-13 20:36:20,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 3 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2022-12-13 20:36:20,094 INFO L276 IsEmpty]: Start isEmpty. Operand 14197 states and 19269 transitions. [2022-12-13 20:36:20,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2022-12-13 20:36:20,103 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:36:20,103 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 20:36:20,129 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 20:36:20,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:36:20,305 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:36:20,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:36:20,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2117387308, now seen corresponding path program 1 times [2022-12-13 20:36:20,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:36:20,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711132333] [2022-12-13 20:36:20,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:36:20,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:36:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:36:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 20:36:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 20:36:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:36:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 20:36:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 20:36:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:36:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-12-13 20:36:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-12-13 20:36:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 20:36:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-12-13 20:36:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-12-13 20:36:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 20:36:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-12-13 20:36:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-12-13 20:36:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 20:36:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-12-13 20:36:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-12-13 20:36:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-12-13 20:36:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-12-13 20:36:21,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-12-13 20:36:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2022-12-13 20:36:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-12-13 20:36:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2022-12-13 20:36:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2022-12-13 20:36:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2022-12-13 20:36:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2022-12-13 20:36:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 397 [2022-12-13 20:36:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:36:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 420 [2022-12-13 20:36:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 440 [2022-12-13 20:36:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 446 [2022-12-13 20:36:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:36:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2022-12-13 20:36:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:36:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2022-12-13 20:36:21,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:36:21,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711132333] [2022-12-13 20:36:21,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711132333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:36:21,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:36:21,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 20:36:21,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458445530] [2022-12-13 20:36:21,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:36:21,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 20:36:21,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:36:21,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 20:36:21,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 20:36:21,483 INFO L87 Difference]: Start difference. First operand 14197 states and 19269 transitions. Second operand has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (40), 7 states have call predecessors, (40), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2022-12-13 20:36:29,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:36:31,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:36:39,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:36:41,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:36:50,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:36:52,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:36:55,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:36:57,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:37:05,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:37:05,121 INFO L93 Difference]: Finished difference Result 35451 states and 48415 transitions. [2022-12-13 20:37:05,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 20:37:05,122 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (40), 7 states have call predecessors, (40), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 470 [2022-12-13 20:37:05,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:37:05,166 INFO L225 Difference]: With dead ends: 35451 [2022-12-13 20:37:05,166 INFO L226 Difference]: Without dead ends: 21421 [2022-12-13 20:37:05,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2022-12-13 20:37:05,186 INFO L413 NwaCegarLoop]: 2469 mSDtfsCounter, 3024 mSDsluCounter, 10179 mSDsCounter, 0 mSdLazyCounter, 9563 mSolverCounterSat, 1684 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3212 SdHoareTripleChecker+Valid, 12648 SdHoareTripleChecker+Invalid, 11255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1684 IncrementalHoareTripleChecker+Valid, 9563 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.5s IncrementalHoareTripleChecker+Time [2022-12-13 20:37:05,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3212 Valid, 12648 Invalid, 11255 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1684 Valid, 9563 Invalid, 8 Unknown, 0 Unchecked, 42.5s Time] [2022-12-13 20:37:05,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21421 states. [2022-12-13 20:37:05,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21421 to 14209. [2022-12-13 20:37:05,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14209 states, 10524 states have (on average 1.3272519954389965) internal successors, (13968), 10582 states have internal predecessors, (13968), 2657 states have call successors, (2657), 1028 states have call predecessors, (2657), 1027 states have return successors, (2656), 2638 states have call predecessors, (2656), 2656 states have call successors, (2656) [2022-12-13 20:37:05,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14209 states to 14209 states and 19281 transitions. [2022-12-13 20:37:05,746 INFO L78 Accepts]: Start accepts. Automaton has 14209 states and 19281 transitions. Word has length 470 [2022-12-13 20:37:05,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:37:05,747 INFO L495 AbstractCegarLoop]: Abstraction has 14209 states and 19281 transitions. [2022-12-13 20:37:05,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (40), 7 states have call predecessors, (40), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2022-12-13 20:37:05,747 INFO L276 IsEmpty]: Start isEmpty. Operand 14209 states and 19281 transitions. [2022-12-13 20:37:05,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-12-13 20:37:05,754 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:37:05,755 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 20:37:05,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 20:37:05,755 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:37:05,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:37:05,755 INFO L85 PathProgramCache]: Analyzing trace with hash 531647309, now seen corresponding path program 1 times [2022-12-13 20:37:05,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:37:05,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382666020] [2022-12-13 20:37:05,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:37:05,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:37:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:37:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 20:37:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 20:37:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:37:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 20:37:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 20:37:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:37:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-12-13 20:37:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-12-13 20:37:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 20:37:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-12-13 20:37:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-12-13 20:37:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 20:37:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-12-13 20:37:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-12-13 20:37:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 20:37:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-12-13 20:37:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-12-13 20:37:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-12-13 20:37:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-12-13 20:37:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-12-13 20:37:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2022-12-13 20:37:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-12-13 20:37:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2022-12-13 20:37:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2022-12-13 20:37:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2022-12-13 20:37:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2022-12-13 20:37:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 397 [2022-12-13 20:37:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-12-13 20:37:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 447 [2022-12-13 20:37:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2022-12-13 20:37:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:08,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2177 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2165 trivial. 0 not checked. [2022-12-13 20:37:08,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:37:08,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382666020] [2022-12-13 20:37:08,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382666020] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:37:08,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28417876] [2022-12-13 20:37:08,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:37:08,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:37:08,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:37:08,457 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:37:08,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 20:37:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:10,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 10927 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 20:37:10,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:37:11,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2177 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2165 trivial. 0 not checked. [2022-12-13 20:37:11,207 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:37:11,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28417876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:37:11,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:37:11,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 22 [2022-12-13 20:37:11,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119454371] [2022-12-13 20:37:11,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:37:11,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 20:37:11,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:37:11,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 20:37:11,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2022-12-13 20:37:11,210 INFO L87 Difference]: Start difference. First operand 14209 states and 19281 transitions. Second operand has 11 states, 10 states have (on average 13.2) internal successors, (132), 8 states have internal predecessors, (132), 3 states have call successors, (38), 2 states have call predecessors, (38), 5 states have return successors, (35), 5 states have call predecessors, (35), 3 states have call successors, (35) [2022-12-13 20:37:13,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:37:13,121 INFO L93 Difference]: Finished difference Result 30244 states and 41357 transitions. [2022-12-13 20:37:13,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 20:37:13,122 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 13.2) internal successors, (132), 8 states have internal predecessors, (132), 3 states have call successors, (38), 2 states have call predecessors, (38), 5 states have return successors, (35), 5 states have call predecessors, (35), 3 states have call successors, (35) Word has length 476 [2022-12-13 20:37:13,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:37:13,156 INFO L225 Difference]: With dead ends: 30244 [2022-12-13 20:37:13,156 INFO L226 Difference]: Without dead ends: 16202 [2022-12-13 20:37:13,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 613 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2022-12-13 20:37:13,179 INFO L413 NwaCegarLoop]: 2820 mSDtfsCounter, 1689 mSDsluCounter, 23078 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1853 SdHoareTripleChecker+Valid, 25898 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 20:37:13,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1853 Valid, 25898 Invalid, 858 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [368 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 20:37:13,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16202 states. [2022-12-13 20:37:13,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16202 to 14209. [2022-12-13 20:37:13,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14209 states, 10524 states have (on average 1.3266818700114025) internal successors, (13962), 10582 states have internal predecessors, (13962), 2657 states have call successors, (2657), 1028 states have call predecessors, (2657), 1027 states have return successors, (2656), 2638 states have call predecessors, (2656), 2656 states have call successors, (2656) [2022-12-13 20:37:13,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14209 states to 14209 states and 19275 transitions. [2022-12-13 20:37:13,749 INFO L78 Accepts]: Start accepts. Automaton has 14209 states and 19275 transitions. Word has length 476 [2022-12-13 20:37:13,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:37:13,750 INFO L495 AbstractCegarLoop]: Abstraction has 14209 states and 19275 transitions. [2022-12-13 20:37:13,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 13.2) internal successors, (132), 8 states have internal predecessors, (132), 3 states have call successors, (38), 2 states have call predecessors, (38), 5 states have return successors, (35), 5 states have call predecessors, (35), 3 states have call successors, (35) [2022-12-13 20:37:13,750 INFO L276 IsEmpty]: Start isEmpty. Operand 14209 states and 19275 transitions. [2022-12-13 20:37:13,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2022-12-13 20:37:13,757 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:37:13,757 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 20:37:13,785 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 20:37:13,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 20:37:13,960 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:37:13,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:37:13,961 INFO L85 PathProgramCache]: Analyzing trace with hash -365745969, now seen corresponding path program 1 times [2022-12-13 20:37:13,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:37:13,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525448580] [2022-12-13 20:37:13,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:37:13,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:37:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:37:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 20:37:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 20:37:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:37:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 20:37:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 20:37:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:37:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-12-13 20:37:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-12-13 20:37:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 20:37:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-12-13 20:37:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-12-13 20:37:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 20:37:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-12-13 20:37:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-12-13 20:37:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 20:37:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-12-13 20:37:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-12-13 20:37:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-12-13 20:37:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-12-13 20:37:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-12-13 20:37:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2022-12-13 20:37:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-12-13 20:37:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2022-12-13 20:37:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2022-12-13 20:37:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2022-12-13 20:37:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2022-12-13 20:37:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 397 [2022-12-13 20:37:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-12-13 20:37:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 447 [2022-12-13 20:37:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2022-12-13 20:37:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:16,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2177 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2165 trivial. 0 not checked. [2022-12-13 20:37:16,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:37:16,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525448580] [2022-12-13 20:37:16,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525448580] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:37:16,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82101330] [2022-12-13 20:37:16,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:37:16,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:37:16,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:37:16,757 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:37:16,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 20:37:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:19,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 10928 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-13 20:37:19,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:37:19,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2177 backedges. 602 proven. 0 refuted. 0 times theorem prover too weak. 1575 trivial. 0 not checked. [2022-12-13 20:37:19,896 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:37:19,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82101330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:37:19,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:37:19,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 13 [2022-12-13 20:37:19,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861932498] [2022-12-13 20:37:19,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:37:19,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 20:37:19,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:37:19,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 20:37:19,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-12-13 20:37:19,897 INFO L87 Difference]: Start difference. First operand 14209 states and 19275 transitions. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 7 states have internal predecessors, (142), 3 states have call successors, (40), 2 states have call predecessors, (40), 3 states have return successors, (37), 4 states have call predecessors, (37), 3 states have call successors, (37) [2022-12-13 20:37:22,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:37:22,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:37:22,842 INFO L93 Difference]: Finished difference Result 28388 states and 38566 transitions. [2022-12-13 20:37:22,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 20:37:22,842 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 7 states have internal predecessors, (142), 3 states have call successors, (40), 2 states have call predecessors, (40), 3 states have return successors, (37), 4 states have call predecessors, (37), 3 states have call successors, (37) Word has length 476 [2022-12-13 20:37:22,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:37:22,878 INFO L225 Difference]: With dead ends: 28388 [2022-12-13 20:37:22,879 INFO L226 Difference]: Without dead ends: 14258 [2022-12-13 20:37:22,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 619 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-12-13 20:37:22,902 INFO L413 NwaCegarLoop]: 2070 mSDtfsCounter, 250 mSDsluCounter, 12299 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 14369 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-12-13 20:37:22,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 14369 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-12-13 20:37:22,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14258 states. [2022-12-13 20:37:23,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14258 to 14243. [2022-12-13 20:37:23,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14243 states, 10541 states have (on average 1.325965278436581) internal successors, (13977), 10616 states have internal predecessors, (13977), 2657 states have call successors, (2657), 1028 states have call predecessors, (2657), 1044 states have return successors, (2745), 2638 states have call predecessors, (2745), 2656 states have call successors, (2745) [2022-12-13 20:37:23,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14243 states to 14243 states and 19379 transitions. [2022-12-13 20:37:23,510 INFO L78 Accepts]: Start accepts. Automaton has 14243 states and 19379 transitions. Word has length 476 [2022-12-13 20:37:23,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:37:23,510 INFO L495 AbstractCegarLoop]: Abstraction has 14243 states and 19379 transitions. [2022-12-13 20:37:23,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 7 states have internal predecessors, (142), 3 states have call successors, (40), 2 states have call predecessors, (40), 3 states have return successors, (37), 4 states have call predecessors, (37), 3 states have call successors, (37) [2022-12-13 20:37:23,511 INFO L276 IsEmpty]: Start isEmpty. Operand 14243 states and 19379 transitions. [2022-12-13 20:37:23,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2022-12-13 20:37:23,518 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:37:23,518 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 20:37:23,547 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 20:37:23,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 20:37:23,720 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:37:23,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:37:23,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1160585382, now seen corresponding path program 1 times [2022-12-13 20:37:23,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:37:23,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888960996] [2022-12-13 20:37:23,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:37:23,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:37:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:37:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 20:37:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 20:37:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:37:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 20:37:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 20:37:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:37:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-12-13 20:37:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-12-13 20:37:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 20:37:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-12-13 20:37:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-12-13 20:37:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 20:37:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-12-13 20:37:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-12-13 20:37:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-12-13 20:37:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-12-13 20:37:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-12-13 20:37:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-12-13 20:37:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-12-13 20:37:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-12-13 20:37:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2022-12-13 20:37:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-12-13 20:37:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:37:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 20:37:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 20:37:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2022-12-13 20:37:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2022-12-13 20:37:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 394 [2022-12-13 20:37:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 400 [2022-12-13 20:37:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 417 [2022-12-13 20:37:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 448 [2022-12-13 20:37:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 467 [2022-12-13 20:37:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 479 [2022-12-13 20:37:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2325 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 2276 trivial. 0 not checked. [2022-12-13 20:37:26,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:37:26,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888960996] [2022-12-13 20:37:26,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888960996] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:37:26,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793245227] [2022-12-13 20:37:26,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:37:26,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:37:26,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:37:26,623 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:37:26,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 20:37:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:30,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 10995 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 20:37:30,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:37:31,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2325 backedges. 763 proven. 0 refuted. 0 times theorem prover too weak. 1562 trivial. 0 not checked. [2022-12-13 20:37:31,002 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:37:31,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793245227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:37:31,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:37:31,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 13 [2022-12-13 20:37:31,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983947172] [2022-12-13 20:37:31,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:37:31,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:37:31,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:37:31,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:37:31,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-12-13 20:37:31,004 INFO L87 Difference]: Start difference. First operand 14243 states and 19379 transitions. Second operand has 6 states, 5 states have (on average 28.6) internal successors, (143), 6 states have internal predecessors, (143), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2022-12-13 20:37:31,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:37:31,755 INFO L93 Difference]: Finished difference Result 28492 states and 38799 transitions. [2022-12-13 20:37:31,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:37:31,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 28.6) internal successors, (143), 6 states have internal predecessors, (143), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) Word has length 496 [2022-12-13 20:37:31,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:37:31,786 INFO L225 Difference]: With dead ends: 28492 [2022-12-13 20:37:31,786 INFO L226 Difference]: Without dead ends: 14258 [2022-12-13 20:37:31,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 643 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-12-13 20:37:31,805 INFO L413 NwaCegarLoop]: 2047 mSDtfsCounter, 6 mSDsluCounter, 8160 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 10207 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:37:31,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 10207 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:37:31,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14258 states. [2022-12-13 20:37:32,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14258 to 14258. [2022-12-13 20:37:32,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14258 states, 10556 states have (on average 1.3255020841227738) internal successors, (13992), 10631 states have internal predecessors, (13992), 2657 states have call successors, (2657), 1028 states have call predecessors, (2657), 1044 states have return successors, (2745), 2638 states have call predecessors, (2745), 2656 states have call successors, (2745) [2022-12-13 20:37:32,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14258 states to 14258 states and 19394 transitions. [2022-12-13 20:37:32,363 INFO L78 Accepts]: Start accepts. Automaton has 14258 states and 19394 transitions. Word has length 496 [2022-12-13 20:37:32,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:37:32,364 INFO L495 AbstractCegarLoop]: Abstraction has 14258 states and 19394 transitions. [2022-12-13 20:37:32,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 28.6) internal successors, (143), 6 states have internal predecessors, (143), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2022-12-13 20:37:32,364 INFO L276 IsEmpty]: Start isEmpty. Operand 14258 states and 19394 transitions. [2022-12-13 20:37:32,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2022-12-13 20:37:32,371 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:37:32,372 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 8, 8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 20:37:32,411 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 20:37:32,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 20:37:32,573 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:37:32,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:37:32,575 INFO L85 PathProgramCache]: Analyzing trace with hash -302358282, now seen corresponding path program 1 times [2022-12-13 20:37:32,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:37:32,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377338667] [2022-12-13 20:37:32,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:37:32,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:37:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:37:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 20:37:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 20:37:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:37:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 20:37:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 20:37:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:37:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-12-13 20:37:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-12-13 20:37:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 20:37:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-12-13 20:37:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-12-13 20:37:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 20:37:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-12-13 20:37:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-12-13 20:37:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-12-13 20:37:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-12-13 20:37:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-12-13 20:37:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:35,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-12-13 20:37:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-12-13 20:37:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2022-12-13 20:37:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-12-13 20:37:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2022-12-13 20:37:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:37:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 20:37:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 20:37:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2022-12-13 20:37:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2022-12-13 20:37:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2022-12-13 20:37:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 408 [2022-12-13 20:37:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 425 [2022-12-13 20:37:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:37:36,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:37:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 456 [2022-12-13 20:37:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 475 [2022-12-13 20:37:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 487 [2022-12-13 20:37:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:36,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2417 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2022-12-13 20:37:36,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:37:36,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377338667] [2022-12-13 20:37:36,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377338667] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:37:36,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102312113] [2022-12-13 20:37:36,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:37:36,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:37:36,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:37:36,169 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:37:36,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 20:37:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:38,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 11115 conjuncts, 225 conjunts are in the unsatisfiable core [2022-12-13 20:37:38,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:37:38,978 INFO L321 Elim1Store]: treesize reduction 533, result has 14.4 percent of original size [2022-12-13 20:37:38,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 16 case distinctions, treesize of input 208008 treesize of output 204743 [2022-12-13 20:37:50,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:37:50,694 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc32.base| Int)) (and (< |ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_37242 Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc32.base| v_ArrVal_37242))))) is different from true [2022-12-13 20:37:50,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:50,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:50,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:37:50,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:37:50,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:37:50,854 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc32.base| Int)) (and (< |ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_37243 Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc32.base| v_ArrVal_37243))))) is different from true [2022-12-13 20:37:50,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:50,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:50,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:37:50,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:37:50,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:37:51,001 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc32.base| Int)) (and (exists ((v_ArrVal_37244 Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc32.base| v_ArrVal_37244))) (< |ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|))) is different from true [2022-12-13 20:37:51,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:51,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:51,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:37:51,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:37:51,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:37:51,151 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc32.base| Int)) (and (< |ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_37245 Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc32.base| v_ArrVal_37245))))) is different from true [2022-12-13 20:37:51,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:51,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:51,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:37:51,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:37:51,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:37:51,298 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc32.base| Int)) (and (exists ((v_ArrVal_37246 Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc32.base| v_ArrVal_37246))) (< |ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|))) is different from true [2022-12-13 20:37:51,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:51,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:51,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:37:51,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:37:51,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:37:51,445 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc32.base| Int)) (and (< |ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_37247 Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc32.base| v_ArrVal_37247))))) is different from true [2022-12-13 20:37:51,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:51,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:51,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:37:51,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:37:51,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:37:51,590 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc32.base| Int)) (and (exists ((v_ArrVal_37248 Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc32.base| v_ArrVal_37248))) (< |ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|))) is different from true [2022-12-13 20:37:51,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:51,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:51,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:37:51,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:37:51,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:37:51,739 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc32.base| Int)) (and (< |ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_37249 Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc32.base| v_ArrVal_37249))))) is different from true [2022-12-13 20:37:51,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:51,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:51,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:37:51,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:37:51,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:37:51,883 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc32.base| Int)) (and (exists ((v_ArrVal_37250 Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc32.base| v_ArrVal_37250))) (< |ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|))) is different from true [2022-12-13 20:37:51,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:51,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:51,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:37:51,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:37:52,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:37:52,036 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc32.base| Int)) (and (< |ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_37251 Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc32.base| v_ArrVal_37251))))) is different from true [2022-12-13 20:37:52,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:52,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:52,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:37:52,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:37:52,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:37:52,190 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc32.base| Int)) (and (exists ((v_ArrVal_37252 Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc32.base| v_ArrVal_37252))) (< |ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|))) is different from true [2022-12-13 20:37:52,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:52,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:52,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:37:52,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:37:52,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:37:52,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-13 20:37:52,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-13 20:37:52,467 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 20:37:52,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 20:37:52,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:37:52,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-13 20:37:52,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-13 20:37:52,655 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 20:37:52,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 20:37:52,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:37:52,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-13 20:37:52,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-13 20:37:52,898 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 20:37:52,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 20:37:54,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 20:37:54,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 20:37:54,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 20:37:54,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 20:37:55,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 20:37:55,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 20:37:55,481 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#ldvarg15~0#1.base_BEFORE_CALL_19| Int)) (and (= (select |c_#valid| |v_ULTIMATE.start_main_~#ldvarg15~0#1.base_BEFORE_CALL_19|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#ldvarg15~0#1.base_BEFORE_CALL_19|))) (exists ((v_ArrVal_37260 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_37260) |c_#memory_int|))) is different from true [2022-12-13 20:37:55,610 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-12-13 20:37:55,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 20:37:55,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 20:37:56,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:37:56,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:56,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:56,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:56,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:37:56,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:37:57,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:37:57,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 20:37:57,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 20:37:57,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:37:58,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:58,031 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_37267 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_37267) |c_#memory_int|)) is different from true [2022-12-13 20:37:58,051 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc32.base| Int)) (and (exists ((v_ArrVal_37266 Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc32.base| v_ArrVal_37266))) (< |ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|) (exists ((|v_#Ultimate.meminit_#ptr.base_AFTER_CALL_82| Int) (v_ArrVal_37267 (Array Int Int))) (and (<= |v_#Ultimate.meminit_#ptr.base_AFTER_CALL_82| |ldv_init_zalloc_#t~malloc32.base|) (= (store |c_old(#memory_int)| |v_#Ultimate.meminit_#ptr.base_AFTER_CALL_82| v_ArrVal_37267) |c_#memory_int|))))) is different from true [2022-12-13 20:37:58,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:58,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:58,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:37:58,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:37:58,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:37:58,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 20:37:58,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:37:58,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:37:58,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 20:37:58,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:58,552 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_37269 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_37269) |c_#memory_int|)) is different from true [2022-12-13 20:37:58,568 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc32.base| Int)) (and (exists ((v_ArrVal_37266 Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc32.base| v_ArrVal_37266))) (exists ((|v_#Ultimate.meminit_#ptr.base_AFTER_CALL_83| Int) (v_ArrVal_37269 (Array Int Int))) (and (= (store |c_old(#memory_int)| |v_#Ultimate.meminit_#ptr.base_AFTER_CALL_83| v_ArrVal_37269) |c_#memory_int|) (<= |v_#Ultimate.meminit_#ptr.base_AFTER_CALL_83| |ldv_init_zalloc_#t~malloc32.base|))) (< |ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|))) is different from true [2022-12-13 20:37:58,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:58,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:58,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:37:58,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 20:37:58,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:37:58,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:37:58,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:37:58,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 20:37:58,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:58,805 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_37271 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_37271) |c_#memory_int|)) is different from true [2022-12-13 20:37:58,827 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc32.base| Int)) (and (exists ((v_ArrVal_37266 Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc32.base| v_ArrVal_37266))) (< |ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|) (exists ((|v_#Ultimate.meminit_#ptr.base_AFTER_CALL_84| Int) (v_ArrVal_37271 (Array Int Int))) (and (= |c_#memory_int| (store |c_old(#memory_int)| |v_#Ultimate.meminit_#ptr.base_AFTER_CALL_84| v_ArrVal_37271)) (<= |v_#Ultimate.meminit_#ptr.base_AFTER_CALL_84| |ldv_init_zalloc_#t~malloc32.base|))))) is different from true [2022-12-13 20:37:58,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:58,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:37:58,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:37:58,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 20:37:58,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:37:58,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:37:59,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:37:59,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 20:37:59,199 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:37:59,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 20:37:59,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 20:37:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2417 backedges. 458 proven. 91 refuted. 5 times theorem prover too weak. 1042 trivial. 821 not checked. [2022-12-13 20:37:59,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:38:00,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102312113] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:38:00,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 20:38:00,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 54] total 63 [2022-12-13 20:38:00,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211928730] [2022-12-13 20:38:00,139 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 20:38:00,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-12-13 20:38:00,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:38:00,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-12-13 20:38:00,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1989, Unknown=70, NotChecked=1962, Total=4290 [2022-12-13 20:38:00,143 INFO L87 Difference]: Start difference. First operand 14258 states and 19394 transitions. Second operand has 63 states, 59 states have (on average 5.694915254237288) internal successors, (336), 55 states have internal predecessors, (336), 33 states have call successors, (109), 15 states have call predecessors, (109), 33 states have return successors, (109), 33 states have call predecessors, (109), 33 states have call successors, (109) [2022-12-13 20:38:03,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:38:07,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:38:10,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:38:12,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:38:15,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:38:17,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:38:20,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:38:22,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:38:24,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:38:27,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:38:30,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:38:42,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:38:44,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:38:46,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:38:48,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:38:50,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:38:52,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:38:54,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:38:56,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:38:58,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:39:00,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:39:02,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:39:04,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:39:49,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:39:51,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:39:53,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:39:55,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:39:57,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:39:59,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:40:01,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:40:03,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:40:05,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:40:07,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:40:09,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:40:41,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:40:44,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:40:46,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:40:48,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:40:58,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:41:00,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:41:02,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:41:04,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:41:06,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:41:08,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:41:10,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:41:12,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:41:56,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:41:56,071 INFO L93 Difference]: Finished difference Result 39498 states and 54740 transitions. [2022-12-13 20:41:56,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-12-13 20:41:56,072 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 59 states have (on average 5.694915254237288) internal successors, (336), 55 states have internal predecessors, (336), 33 states have call successors, (109), 15 states have call predecessors, (109), 33 states have return successors, (109), 33 states have call predecessors, (109), 33 states have call successors, (109) Word has length 504 [2022-12-13 20:41:56,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:41:56,147 INFO L225 Difference]: With dead ends: 39498 [2022-12-13 20:41:56,147 INFO L226 Difference]: Without dead ends: 25232 [2022-12-13 20:41:56,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 794 GetRequests, 658 SyntacticMatches, 20 SemanticMatches, 116 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 3146 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=1047, Invalid=8769, Unknown=156, NotChecked=3834, Total=13806 [2022-12-13 20:41:56,221 INFO L413 NwaCegarLoop]: 2696 mSDtfsCounter, 6269 mSDsluCounter, 44549 mSDsCounter, 0 mSdLazyCounter, 42515 mSolverCounterSat, 3797 mSolverCounterUnsat, 4059 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 218.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6537 SdHoareTripleChecker+Valid, 47245 SdHoareTripleChecker+Invalid, 116706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.4s SdHoareTripleChecker+Time, 3797 IncrementalHoareTripleChecker+Valid, 42515 IncrementalHoareTripleChecker+Invalid, 4059 IncrementalHoareTripleChecker+Unknown, 66335 IncrementalHoareTripleChecker+Unchecked, 227.9s IncrementalHoareTripleChecker+Time [2022-12-13 20:41:56,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6537 Valid, 47245 Invalid, 116706 Unknown, 0 Unchecked, 0.4s Time], IncrementalHoareTripleChecker [3797 Valid, 42515 Invalid, 4059 Unknown, 66335 Unchecked, 227.9s Time] [2022-12-13 20:41:56,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25232 states. [2022-12-13 20:41:57,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25232 to 23539. [2022-12-13 20:41:57,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23539 states, 17702 states have (on average 1.3462885549655406) internal successors, (23832), 17856 states have internal predecessors, (23832), 4340 states have call successors, (4340), 1458 states have call predecessors, (4340), 1496 states have return successors, (4575), 4282 states have call predecessors, (4575), 4339 states have call successors, (4575) [2022-12-13 20:41:57,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23539 states to 23539 states and 32747 transitions. [2022-12-13 20:41:57,396 INFO L78 Accepts]: Start accepts. Automaton has 23539 states and 32747 transitions. Word has length 504 [2022-12-13 20:41:57,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:41:57,396 INFO L495 AbstractCegarLoop]: Abstraction has 23539 states and 32747 transitions. [2022-12-13 20:41:57,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 59 states have (on average 5.694915254237288) internal successors, (336), 55 states have internal predecessors, (336), 33 states have call successors, (109), 15 states have call predecessors, (109), 33 states have return successors, (109), 33 states have call predecessors, (109), 33 states have call successors, (109) [2022-12-13 20:41:57,396 INFO L276 IsEmpty]: Start isEmpty. Operand 23539 states and 32747 transitions. [2022-12-13 20:41:57,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2022-12-13 20:41:57,410 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:41:57,410 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 15, 8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-13 20:41:57,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 20:41:57,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 20:41:57,611 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:41:57,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:41:57,612 INFO L85 PathProgramCache]: Analyzing trace with hash 437627786, now seen corresponding path program 2 times [2022-12-13 20:41:57,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:41:57,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720655090] [2022-12-13 20:41:57,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:41:57,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:41:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:00,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:42:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:00,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:42:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:00,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:42:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:00,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 20:42:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:00,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:42:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:00,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:42:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:00,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 20:42:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:00,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:42:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:00,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:42:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:00,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:42:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:00,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:42:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:42:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 20:42:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:42:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:42:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 20:42:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:42:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:42:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:42:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:42:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:42:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-12-13 20:42:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:42:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:42:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-12-13 20:42:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:42:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:42:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 20:42:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:42:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:42:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-12-13 20:42:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:42:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:42:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-12-13 20:42:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:42:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:42:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-12-13 20:42:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:42:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:42:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-12-13 20:42:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:42:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:42:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-12-13 20:42:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:42:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-12-13 20:42:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:42:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-12-13 20:42:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:42:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-12-13 20:42:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:42:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-12-13 20:42:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:42:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-12-13 20:42:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:42:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2022-12-13 20:42:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:42:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2022-12-13 20:42:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:42:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2022-12-13 20:42:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:42:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 20:42:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:42:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 20:42:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2022-12-13 20:42:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:42:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 387 [2022-12-13 20:42:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:42:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:42:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 409 [2022-12-13 20:42:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 415 [2022-12-13 20:42:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:42:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:42:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 432 [2022-12-13 20:42:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 20:42:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 20:42:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 463 [2022-12-13 20:42:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 482 [2022-12-13 20:42:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 494 [2022-12-13 20:42:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:01,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 2445 trivial. 0 not checked. [2022-12-13 20:42:01,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:42:01,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720655090] [2022-12-13 20:42:01,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720655090] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:42:01,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216124760] [2022-12-13 20:42:01,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 20:42:01,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:42:01,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:42:01,492 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:42:01,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bb3495-7b28-4b55-b271-6a087877b4e9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 20:42:29,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 20:42:29,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:42:29,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 11220 conjuncts, 265 conjunts are in the unsatisfiable core [2022-12-13 20:42:29,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:42:29,910 INFO L321 Elim1Store]: treesize reduction 530, result has 14.9 percent of original size [2022-12-13 20:42:29,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 16 case distinctions, treesize of input 595680 treesize of output 587530 [2022-12-13 20:43:08,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:43:08,322 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_41530 Int)) (= |c_#valid| (store |c_old(#valid)| |c_ldv_init_zalloc_#t~malloc32.base| v_ArrVal_41530))) (< |c_ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|)) is different from true [2022-12-13 20:43:08,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:08,333 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc32.base| Int)) (and (< |ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_41530 Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc32.base| v_ArrVal_41530))))) is different from true [2022-12-13 20:43:08,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:08,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:08,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:43:08,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:43:08,476 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_41531 Int)) (= |c_#valid| (store |c_old(#valid)| |c_ldv_init_zalloc_#t~malloc32.base| v_ArrVal_41531))) (< |c_ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|)) is different from true [2022-12-13 20:43:08,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:08,489 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc32.base| Int)) (and (< |ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_41531 Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc32.base| v_ArrVal_41531))))) is different from true [2022-12-13 20:43:08,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:08,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:08,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:43:08,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:43:08,635 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_41532 Int)) (= |c_#valid| (store |c_old(#valid)| |c_ldv_init_zalloc_#t~malloc32.base| v_ArrVal_41532))) (< |c_ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|)) is different from true [2022-12-13 20:43:08,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:08,647 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc32.base| Int)) (and (< |ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_41532 Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc32.base| v_ArrVal_41532))))) is different from true [2022-12-13 20:43:08,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:08,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:08,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:43:08,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:43:08,792 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_41533 Int)) (= |c_#valid| (store |c_old(#valid)| |c_ldv_init_zalloc_#t~malloc32.base| v_ArrVal_41533))) (< |c_ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|)) is different from true [2022-12-13 20:43:08,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:08,804 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc32.base| Int)) (and (exists ((v_ArrVal_41533 Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc32.base| v_ArrVal_41533))) (< |ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|))) is different from true [2022-12-13 20:43:08,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:08,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:08,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:43:08,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:43:08,947 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_41534 Int)) (= |c_#valid| (store |c_old(#valid)| |c_ldv_init_zalloc_#t~malloc32.base| v_ArrVal_41534))) (< |c_ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|)) is different from true [2022-12-13 20:43:08,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:08,958 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc32.base| Int)) (and (< |ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_41534 Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc32.base| v_ArrVal_41534))))) is different from true [2022-12-13 20:43:08,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:09,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:09,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:43:09,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:43:09,097 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_41535 Int)) (= |c_#valid| (store |c_old(#valid)| |c_ldv_init_zalloc_#t~malloc32.base| v_ArrVal_41535))) (< |c_ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|)) is different from true [2022-12-13 20:43:09,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:09,110 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc32.base| Int)) (and (< |ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_41535 Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc32.base| v_ArrVal_41535))))) is different from true [2022-12-13 20:43:09,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:09,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:09,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:43:09,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:43:09,264 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_41536 Int)) (= |c_#valid| (store |c_old(#valid)| |c_ldv_init_zalloc_#t~malloc32.base| v_ArrVal_41536))) (< |c_ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|)) is different from true [2022-12-13 20:43:09,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:09,278 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc32.base| Int)) (and (exists ((v_ArrVal_41536 Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc32.base| v_ArrVal_41536))) (< |ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|))) is different from true [2022-12-13 20:43:09,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:09,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:09,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:43:09,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:43:09,439 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_41537 Int)) (= |c_#valid| (store |c_old(#valid)| |c_ldv_init_zalloc_#t~malloc32.base| v_ArrVal_41537))) (< |c_ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|)) is different from true [2022-12-13 20:43:09,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:09,453 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc32.base| Int)) (and (exists ((v_ArrVal_41537 Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc32.base| v_ArrVal_41537))) (< |ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|))) is different from true [2022-12-13 20:43:09,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:09,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:09,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:43:09,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:43:09,614 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_41538 Int)) (= |c_#valid| (store |c_old(#valid)| |c_ldv_init_zalloc_#t~malloc32.base| v_ArrVal_41538))) (< |c_ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|)) is different from true [2022-12-13 20:43:09,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:09,628 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc32.base| Int)) (and (exists ((v_ArrVal_41538 Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc32.base| v_ArrVal_41538))) (< |ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|))) is different from true [2022-12-13 20:43:09,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:09,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:09,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:43:09,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:43:09,798 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_41539 Int)) (= |c_#valid| (store |c_old(#valid)| |c_ldv_init_zalloc_#t~malloc32.base| v_ArrVal_41539))) (< |c_ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|)) is different from true [2022-12-13 20:43:09,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:09,812 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc32.base| Int)) (and (< |ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_41539 Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc32.base| v_ArrVal_41539))))) is different from true [2022-12-13 20:43:09,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:09,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:09,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:43:09,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:43:10,005 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_41540 Int)) (= |c_#valid| (store |c_old(#valid)| |c_ldv_init_zalloc_#t~malloc32.base| v_ArrVal_41540))) (< |c_ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|)) is different from true [2022-12-13 20:43:10,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:10,021 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc32.base| Int)) (and (< |ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_41540 Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc32.base| v_ArrVal_41540))))) is different from true [2022-12-13 20:43:10,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:10,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:10,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:43:10,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:43:10,218 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_41541 Int)) (= |c_#valid| (store |c_old(#valid)| |c_ldv_init_zalloc_#t~malloc32.base| v_ArrVal_41541))) (< |c_ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|)) is different from true [2022-12-13 20:43:10,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:10,233 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc32.base| Int)) (and (< |ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_41541 Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc32.base| v_ArrVal_41541))))) is different from true [2022-12-13 20:43:10,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:10,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:10,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:43:10,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:43:10,423 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_41542 Int)) (= |c_#valid| (store |c_old(#valid)| |c_ldv_init_zalloc_#t~malloc32.base| v_ArrVal_41542))) (< |c_ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|)) is different from true [2022-12-13 20:43:10,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:10,437 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc32.base| Int)) (and (exists ((v_ArrVal_41542 Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc32.base| v_ArrVal_41542))) (< |ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|))) is different from true [2022-12-13 20:43:10,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:10,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:10,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:43:10,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:43:10,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:10,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:10,900 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 20:43:10,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:43:12,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-13 20:43:12,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 20:43:12,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 20:43:13,067 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#ldvarg15~0#1.base_BEFORE_CALL_49| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#ldvarg15~0#1.base_BEFORE_CALL_49|) (= (select |c_#valid| |v_ULTIMATE.start_main_~#ldvarg15~0#1.base_BEFORE_CALL_49|) 1))) (exists ((v_ArrVal_41548 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_41548) |c_#memory_int|))) is different from true [2022-12-13 20:43:13,079 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#ldvarg15~0#1.base_BEFORE_CALL_49| Int)) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#ldvarg15~0#1.base_BEFORE_CALL_49|) (= (select |c_#valid| |v_ULTIMATE.start_main_~#ldvarg15~0#1.base_BEFORE_CALL_49|) 1))) (exists ((v_ArrVal_41549 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_41549) |c_#memory_int|))) is different from true [2022-12-13 20:43:13,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 20:43:13,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 20:43:13,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 20:43:14,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 20:43:14,488 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 16 [2022-12-13 20:43:14,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 20:43:15,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 20:43:15,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 20:43:15,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:15,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:16,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:16,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:16,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:43:17,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:17,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 20:43:17,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:17,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 20:43:17,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 20:43:17,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-13 20:43:17,969 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_41561 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_41561) |c_#memory_int|)) is different from true [2022-12-13 20:43:18,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-13 20:43:18,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:18,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:18,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 20:43:18,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:18,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:18,228 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 20:43:18,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-12-13 20:43:18,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:18,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 20:43:18,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:18,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 20:43:18,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 20:43:18,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:19,156 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.meminit_#ptr.base_AFTER_CALL_100| Int) (v_ArrVal_41563 (Array Int Int)) (|ldv_init_zalloc_#t~malloc32.base| Int)) (and (< |ldv_init_zalloc_#t~malloc32.base| |c_#StackHeapBarrier|) (= |c_#memory_int| (store |c_old(#memory_int)| |v_#Ultimate.meminit_#ptr.base_AFTER_CALL_100| v_ArrVal_41563)) (<= |v_#Ultimate.meminit_#ptr.base_AFTER_CALL_100| |ldv_init_zalloc_#t~malloc32.base|) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc32.base| 1)))) (exists ((|v_ldv_init_zalloc_#t~malloc32.base_BEFORE_CALL_19| Int)) (and (= (select |c_#valid| |v_ldv_init_zalloc_#t~malloc32.base_BEFORE_CALL_19|) 1) (< |v_ldv_init_zalloc_#t~malloc32.base_BEFORE_CALL_19| |c_#StackHeapBarrier|)))) is different from true [2022-12-13 20:43:19,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:19,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:19,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:19,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 20:43:19,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:19,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:19,536 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 20:43:19,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 22 [2022-12-13 20:43:19,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:19,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 20:43:19,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 20:43:19,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-13 20:43:19,838 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_41565 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_41565) |c_#memory_int|)) is different from true [2022-12-13 20:43:19,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:43:19,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-13 20:43:20,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:20,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:20,068 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 20:43:20,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-12-13 20:43:20,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:20,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 20:43:20,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:20,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 20:43:20,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:20,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:43:20,401 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:43:20,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2022-12-13 20:43:20,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 20:43:20,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 663 proven. 146 refuted. 6 times theorem prover too weak. 882 trivial. 853 not checked. [2022-12-13 20:43:20,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:43:21,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216124760] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:43:21,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 20:43:21,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 77] total 87 [2022-12-13 20:43:21,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293093553] [2022-12-13 20:43:21,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 20:43:21,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-12-13 20:43:21,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:43:21,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-12-13 20:43:21,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=2986, Unknown=182, NotChecked=4464, Total=8010 [2022-12-13 20:43:21,297 INFO L87 Difference]: Start difference. First operand 23539 states and 32747 transitions. Second operand has 87 states, 68 states have (on average 5.264705882352941) internal successors, (358), 78 states have internal predecessors, (358), 50 states have call successors, (113), 18 states have call predecessors, (113), 36 states have return successors, (112), 36 states have call predecessors, (112), 50 states have call successors, (112) [2022-12-13 20:43:23,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:43:24,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:43:25,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:43:27,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:43:29,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:43:31,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:43:33,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:43:35,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:43:36,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:43:37,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:43:38,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:43:39,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:43:41,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:43:43,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:43:45,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:43:47,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:43:48,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:43:50,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:43:52,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:43:54,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:43:55,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:43:57,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:43:59,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:44:01,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:44:02,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 20:44:04,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:44:06,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:44:09,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:44:34,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:44:36,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:44:38,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:44:40,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:44:42,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:44:44,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:44:46,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:44:48,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:44:50,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:44:52,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 20:44:54,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]