java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:27:41,799 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:27:41,801 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:27:41,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:27:41,815 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:27:41,816 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:27:41,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:27:41,820 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:27:41,823 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:27:41,824 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:27:41,825 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:27:41,827 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:27:41,827 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:27:41,828 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:27:41,830 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:27:41,831 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:27:41,832 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:27:41,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:27:41,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:27:41,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:27:41,841 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:27:41,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:27:41,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:27:41,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:27:41,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:27:41,851 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:27:41,851 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:27:41,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:27:41,853 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:27:41,857 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:27:41,857 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:27:41,858 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:27:41,859 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:27:41,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:27:41,864 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:27:41,864 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:27:41,865 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:27:41,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:27:41,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:27:41,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:27:41,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:27:41,875 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:27:41,905 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:27:41,905 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:27:41,907 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:27:41,907 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:27:41,908 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:27:41,908 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:27:41,908 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:27:41,908 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:27:41,909 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:27:41,909 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:27:41,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:27:41,912 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:27:41,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:27:41,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:27:41,913 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:27:41,913 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:27:41,914 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:27:41,914 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:27:41,914 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:27:41,915 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:27:41,915 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:27:41,915 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:27:41,915 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:27:41,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:27:41,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:27:41,916 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:27:41,917 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:27:41,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:27:41,917 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:27:41,917 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:27:41,986 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:27:42,013 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:27:42,018 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:27:42,021 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:27:42,022 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:27:42,023 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-10-03 02:27:42,105 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb50aa3b6/4ef70dcccb9e43c0b4de903c2df8c451/FLAG74c055cd8 [2019-10-03 02:27:42,914 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:27:42,915 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-10-03 02:27:42,960 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb50aa3b6/4ef70dcccb9e43c0b4de903c2df8c451/FLAG74c055cd8 [2019-10-03 02:27:43,003 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb50aa3b6/4ef70dcccb9e43c0b4de903c2df8c451 [2019-10-03 02:27:43,013 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:27:43,015 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:27:43,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:27:43,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:27:43,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:27:43,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:27:43" (1/1) ... [2019-10-03 02:27:43,027 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20a9a4b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:27:43, skipping insertion in model container [2019-10-03 02:27:43,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:27:43" (1/1) ... [2019-10-03 02:27:43,038 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:27:43,190 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:27:44,663 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:27:44,708 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:27:44,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:27:45,090 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:27:45,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:27:45 WrapperNode [2019-10-03 02:27:45,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:27:45,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:27:45,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:27:45,093 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:27:45,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:27:45" (1/1) ... [2019-10-03 02:27:45,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:27:45" (1/1) ... [2019-10-03 02:27:45,189 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:27:45" (1/1) ... [2019-10-03 02:27:45,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:27:45" (1/1) ... [2019-10-03 02:27:45,249 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:27:45" (1/1) ... [2019-10-03 02:27:45,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:27:45" (1/1) ... [2019-10-03 02:27:45,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:27:45" (1/1) ... [2019-10-03 02:27:45,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:27:45,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:27:45,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:27:45,297 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:27:45,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:27:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:27:45,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:27:45,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:27:45,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-10-03 02:27:45,375 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2019-10-03 02:27:45,375 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_int [2019-10-03 02:27:45,376 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_int_in [2019-10-03 02:27:45,376 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2019-10-03 02:27:45,376 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2019-10-03 02:27:45,376 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-10-03 02:27:45,377 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_maxpacket [2019-10-03 02:27:45,377 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-10-03 02:27:45,377 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-10-03 02:27:45,377 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-10-03 02:27:45,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-03 02:27:45,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-10-03 02:27:45,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-10-03 02:27:45,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2019-10-03 02:27:45,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-10-03 02:27:45,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-10-03 02:27:45,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-10-03 02:27:45,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-10-03 02:27:45,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-10-03 02:27:45,380 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2019-10-03 02:27:45,380 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2019-10-03 02:27:45,380 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_drvdata [2019-10-03 02:27:45,380 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2019-10-03 02:27:45,381 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2019-10-03 02:27:45,381 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2019-10-03 02:27:45,381 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2019-10-03 02:27:45,381 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_irq [2019-10-03 02:27:45,382 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_open [2019-10-03 02:27:45,382 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_close [2019-10-03 02:27:45,382 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_probe [2019-10-03 02:27:45,382 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2019-10-03 02:27:45,382 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_init [2019-10-03 02:27:45,383 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_exit [2019-10-03 02:27:45,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_driver_1 [2019-10-03 02:27:45,383 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:27:45,383 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2019-10-03 02:27:45,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_register_driver_2 [2019-10-03 02:27:45,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_3 [2019-10-03 02:27:45,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_4 [2019-10-03 02:27:45,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_alloc_urb_5 [2019-10-03 02:27:45,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_int_urb_6 [2019-10-03 02:27:45,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2019-10-03 02:27:45,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_8 [2019-10-03 02:27:45,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_10 [2019-10-03 02:27:45,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_deregister_11 [2019-10-03 02:27:45,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-03 02:27:45,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata [2019-10-03 02:27:45,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata [2019-10-03 02:27:45,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_put_intf [2019-10-03 02:27:45,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2019-10-03 02:27:45,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2019-10-03 02:27:45,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_int_urb [2019-10-03 02:27:45,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_bulk_urb [2019-10-03 02:27:45,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2019-10-03 02:27:45,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interface_to_usbdev [2019-10-03 02:27:45,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_dev [2019-10-03 02:27:45,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_dev [2019-10-03 02:27:45,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_interface [2019-10-03 02:27:45,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_interface [2019-10-03 02:27:45,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_register [2019-10-03 02:27:45,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_deregister [2019-10-03 02:27:45,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-03 02:27:45,388 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-10-03 02:27:45,388 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-10-03 02:27:45,389 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2019-10-03 02:27:45,389 INFO L138 BoogieDeclarations]: Found implementation of procedure input_free_device [2019-10-03 02:27:45,389 INFO L138 BoogieDeclarations]: Found implementation of procedure input_register_device [2019-10-03 02:27:45,389 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2019-10-03 02:27:45,390 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2019-10-03 02:27:45,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-03 02:27:45,390 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-03 02:27:45,390 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2019-10-03 02:27:45,390 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2019-10-03 02:27:45,391 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2019-10-03 02:27:45,391 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2019-10-03 02:27:45,391 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-10-03 02:27:45,391 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-10-03 02:27:45,391 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2019-10-03 02:27:45,392 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2019-10-03 02:27:45,392 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-10-03 02:27:45,392 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2019-10-03 02:27:45,392 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-03 02:27:45,392 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-03 02:27:45,393 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-03 02:27:45,393 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-10-03 02:27:45,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:27:45,393 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-10-03 02:27:45,393 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2019-10-03 02:27:45,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:27:45,394 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_int [2019-10-03 02:27:45,394 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_int_in [2019-10-03 02:27:45,394 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2019-10-03 02:27:45,394 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-03 02:27:45,395 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-03 02:27:45,395 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-03 02:27:45,395 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-10-03 02:27:45,395 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2019-10-03 02:27:45,395 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2019-10-03 02:27:45,396 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-10-03 02:27:45,396 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-10-03 02:27:45,396 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_8 [2019-10-03 02:27:45,396 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2019-10-03 02:27:45,396 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2019-10-03 02:27:45,397 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2019-10-03 02:27:45,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:27:45,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:27:45,397 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-10-03 02:27:45,397 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_register_driver_2 [2019-10-03 02:27:45,398 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2019-10-03 02:27:45,398 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-10-03 02:27:45,398 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_deregister_11 [2019-10-03 02:27:45,398 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_int_urb_6 [2019-10-03 02:27:45,398 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2019-10-03 02:27:45,399 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_alloc_urb_5 [2019-10-03 02:27:45,399 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2019-10-03 02:27:45,399 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_10 [2019-10-03 02:27:45,399 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_3 [2019-10-03 02:27:45,399 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_4 [2019-10-03 02:27:45,400 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2019-10-03 02:27:45,400 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2019-10-03 02:27:45,400 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-10-03 02:27:45,400 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-10-03 02:27:45,400 INFO L130 BoogieDeclarations]: Found specification of procedure usb_maxpacket [2019-10-03 02:27:45,400 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2019-10-03 02:27:45,401 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2019-10-03 02:27:45,401 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_int_urb [2019-10-03 02:27:45,401 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2019-10-03 02:27:45,401 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interface_to_usbdev [2019-10-03 02:27:45,402 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata [2019-10-03 02:27:45,402 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata [2019-10-03 02:27:45,402 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-03 02:27:45,402 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-03 02:27:45,402 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-10-03 02:27:45,402 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-10-03 02:27:45,403 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-10-03 02:27:45,403 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:27:45,403 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-03 02:27:45,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:27:45,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-03 02:27:45,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-03 02:27:45,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 02:27:45,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:27:45,404 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-10-03 02:27:45,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-10-03 02:27:45,405 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-10-03 02:27:45,405 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2019-10-03 02:27:45,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-03 02:27:45,405 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-10-03 02:27:45,405 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-10-03 02:27:45,406 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-10-03 02:27:45,406 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-10-03 02:27:45,406 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_driver_1 [2019-10-03 02:27:45,406 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2019-10-03 02:27:45,406 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2019-10-03 02:27:45,407 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2019-10-03 02:27:45,407 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_drvdata [2019-10-03 02:27:45,407 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2019-10-03 02:27:45,407 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2019-10-03 02:27:45,407 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2019-10-03 02:27:45,407 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2019-10-03 02:27:45,408 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2019-10-03 02:27:45,408 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2019-10-03 02:27:45,408 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2019-10-03 02:27:45,408 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2019-10-03 02:27:45,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:27:45,409 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_irq [2019-10-03 02:27:45,409 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_open [2019-10-03 02:27:45,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:27:45,409 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_close [2019-10-03 02:27:45,409 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_probe [2019-10-03 02:27:45,409 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2019-10-03 02:27:45,410 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_init [2019-10-03 02:27:45,410 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_exit [2019-10-03 02:27:45,410 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-03 02:27:45,410 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-03 02:27:45,410 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:27:45,410 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-03 02:27:45,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_put_intf [2019-10-03 02:27:45,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_bulk_urb [2019-10-03 02:27:45,411 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-10-03 02:27:45,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_dev [2019-10-03 02:27:45,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_dev [2019-10-03 02:27:45,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_interface [2019-10-03 02:27:45,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_interface [2019-10-03 02:27:45,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_register [2019-10-03 02:27:45,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_deregister [2019-10-03 02:27:45,412 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-03 02:27:45,412 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:27:45,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:27:45,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:27:45,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:27:45,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-03 02:27:45,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:27:46,124 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-10-03 02:27:47,469 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:27:47,469 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-03 02:27:47,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:27:47 BoogieIcfgContainer [2019-10-03 02:27:47,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:27:47,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:27:47,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:27:47,477 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:27:47,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:27:43" (1/3) ... [2019-10-03 02:27:47,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a56b0a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:27:47, skipping insertion in model container [2019-10-03 02:27:47,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:27:45" (2/3) ... [2019-10-03 02:27:47,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a56b0a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:27:47, skipping insertion in model container [2019-10-03 02:27:47,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:27:47" (3/3) ... [2019-10-03 02:27:47,482 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-10-03 02:27:47,495 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:27:47,506 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:27:47,528 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:27:47,561 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:27:47,562 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:27:47,562 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:27:47,562 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:27:47,562 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:27:47,562 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:27:47,562 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:27:47,563 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:27:47,592 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states. [2019-10-03 02:27:47,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-03 02:27:47,608 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:27:47,609 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:27:47,612 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:27:47,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:27:47,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1638085357, now seen corresponding path program 1 times [2019-10-03 02:27:47,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:27:47,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:27:47,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:27:47,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:27:47,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:27:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:27:48,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:27:48,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:27:48,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:27:48,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:27:48,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:27:48,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:27:48,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:27:48,225 INFO L87 Difference]: Start difference. First operand 505 states. Second operand 3 states. [2019-10-03 02:27:48,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:27:48,417 INFO L93 Difference]: Finished difference Result 697 states and 826 transitions. [2019-10-03 02:27:48,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:27:48,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-03 02:27:48,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:27:48,462 INFO L225 Difference]: With dead ends: 697 [2019-10-03 02:27:48,462 INFO L226 Difference]: Without dead ends: 680 [2019-10-03 02:27:48,466 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:27:48,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-10-03 02:27:48,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 680. [2019-10-03 02:27:48,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-10-03 02:27:48,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 801 transitions. [2019-10-03 02:27:48,654 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 801 transitions. Word has length 44 [2019-10-03 02:27:48,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:27:48,655 INFO L475 AbstractCegarLoop]: Abstraction has 680 states and 801 transitions. [2019-10-03 02:27:48,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:27:48,655 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 801 transitions. [2019-10-03 02:27:48,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-03 02:27:48,673 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:27:48,673 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:27:48,674 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:27:48,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:27:48,675 INFO L82 PathProgramCache]: Analyzing trace with hash 538717486, now seen corresponding path program 1 times [2019-10-03 02:27:48,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:27:48,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:27:48,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:27:48,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:27:48,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:27:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:27:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 02:27:49,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:27:49,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:27:49,031 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:27:49,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:27:49,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:27:49,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:27:49,035 INFO L87 Difference]: Start difference. First operand 680 states and 801 transitions. Second operand 6 states. [2019-10-03 02:27:49,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:27:49,235 INFO L93 Difference]: Finished difference Result 696 states and 818 transitions. [2019-10-03 02:27:49,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:27:49,236 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-10-03 02:27:49,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:27:49,241 INFO L225 Difference]: With dead ends: 696 [2019-10-03 02:27:49,242 INFO L226 Difference]: Without dead ends: 696 [2019-10-03 02:27:49,243 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:27:49,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2019-10-03 02:27:49,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 685. [2019-10-03 02:27:49,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-10-03 02:27:49,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 805 transitions. [2019-10-03 02:27:49,270 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 805 transitions. Word has length 72 [2019-10-03 02:27:49,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:27:49,270 INFO L475 AbstractCegarLoop]: Abstraction has 685 states and 805 transitions. [2019-10-03 02:27:49,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:27:49,271 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 805 transitions. [2019-10-03 02:27:49,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-03 02:27:49,273 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:27:49,273 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:27:49,273 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:27:49,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:27:49,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1297040366, now seen corresponding path program 1 times [2019-10-03 02:27:49,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:27:49,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:27:49,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:27:49,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:27:49,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:27:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:27:49,418 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 02:27:49,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:27:49,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:27:49,420 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:27:49,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:27:49,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:27:49,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:27:49,421 INFO L87 Difference]: Start difference. First operand 685 states and 805 transitions. Second operand 3 states. [2019-10-03 02:27:49,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:27:49,510 INFO L93 Difference]: Finished difference Result 1342 states and 1580 transitions. [2019-10-03 02:27:49,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:27:49,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-10-03 02:27:49,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:27:49,534 INFO L225 Difference]: With dead ends: 1342 [2019-10-03 02:27:49,534 INFO L226 Difference]: Without dead ends: 1342 [2019-10-03 02:27:49,535 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:27:49,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2019-10-03 02:27:49,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1340. [2019-10-03 02:27:49,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2019-10-03 02:27:49,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1579 transitions. [2019-10-03 02:27:49,617 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1579 transitions. Word has length 72 [2019-10-03 02:27:49,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:27:49,619 INFO L475 AbstractCegarLoop]: Abstraction has 1340 states and 1579 transitions. [2019-10-03 02:27:49,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:27:49,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1579 transitions. [2019-10-03 02:27:49,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-03 02:27:49,624 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:27:49,624 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:27:49,624 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:27:49,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:27:49,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1553403217, now seen corresponding path program 1 times [2019-10-03 02:27:49,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:27:49,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:27:49,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:27:49,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:27:49,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:27:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:27:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 02:27:49,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:27:49,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:27:49,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:27:49,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:27:49,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:27:49,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:27:49,818 INFO L87 Difference]: Start difference. First operand 1340 states and 1579 transitions. Second operand 3 states. [2019-10-03 02:27:49,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:27:49,850 INFO L93 Difference]: Finished difference Result 1339 states and 1577 transitions. [2019-10-03 02:27:49,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:27:49,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-03 02:27:49,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:27:49,864 INFO L225 Difference]: With dead ends: 1339 [2019-10-03 02:27:49,864 INFO L226 Difference]: Without dead ends: 1339 [2019-10-03 02:27:49,865 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:27:49,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2019-10-03 02:27:49,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1339. [2019-10-03 02:27:49,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2019-10-03 02:27:49,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 1577 transitions. [2019-10-03 02:27:49,938 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 1577 transitions. Word has length 73 [2019-10-03 02:27:49,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:27:49,939 INFO L475 AbstractCegarLoop]: Abstraction has 1339 states and 1577 transitions. [2019-10-03 02:27:49,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:27:49,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1577 transitions. [2019-10-03 02:27:49,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-03 02:27:49,941 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:27:49,942 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:27:49,943 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:27:49,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:27:49,944 INFO L82 PathProgramCache]: Analyzing trace with hash 910721873, now seen corresponding path program 1 times [2019-10-03 02:27:49,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:27:49,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:27:49,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:27:49,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:27:49,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:27:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:27:50,136 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 02:27:50,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:27:50,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:27:50,137 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:27:50,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:27:50,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:27:50,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:27:50,139 INFO L87 Difference]: Start difference. First operand 1339 states and 1577 transitions. Second operand 3 states. [2019-10-03 02:27:50,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:27:50,157 INFO L93 Difference]: Finished difference Result 1338 states and 1575 transitions. [2019-10-03 02:27:50,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:27:50,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-10-03 02:27:50,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:27:50,169 INFO L225 Difference]: With dead ends: 1338 [2019-10-03 02:27:50,169 INFO L226 Difference]: Without dead ends: 1338 [2019-10-03 02:27:50,169 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:27:50,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2019-10-03 02:27:50,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1338. [2019-10-03 02:27:50,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1338 states. [2019-10-03 02:27:50,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1575 transitions. [2019-10-03 02:27:50,225 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 1575 transitions. Word has length 74 [2019-10-03 02:27:50,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:27:50,226 INFO L475 AbstractCegarLoop]: Abstraction has 1338 states and 1575 transitions. [2019-10-03 02:27:50,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:27:50,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1575 transitions. [2019-10-03 02:27:50,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-03 02:27:50,228 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:27:50,228 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 02:27:50,228 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:27:50,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:27:50,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1832525740, now seen corresponding path program 1 times [2019-10-03 02:27:50,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:27:50,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:27:50,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:27:50,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:27:50,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:27:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:27:50,332 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 02:27:50,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:27:50,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:27:50,333 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:27:50,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:27:50,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:27:50,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:27:50,334 INFO L87 Difference]: Start difference. First operand 1338 states and 1575 transitions. Second operand 3 states. [2019-10-03 02:27:50,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:27:50,350 INFO L93 Difference]: Finished difference Result 1337 states and 1573 transitions. [2019-10-03 02:27:50,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:27:50,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-10-03 02:27:50,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:27:50,358 INFO L225 Difference]: With dead ends: 1337 [2019-10-03 02:27:50,359 INFO L226 Difference]: Without dead ends: 1319 [2019-10-03 02:27:50,359 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:27:50,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-10-03 02:27:50,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2019-10-03 02:27:50,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1319 states. [2019-10-03 02:27:50,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1553 transitions. [2019-10-03 02:27:50,405 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1553 transitions. Word has length 75 [2019-10-03 02:27:50,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:27:50,406 INFO L475 AbstractCegarLoop]: Abstraction has 1319 states and 1553 transitions. [2019-10-03 02:27:50,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:27:50,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1553 transitions. [2019-10-03 02:27:50,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-03 02:27:50,509 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:27:50,510 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:27:50,510 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:27:50,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:27:50,511 INFO L82 PathProgramCache]: Analyzing trace with hash -131462205, now seen corresponding path program 1 times [2019-10-03 02:27:50,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:27:50,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:27:50,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:27:50,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:27:50,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:27:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:27:50,661 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:27:50,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:27:50,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:27:50,662 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:27:50,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:27:50,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:27:50,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:27:50,664 INFO L87 Difference]: Start difference. First operand 1319 states and 1553 transitions. Second operand 3 states. [2019-10-03 02:27:50,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:27:50,723 INFO L93 Difference]: Finished difference Result 1406 states and 1670 transitions. [2019-10-03 02:27:50,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:27:50,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-10-03 02:27:50,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:27:50,732 INFO L225 Difference]: With dead ends: 1406 [2019-10-03 02:27:50,732 INFO L226 Difference]: Without dead ends: 1406 [2019-10-03 02:27:50,733 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:27:50,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2019-10-03 02:27:50,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1369. [2019-10-03 02:27:50,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1369 states. [2019-10-03 02:27:50,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1624 transitions. [2019-10-03 02:27:50,792 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1624 transitions. Word has length 231 [2019-10-03 02:27:50,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:27:50,792 INFO L475 AbstractCegarLoop]: Abstraction has 1369 states and 1624 transitions. [2019-10-03 02:27:50,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:27:50,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1624 transitions. [2019-10-03 02:27:50,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-03 02:27:50,801 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:27:50,802 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:27:50,802 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:27:50,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:27:50,803 INFO L82 PathProgramCache]: Analyzing trace with hash 395309848, now seen corresponding path program 1 times [2019-10-03 02:27:50,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:27:50,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:27:50,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:27:50,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:27:50,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:27:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:27:51,057 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:27:51,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:27:51,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:27:51,058 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:27:51,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:27:51,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:27:51,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:27:51,060 INFO L87 Difference]: Start difference. First operand 1369 states and 1624 transitions. Second operand 6 states. [2019-10-03 02:27:51,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:27:51,129 INFO L93 Difference]: Finished difference Result 1397 states and 1652 transitions. [2019-10-03 02:27:51,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:27:51,129 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 250 [2019-10-03 02:27:51,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:27:51,141 INFO L225 Difference]: With dead ends: 1397 [2019-10-03 02:27:51,141 INFO L226 Difference]: Without dead ends: 1397 [2019-10-03 02:27:51,143 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:27:51,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2019-10-03 02:27:51,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1393. [2019-10-03 02:27:51,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1393 states. [2019-10-03 02:27:51,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1648 transitions. [2019-10-03 02:27:51,213 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1648 transitions. Word has length 250 [2019-10-03 02:27:51,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:27:51,214 INFO L475 AbstractCegarLoop]: Abstraction has 1393 states and 1648 transitions. [2019-10-03 02:27:51,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:27:51,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1648 transitions. [2019-10-03 02:27:51,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-03 02:27:51,222 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:27:51,223 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:27:51,223 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:27:51,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:27:51,227 INFO L82 PathProgramCache]: Analyzing trace with hash 931071889, now seen corresponding path program 1 times [2019-10-03 02:27:51,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:27:51,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:27:51,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:27:51,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:27:51,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:27:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:27:51,630 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:27:51,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:27:51,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:27:51,630 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:27:51,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:27:51,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:27:51,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:27:51,632 INFO L87 Difference]: Start difference. First operand 1393 states and 1648 transitions. Second operand 6 states. [2019-10-03 02:27:51,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:27:51,878 INFO L93 Difference]: Finished difference Result 2853 states and 3386 transitions. [2019-10-03 02:27:51,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:27:51,879 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 256 [2019-10-03 02:27:51,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:27:51,901 INFO L225 Difference]: With dead ends: 2853 [2019-10-03 02:27:51,901 INFO L226 Difference]: Without dead ends: 2853 [2019-10-03 02:27:51,902 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:27:51,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2019-10-03 02:27:51,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 1433. [2019-10-03 02:27:51,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1433 states. [2019-10-03 02:27:51,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 1702 transitions. [2019-10-03 02:27:51,997 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 1702 transitions. Word has length 256 [2019-10-03 02:27:51,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:27:51,999 INFO L475 AbstractCegarLoop]: Abstraction has 1433 states and 1702 transitions. [2019-10-03 02:27:52,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:27:52,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1702 transitions. [2019-10-03 02:27:52,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-03 02:27:52,010 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:27:52,010 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:27:52,011 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:27:52,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:27:52,012 INFO L82 PathProgramCache]: Analyzing trace with hash 797058383, now seen corresponding path program 1 times [2019-10-03 02:27:52,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:27:52,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:27:52,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:27:52,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:27:52,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:27:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:27:52,609 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-03 02:27:52,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:27:52,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:27:52,611 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 257 with the following transitions: [2019-10-03 02:27:52,615 INFO L207 CegarAbsIntRunner]: [20], [21], [25], [26], [27], [28], [34], [35], [46], [47], [48], [50], [54], [56], [60], [62], [64], [66], [68], [73], [75], [80], [82], [85], [174], [176], [180], [181], [182], [183], [232], [233], [259], [262], [264], [265], [268], [272], [273], [275], [276], [287], [288], [351], [352], [358], [359], [360], [362], [365], [367], [370], [377], [378], [379], [381], [384], [388], [389], [390], [391], [392], [394], [395], [417], [419], [420], [421], [422], [423], [439], [441], [447], [450], [454], [456], [467], [469], [470], [473], [475], [477], [479], [482], [485], [488], [491], [493], [498], [531], [534], [537], [540], [543], [545], [549], [552], [555], [557], [560], [568], [601], [602], [618], [620], [622], [623], [640], [641], [645], [647], [648], [651], [652], [656], [657], [658], [660], [661], [718], [720], [721], [722], [724], [725], [751], [753], [755], [756], [763], [765], [766], [767], [769], [770], [773], [814], [817], [822], [823], [838], [839], [840], [841], [842], [843], [844], [845], [846], [847], [848], [849], [850], [851], [852], [853], [886], [887], [888], [889], [890], [891], [908], [909], [928], [929], [932], [933], [934], [935], [936], [937], [938], [939], [952], [953], [960], [961], [964], [965], [970], [971], [972], [973], [974], [975], [976], [977], [982], [983], [984], [985], [990], [996], [997], [998], [999], [1008], [1009], [1010], [1011], [1012], [1013], [1026], [1027], [1028], [1029], [1032], [1033], [1034], [1035], [1040], [1041], [1042], [1043], [1044], [1054], [1055], [1056], [1060], [1061] [2019-10-03 02:27:52,703 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:27:52,704 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:27:52,824 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:27:52,826 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 0. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 146 variables. [2019-10-03 02:27:52,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:27:52,833 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:27:52,964 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:27:52,964 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:27:52,972 INFO L420 sIntCurrentIteration]: We unified 255 AI predicates to 255 [2019-10-03 02:27:52,972 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:27:52,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:27:52,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 11 [2019-10-03 02:27:52,974 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:27:52,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:27:52,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:27:52,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:27:52,975 INFO L87 Difference]: Start difference. First operand 1433 states and 1702 transitions. Second operand 2 states. [2019-10-03 02:27:52,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:27:52,976 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:27:52,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:27:52,976 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 256 [2019-10-03 02:27:52,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:27:52,976 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:27:52,977 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:27:52,977 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:27:52,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:27:52,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:27:52,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:27:52,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:27:52,978 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 256 [2019-10-03 02:27:52,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:27:52,979 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:27:52,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:27:52,979 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:27:52,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:27:52,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:27:52 BoogieIcfgContainer [2019-10-03 02:27:52,986 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:27:52,990 INFO L168 Benchmark]: Toolchain (without parser) took 9973.23 ms. Allocated memory was 131.1 MB in the beginning and 461.4 MB in the end (delta: 330.3 MB). Free memory was 80.8 MB in the beginning and 203.0 MB in the end (delta: -122.2 MB). Peak memory consumption was 208.1 MB. Max. memory is 7.1 GB. [2019-10-03 02:27:52,990 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 131.1 MB. Free memory is still 104.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-03 02:27:52,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2075.37 ms. Allocated memory was 131.1 MB in the beginning and 203.4 MB in the end (delta: 72.4 MB). Free memory was 80.4 MB in the beginning and 120.5 MB in the end (delta: -40.0 MB). Peak memory consumption was 39.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:27:52,992 INFO L168 Benchmark]: Boogie Preprocessor took 201.41 ms. Allocated memory is still 203.4 MB. Free memory was 120.5 MB in the beginning and 112.9 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:27:52,994 INFO L168 Benchmark]: RCFGBuilder took 2175.90 ms. Allocated memory was 203.4 MB in the beginning and 288.4 MB in the end (delta: 84.9 MB). Free memory was 112.9 MB in the beginning and 143.2 MB in the end (delta: -30.4 MB). Peak memory consumption was 68.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:27:52,995 INFO L168 Benchmark]: TraceAbstraction took 5513.31 ms. Allocated memory was 288.4 MB in the beginning and 461.4 MB in the end (delta: 173.0 MB). Free memory was 143.2 MB in the beginning and 203.0 MB in the end (delta: -59.8 MB). Peak memory consumption was 113.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:27:52,999 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 131.1 MB. Free memory is still 104.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2075.37 ms. Allocated memory was 131.1 MB in the beginning and 203.4 MB in the end (delta: 72.4 MB). Free memory was 80.4 MB in the beginning and 120.5 MB in the end (delta: -40.0 MB). Peak memory consumption was 39.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 201.41 ms. Allocated memory is still 203.4 MB. Free memory was 120.5 MB in the beginning and 112.9 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2175.90 ms. Allocated memory was 203.4 MB in the beginning and 288.4 MB in the end (delta: 84.9 MB). Free memory was 112.9 MB in the beginning and 143.2 MB in the end (delta: -30.4 MB). Peak memory consumption was 68.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5513.31 ms. Allocated memory was 288.4 MB in the beginning and 461.4 MB in the end (delta: 173.0 MB). Free memory was 143.2 MB in the beginning and 203.0 MB in the end (delta: -59.8 MB). Peak memory consumption was 113.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4056]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 88 procedures, 547 locations, 1 error locations. SAFE Result, 5.4s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4575 SDtfs, 2967 SDslu, 7173 SDs, 0 SdLazy, 119 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1433occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.0784313725490198 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 1474 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1403 NumberOfCodeBlocks, 1403 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1393 ConstructedInterpolants, 0 QuantifiedInterpolants, 324319 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 199/210 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...