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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 16:56:49,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 16:56:49,232 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 16:56:49,248 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 16:56:49,248 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 16:56:49,250 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 16:56:49,251 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 16:56:49,253 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 16:56:49,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 16:56:49,257 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 16:56:49,258 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 16:56:49,259 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 16:56:49,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 16:56:49,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 16:56:49,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 16:56:49,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 16:56:49,265 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 16:56:49,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 16:56:49,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 16:56:49,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 16:56:49,278 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 16:56:49,279 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 16:56:49,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 16:56:49,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 16:56:49,294 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 16:56:49,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 16:56:49,294 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 16:56:49,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 16:56:49,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 16:56:49,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 16:56:49,301 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 16:56:49,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 16:56:49,303 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 16:56:49,304 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 16:56:49,306 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 16:56:49,308 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 16:56:49,309 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 16:56:49,309 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 16:56:49,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 16:56:49,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 16:56:49,314 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 16:56:49,316 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-16 16:56:49,343 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 16:56:49,344 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 16:56:49,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-16 16:56:49,346 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-16 16:56:49,347 INFO L138 SettingsManager]: * Use SBE=true [2019-09-16 16:56:49,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 16:56:49,347 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 16:56:49,347 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-16 16:56:49,347 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 16:56:49,348 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 16:56:49,349 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 16:56:49,349 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 16:56:49,349 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 16:56:49,350 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 16:56:49,350 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 16:56:49,350 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-16 16:56:49,350 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 16:56:49,351 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 16:56:49,351 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 16:56:49,351 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-16 16:56:49,352 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-16 16:56:49,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:56:49,352 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 16:56:49,352 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 16:56:49,353 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-16 16:56:49,353 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-16 16:56:49,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 16:56:49,353 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-16 16:56:49,353 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 16:56:49,413 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 16:56:49,437 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 16:56:49,441 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 16:56:49,442 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 16:56:49,444 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 16:56:49,445 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_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-09-16 16:56:49,517 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32c7f866f/5ef64b06b0584beda598409d596ab0b3/FLAG67e1ee1e9 [2019-09-16 16:56:50,306 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 16:56:50,307 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-09-16 16:56:50,350 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32c7f866f/5ef64b06b0584beda598409d596ab0b3/FLAG67e1ee1e9 [2019-09-16 16:56:50,405 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32c7f866f/5ef64b06b0584beda598409d596ab0b3 [2019-09-16 16:56:50,416 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 16:56:50,418 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 16:56:50,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 16:56:50,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 16:56:50,421 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 16:56:50,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:56:50" (1/1) ... [2019-09-16 16:56:50,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b92c7b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:56:50, skipping insertion in model container [2019-09-16 16:56:50,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:56:50" (1/1) ... [2019-09-16 16:56:50,434 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 16:56:50,541 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 16:56:51,818 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:56:51,869 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 16:56:52,201 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:56:52,298 INFO L192 MainTranslator]: Completed translation [2019-09-16 16:56:52,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:56:52 WrapperNode [2019-09-16 16:56:52,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 16:56:52,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 16:56:52,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 16:56:52,301 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 16:56:52,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:56:52" (1/1) ... [2019-09-16 16:56:52,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:56:52" (1/1) ... [2019-09-16 16:56:52,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:56:52" (1/1) ... [2019-09-16 16:56:52,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:56:52" (1/1) ... [2019-09-16 16:56:52,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:56:52" (1/1) ... [2019-09-16 16:56:52,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:56:52" (1/1) ... [2019-09-16 16:56:52,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:56:52" (1/1) ... [2019-09-16 16:56:52,529 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 16:56:52,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 16:56:52,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 16:56:52,532 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 16:56:52,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:56:52" (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-09-16 16:56:52,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 16:56:52,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 16:56:52,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-09-16 16:56:52,611 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2019-09-16 16:56:52,611 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_int [2019-09-16 16:56:52,611 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_int_in [2019-09-16 16:56:52,611 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2019-09-16 16:56:52,612 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2019-09-16 16:56:52,612 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-09-16 16:56:52,612 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_maxpacket [2019-09-16 16:56:52,612 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-09-16 16:56:52,613 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-09-16 16:56:52,613 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-09-16 16:56:52,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-09-16 16:56:52,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-09-16 16:56:52,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-09-16 16:56:52,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2019-09-16 16:56:52,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-09-16 16:56:52,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-09-16 16:56:52,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-09-16 16:56:52,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-09-16 16:56:52,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-09-16 16:56:52,624 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2019-09-16 16:56:52,624 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2019-09-16 16:56:52,624 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_drvdata [2019-09-16 16:56:52,624 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2019-09-16 16:56:52,625 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2019-09-16 16:56:52,625 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2019-09-16 16:56:52,625 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2019-09-16 16:56:52,625 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_irq [2019-09-16 16:56:52,625 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_open [2019-09-16 16:56:52,626 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_close [2019-09-16 16:56:52,626 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_probe [2019-09-16 16:56:52,626 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2019-09-16 16:56:52,626 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_init [2019-09-16 16:56:52,626 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_exit [2019-09-16 16:56:52,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_driver_1 [2019-09-16 16:56:52,627 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 16:56:52,627 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2019-09-16 16:56:52,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_register_driver_2 [2019-09-16 16:56:52,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_3 [2019-09-16 16:56:52,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_4 [2019-09-16 16:56:52,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_alloc_urb_5 [2019-09-16 16:56:52,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_int_urb_6 [2019-09-16 16:56:52,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2019-09-16 16:56:52,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_8 [2019-09-16 16:56:52,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_10 [2019-09-16 16:56:52,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_deregister_11 [2019-09-16 16:56:52,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-09-16 16:56:52,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata [2019-09-16 16:56:52,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata [2019-09-16 16:56:52,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_put_intf [2019-09-16 16:56:52,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2019-09-16 16:56:52,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2019-09-16 16:56:52,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_int_urb [2019-09-16 16:56:52,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_bulk_urb [2019-09-16 16:56:52,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2019-09-16 16:56:52,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interface_to_usbdev [2019-09-16 16:56:52,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_dev [2019-09-16 16:56:52,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_dev [2019-09-16 16:56:52,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_interface [2019-09-16 16:56:52,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_interface [2019-09-16 16:56:52,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_register [2019-09-16 16:56:52,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_deregister [2019-09-16 16:56:52,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-09-16 16:56:52,632 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-09-16 16:56:52,632 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-09-16 16:56:52,632 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2019-09-16 16:56:52,632 INFO L138 BoogieDeclarations]: Found implementation of procedure input_free_device [2019-09-16 16:56:52,633 INFO L138 BoogieDeclarations]: Found implementation of procedure input_register_device [2019-09-16 16:56:52,633 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2019-09-16 16:56:52,633 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2019-09-16 16:56:52,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-09-16 16:56:52,633 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-09-16 16:56:52,634 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2019-09-16 16:56:52,634 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2019-09-16 16:56:52,634 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2019-09-16 16:56:52,634 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-09-16 16:56:52,634 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-09-16 16:56:52,634 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2019-09-16 16:56:52,635 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-09-16 16:56:52,635 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2019-09-16 16:56:52,635 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-09-16 16:56:52,635 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-09-16 16:56:52,635 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-09-16 16:56:52,636 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-16 16:56:52,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 16:56:52,636 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-09-16 16:56:52,636 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2019-09-16 16:56:52,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 16:56:52,637 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_int [2019-09-16 16:56:52,637 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_int_in [2019-09-16 16:56:52,637 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2019-09-16 16:56:52,637 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-09-16 16:56:52,637 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-09-16 16:56:52,638 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-09-16 16:56:52,638 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-09-16 16:56:52,638 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2019-09-16 16:56:52,638 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2019-09-16 16:56:52,638 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-09-16 16:56:52,638 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-09-16 16:56:52,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_8 [2019-09-16 16:56:52,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2019-09-16 16:56:52,639 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2019-09-16 16:56:52,639 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2019-09-16 16:56:52,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-16 16:56:52,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-16 16:56:52,640 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-09-16 16:56:52,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_register_driver_2 [2019-09-16 16:56:52,640 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2019-09-16 16:56:52,640 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-09-16 16:56:52,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_deregister_11 [2019-09-16 16:56:52,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_int_urb_6 [2019-09-16 16:56:52,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_alloc_urb_5 [2019-09-16 16:56:52,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_10 [2019-09-16 16:56:52,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_3 [2019-09-16 16:56:52,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_4 [2019-09-16 16:56:52,641 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2019-09-16 16:56:52,642 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2019-09-16 16:56:52,642 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-09-16 16:56:52,642 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-09-16 16:56:52,642 INFO L130 BoogieDeclarations]: Found specification of procedure usb_maxpacket [2019-09-16 16:56:52,642 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2019-09-16 16:56:52,643 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2019-09-16 16:56:52,643 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_int_urb [2019-09-16 16:56:52,643 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2019-09-16 16:56:52,643 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interface_to_usbdev [2019-09-16 16:56:52,643 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata [2019-09-16 16:56:52,643 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata [2019-09-16 16:56:52,644 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-09-16 16:56:52,644 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-09-16 16:56:52,644 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-09-16 16:56:52,644 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-09-16 16:56:52,644 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-09-16 16:56:52,645 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 16:56:52,645 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-16 16:56:52,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 16:56:52,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-16 16:56:52,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-16 16:56:52,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-16 16:56:52,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 16:56:52,646 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-09-16 16:56:52,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-16 16:56:52,646 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-09-16 16:56:52,646 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2019-09-16 16:56:52,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-09-16 16:56:52,647 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-09-16 16:56:52,647 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-09-16 16:56:52,647 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-09-16 16:56:52,647 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-09-16 16:56:52,648 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_driver_1 [2019-09-16 16:56:52,648 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2019-09-16 16:56:52,648 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2019-09-16 16:56:52,648 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2019-09-16 16:56:52,648 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_drvdata [2019-09-16 16:56:52,648 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2019-09-16 16:56:52,649 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2019-09-16 16:56:52,649 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2019-09-16 16:56:52,649 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2019-09-16 16:56:52,649 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2019-09-16 16:56:52,649 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2019-09-16 16:56:52,649 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2019-09-16 16:56:52,650 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2019-09-16 16:56:52,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 16:56:52,650 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_irq [2019-09-16 16:56:52,650 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_open [2019-09-16 16:56:52,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-16 16:56:52,650 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_close [2019-09-16 16:56:52,651 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_probe [2019-09-16 16:56:52,651 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2019-09-16 16:56:52,651 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_init [2019-09-16 16:56:52,651 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_exit [2019-09-16 16:56:52,651 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-09-16 16:56:52,651 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-09-16 16:56:52,652 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 16:56:52,652 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-09-16 16:56:52,652 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_put_intf [2019-09-16 16:56:52,652 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_bulk_urb [2019-09-16 16:56:52,652 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-09-16 16:56:52,652 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_dev [2019-09-16 16:56:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_dev [2019-09-16 16:56:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_interface [2019-09-16 16:56:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_interface [2019-09-16 16:56:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_register [2019-09-16 16:56:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_deregister [2019-09-16 16:56:52,653 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-09-16 16:56:52,654 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-16 16:56:52,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 16:56:52,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 16:56:52,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-16 16:56:52,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-16 16:56:52,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 16:56:53,285 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-09-16 16:56:54,413 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 16:56:54,414 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-16 16:56:54,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:56:54 BoogieIcfgContainer [2019-09-16 16:56:54,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 16:56:54,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 16:56:54,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 16:56:54,421 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 16:56:54,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 04:56:50" (1/3) ... [2019-09-16 16:56:54,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd5205b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:56:54, skipping insertion in model container [2019-09-16 16:56:54,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:56:52" (2/3) ... [2019-09-16 16:56:54,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd5205b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:56:54, skipping insertion in model container [2019-09-16 16:56:54,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:56:54" (3/3) ... [2019-09-16 16:56:54,428 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-09-16 16:56:54,440 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 16:56:54,452 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 16:56:54,471 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 16:56:54,510 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-16 16:56:54,511 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 16:56:54,511 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-16 16:56:54,512 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 16:56:54,512 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 16:56:54,512 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 16:56:54,512 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 16:56:54,512 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 16:56:54,512 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 16:56:54,545 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states. [2019-09-16 16:56:54,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-16 16:56:54,554 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:56:54,555 INFO L407 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] [2019-09-16 16:56:54,557 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:56:54,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:56:54,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1288315444, now seen corresponding path program 1 times [2019-09-16 16:56:54,566 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:56:54,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:56:54,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:56:54,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:56:54,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:56:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:56:55,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:56:55,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:56:55,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:56:55,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:56:55,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:56:55,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:56:55,121 INFO L87 Difference]: Start difference. First operand 504 states. Second operand 3 states. [2019-09-16 16:56:55,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:56:55,356 INFO L93 Difference]: Finished difference Result 1040 states and 1242 transitions. [2019-09-16 16:56:55,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:56:55,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-09-16 16:56:55,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:56:55,394 INFO L225 Difference]: With dead ends: 1040 [2019-09-16 16:56:55,395 INFO L226 Difference]: Without dead ends: 658 [2019-09-16 16:56:55,407 INFO L636 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-09-16 16:56:55,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-09-16 16:56:55,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2019-09-16 16:56:55,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-09-16 16:56:55,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 772 transitions. [2019-09-16 16:56:55,526 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 772 transitions. Word has length 43 [2019-09-16 16:56:55,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:56:55,527 INFO L475 AbstractCegarLoop]: Abstraction has 658 states and 772 transitions. [2019-09-16 16:56:55,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:56:55,528 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 772 transitions. [2019-09-16 16:56:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-16 16:56:55,533 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:56:55,534 INFO L407 BasicCegarLoop]: trace histogram [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-09-16 16:56:55,534 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:56:55,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:56:55,535 INFO L82 PathProgramCache]: Analyzing trace with hash 2143860229, now seen corresponding path program 1 times [2019-09-16 16:56:55,535 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:56:55,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:56:55,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:56:55,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:56:55,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:56:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:56:55,856 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 16:56:55,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:56:55,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:56:55,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:56:55,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:56:55,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:56:55,869 INFO L87 Difference]: Start difference. First operand 658 states and 772 transitions. Second operand 6 states. [2019-09-16 16:56:56,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:56:56,161 INFO L93 Difference]: Finished difference Result 1314 states and 1546 transitions. [2019-09-16 16:56:56,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:56:56,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-16 16:56:56,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:56:56,170 INFO L225 Difference]: With dead ends: 1314 [2019-09-16 16:56:56,170 INFO L226 Difference]: Without dead ends: 676 [2019-09-16 16:56:56,173 INFO L636 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-09-16 16:56:56,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2019-09-16 16:56:56,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 663. [2019-09-16 16:56:56,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-09-16 16:56:56,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 776 transitions. [2019-09-16 16:56:56,227 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 776 transitions. Word has length 70 [2019-09-16 16:56:56,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:56:56,228 INFO L475 AbstractCegarLoop]: Abstraction has 663 states and 776 transitions. [2019-09-16 16:56:56,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:56:56,228 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 776 transitions. [2019-09-16 16:56:56,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-16 16:56:56,237 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:56:56,238 INFO L407 BasicCegarLoop]: trace histogram [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-09-16 16:56:56,238 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:56:56,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:56:56,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1392784187, now seen corresponding path program 1 times [2019-09-16 16:56:56,239 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:56:56,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:56:56,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:56:56,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:56:56,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:56:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:56:56,486 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 16:56:56,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:56:56,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:56:56,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:56:56,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:56:56,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:56:56,488 INFO L87 Difference]: Start difference. First operand 663 states and 776 transitions. Second operand 3 states. [2019-09-16 16:56:56,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:56:56,567 INFO L93 Difference]: Finished difference Result 1948 states and 2305 transitions. [2019-09-16 16:56:56,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:56:56,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-16 16:56:56,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:56:56,578 INFO L225 Difference]: With dead ends: 1948 [2019-09-16 16:56:56,578 INFO L226 Difference]: Without dead ends: 1305 [2019-09-16 16:56:56,581 INFO L636 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-09-16 16:56:56,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2019-09-16 16:56:56,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1295. [2019-09-16 16:56:56,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1295 states. [2019-09-16 16:56:56,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1528 transitions. [2019-09-16 16:56:56,666 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1528 transitions. Word has length 70 [2019-09-16 16:56:56,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:56:56,667 INFO L475 AbstractCegarLoop]: Abstraction has 1295 states and 1528 transitions. [2019-09-16 16:56:56,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:56:56,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1528 transitions. [2019-09-16 16:56:56,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-16 16:56:56,670 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:56:56,670 INFO L407 BasicCegarLoop]: trace histogram [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-09-16 16:56:56,671 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:56:56,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:56:56,671 INFO L82 PathProgramCache]: Analyzing trace with hash -226781931, now seen corresponding path program 1 times [2019-09-16 16:56:56,671 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:56:56,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:56:56,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:56:56,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:56:56,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:56:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:56:56,836 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 16:56:56,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:56:56,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:56:56,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:56:56,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:56:56,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:56:56,839 INFO L87 Difference]: Start difference. First operand 1295 states and 1528 transitions. Second operand 3 states. [2019-09-16 16:56:56,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:56:56,896 INFO L93 Difference]: Finished difference Result 1297 states and 1529 transitions. [2019-09-16 16:56:56,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:56:56,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-09-16 16:56:56,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:56:56,908 INFO L225 Difference]: With dead ends: 1297 [2019-09-16 16:56:56,909 INFO L226 Difference]: Without dead ends: 1294 [2019-09-16 16:56:56,910 INFO L636 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-09-16 16:56:56,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2019-09-16 16:56:57,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1294. [2019-09-16 16:56:57,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1294 states. [2019-09-16 16:56:57,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1526 transitions. [2019-09-16 16:56:57,052 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1526 transitions. Word has length 71 [2019-09-16 16:56:57,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:56:57,054 INFO L475 AbstractCegarLoop]: Abstraction has 1294 states and 1526 transitions. [2019-09-16 16:56:57,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:56:57,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1526 transitions. [2019-09-16 16:56:57,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-16 16:56:57,057 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:56:57,058 INFO L407 BasicCegarLoop]: trace histogram [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-09-16 16:56:57,058 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:56:57,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:56:57,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1559554504, now seen corresponding path program 1 times [2019-09-16 16:56:57,059 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:56:57,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:56:57,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:56:57,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:56:57,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:56:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:56:57,206 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 16:56:57,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:56:57,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:56:57,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:56:57,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:56:57,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:56:57,208 INFO L87 Difference]: Start difference. First operand 1294 states and 1526 transitions. Second operand 3 states. [2019-09-16 16:56:57,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:56:57,255 INFO L93 Difference]: Finished difference Result 1296 states and 1527 transitions. [2019-09-16 16:56:57,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:56:57,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-09-16 16:56:57,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:56:57,264 INFO L225 Difference]: With dead ends: 1296 [2019-09-16 16:56:57,264 INFO L226 Difference]: Without dead ends: 1293 [2019-09-16 16:56:57,266 INFO L636 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-09-16 16:56:57,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2019-09-16 16:56:57,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1293. [2019-09-16 16:56:57,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1293 states. [2019-09-16 16:56:57,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1524 transitions. [2019-09-16 16:56:57,343 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1524 transitions. Word has length 72 [2019-09-16 16:56:57,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:56:57,348 INFO L475 AbstractCegarLoop]: Abstraction has 1293 states and 1524 transitions. [2019-09-16 16:56:57,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:56:57,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1524 transitions. [2019-09-16 16:56:57,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-16 16:56:57,350 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:56:57,350 INFO L407 BasicCegarLoop]: trace histogram [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-09-16 16:56:57,351 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:56:57,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:56:57,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1101414008, now seen corresponding path program 1 times [2019-09-16 16:56:57,351 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:56:57,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:56:57,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:56:57,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:56:57,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:56:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:56:57,508 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 16:56:57,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:56:57,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:56:57,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:56:57,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:56:57,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:56:57,510 INFO L87 Difference]: Start difference. First operand 1293 states and 1524 transitions. Second operand 3 states. [2019-09-16 16:56:57,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:56:57,559 INFO L93 Difference]: Finished difference Result 1295 states and 1525 transitions. [2019-09-16 16:56:57,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:56:57,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-16 16:56:57,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:56:57,575 INFO L225 Difference]: With dead ends: 1295 [2019-09-16 16:56:57,575 INFO L226 Difference]: Without dead ends: 1292 [2019-09-16 16:56:57,577 INFO L636 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-09-16 16:56:57,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2019-09-16 16:56:57,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1292. [2019-09-16 16:56:57,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1292 states. [2019-09-16 16:56:57,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1522 transitions. [2019-09-16 16:56:57,661 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1522 transitions. Word has length 73 [2019-09-16 16:56:57,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:56:57,662 INFO L475 AbstractCegarLoop]: Abstraction has 1292 states and 1522 transitions. [2019-09-16 16:56:57,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:56:57,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1522 transitions. [2019-09-16 16:56:57,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-16 16:56:57,663 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:56:57,664 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-16 16:56:57,664 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:56:57,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:56:57,664 INFO L82 PathProgramCache]: Analyzing trace with hash -216034613, now seen corresponding path program 1 times [2019-09-16 16:56:57,664 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:56:57,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:56:57,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:56:57,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:56:57,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:56:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:56:57,764 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 16:56:57,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:56:57,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:56:57,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:56:57,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:56:57,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:56:57,766 INFO L87 Difference]: Start difference. First operand 1292 states and 1522 transitions. Second operand 3 states. [2019-09-16 16:56:57,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:56:57,819 INFO L93 Difference]: Finished difference Result 1294 states and 1523 transitions. [2019-09-16 16:56:57,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:56:57,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-16 16:56:57,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:56:57,831 INFO L225 Difference]: With dead ends: 1294 [2019-09-16 16:56:57,831 INFO L226 Difference]: Without dead ends: 1272 [2019-09-16 16:56:57,834 INFO L636 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-09-16 16:56:57,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2019-09-16 16:56:57,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1272. [2019-09-16 16:56:57,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2019-09-16 16:56:57,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1499 transitions. [2019-09-16 16:56:57,920 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1499 transitions. Word has length 74 [2019-09-16 16:56:57,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:56:57,922 INFO L475 AbstractCegarLoop]: Abstraction has 1272 states and 1499 transitions. [2019-09-16 16:56:57,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:56:57,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1499 transitions. [2019-09-16 16:56:57,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-16 16:56:57,940 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:56:57,940 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:56:57,940 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:56:57,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:56:57,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1053464592, now seen corresponding path program 1 times [2019-09-16 16:56:57,941 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:56:57,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:56:57,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:56:57,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:56:57,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:56:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:56:58,242 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-16 16:56:58,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:56:58,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:56:58,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:56:58,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:56:58,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:56:58,245 INFO L87 Difference]: Start difference. First operand 1272 states and 1499 transitions. Second operand 3 states. [2019-09-16 16:56:58,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:56:58,349 INFO L93 Difference]: Finished difference Result 2611 states and 3099 transitions. [2019-09-16 16:56:58,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:56:58,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-09-16 16:56:58,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:56:58,361 INFO L225 Difference]: With dead ends: 2611 [2019-09-16 16:56:58,362 INFO L226 Difference]: Without dead ends: 1359 [2019-09-16 16:56:58,366 INFO L636 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-09-16 16:56:58,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2019-09-16 16:56:58,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1322. [2019-09-16 16:56:58,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2019-09-16 16:56:58,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1570 transitions. [2019-09-16 16:56:58,443 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1570 transitions. Word has length 232 [2019-09-16 16:56:58,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:56:58,443 INFO L475 AbstractCegarLoop]: Abstraction has 1322 states and 1570 transitions. [2019-09-16 16:56:58,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:56:58,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1570 transitions. [2019-09-16 16:56:58,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-16 16:56:58,451 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:56:58,452 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:56:58,452 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:56:58,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:56:58,452 INFO L82 PathProgramCache]: Analyzing trace with hash 2146120225, now seen corresponding path program 1 times [2019-09-16 16:56:58,453 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:56:58,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:56:58,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:56:58,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:56:58,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:56:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:56:58,662 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-16 16:56:58,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:56:58,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:56:58,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:56:58,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:56:58,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:56:58,665 INFO L87 Difference]: Start difference. First operand 1322 states and 1570 transitions. Second operand 6 states. [2019-09-16 16:56:58,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:56:58,771 INFO L93 Difference]: Finished difference Result 2652 states and 3158 transitions. [2019-09-16 16:56:58,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:56:58,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 251 [2019-09-16 16:56:58,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:56:58,784 INFO L225 Difference]: With dead ends: 2652 [2019-09-16 16:56:58,784 INFO L226 Difference]: Without dead ends: 1350 [2019-09-16 16:56:58,791 INFO L636 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-09-16 16:56:58,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2019-09-16 16:56:58,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1346. [2019-09-16 16:56:58,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1346 states. [2019-09-16 16:56:58,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1594 transitions. [2019-09-16 16:56:58,949 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1594 transitions. Word has length 251 [2019-09-16 16:56:58,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:56:58,950 INFO L475 AbstractCegarLoop]: Abstraction has 1346 states and 1594 transitions. [2019-09-16 16:56:58,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:56:58,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1594 transitions. [2019-09-16 16:56:58,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-16 16:56:58,959 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:56:58,959 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:56:58,960 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:56:58,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:56:58,960 INFO L82 PathProgramCache]: Analyzing trace with hash 2124934682, now seen corresponding path program 1 times [2019-09-16 16:56:58,960 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:56:58,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:56:58,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:56:58,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:56:58,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:56:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:56:59,217 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-16 16:56:59,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:56:59,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:56:59,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:56:59,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:56:59,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:56:59,219 INFO L87 Difference]: Start difference. First operand 1346 states and 1594 transitions. Second operand 6 states. [2019-09-16 16:56:59,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:56:59,487 INFO L93 Difference]: Finished difference Result 4086 states and 4858 transitions. [2019-09-16 16:56:59,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-16 16:56:59,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 257 [2019-09-16 16:56:59,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:56:59,505 INFO L225 Difference]: With dead ends: 4086 [2019-09-16 16:56:59,505 INFO L226 Difference]: Without dead ends: 2760 [2019-09-16 16:56:59,511 INFO L636 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-09-16 16:56:59,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states. [2019-09-16 16:56:59,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 1386. [2019-09-16 16:56:59,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1386 states. [2019-09-16 16:56:59,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1648 transitions. [2019-09-16 16:56:59,624 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1648 transitions. Word has length 257 [2019-09-16 16:56:59,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:56:59,626 INFO L475 AbstractCegarLoop]: Abstraction has 1386 states and 1648 transitions. [2019-09-16 16:56:59,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:56:59,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1648 transitions. [2019-09-16 16:56:59,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-16 16:56:59,632 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:56:59,632 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:56:59,632 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:56:59,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:56:59,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1990921176, now seen corresponding path program 1 times [2019-09-16 16:56:59,633 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:56:59,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:56:59,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:56:59,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:56:59,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:56:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:57:00,066 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-16 16:57:00,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:57:00,067 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:57:00,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:57:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:57:00,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 1880 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-16 16:57:00,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:57:00,806 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-16 16:57:00,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:57:00,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [11] total 15 [2019-09-16 16:57:00,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-16 16:57:00,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-16 16:57:00,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-16 16:57:00,818 INFO L87 Difference]: Start difference. First operand 1386 states and 1648 transitions. Second operand 15 states. [2019-09-16 16:57:01,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:57:01,143 INFO L93 Difference]: Finished difference Result 2900 states and 3484 transitions. [2019-09-16 16:57:01,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-16 16:57:01,144 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 257 [2019-09-16 16:57:01,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:57:01,153 INFO L225 Difference]: With dead ends: 2900 [2019-09-16 16:57:01,154 INFO L226 Difference]: Without dead ends: 1534 [2019-09-16 16:57:01,159 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 254 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-09-16 16:57:01,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2019-09-16 16:57:01,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1464. [2019-09-16 16:57:01,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2019-09-16 16:57:01,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 1742 transitions. [2019-09-16 16:57:01,265 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 1742 transitions. Word has length 257 [2019-09-16 16:57:01,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:57:01,270 INFO L475 AbstractCegarLoop]: Abstraction has 1464 states and 1742 transitions. [2019-09-16 16:57:01,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-16 16:57:01,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 1742 transitions. [2019-09-16 16:57:01,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-16 16:57:01,276 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:57:01,276 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:57:01,277 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:57:01,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:57:01,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1132371498, now seen corresponding path program 1 times [2019-09-16 16:57:01,277 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:57:01,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:57:01,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:57:01,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:57:01,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:57:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:57:01,967 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-16 16:57:01,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:57:01,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-16 16:57:01,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-16 16:57:01,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-16 16:57:01,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:57:01,970 INFO L87 Difference]: Start difference. First operand 1464 states and 1742 transitions. Second operand 8 states. [2019-09-16 16:57:03,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:57:03,165 INFO L93 Difference]: Finished difference Result 3635 states and 4340 transitions. [2019-09-16 16:57:03,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 16:57:03,166 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 257 [2019-09-16 16:57:03,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:57:03,179 INFO L225 Difference]: With dead ends: 3635 [2019-09-16 16:57:03,179 INFO L226 Difference]: Without dead ends: 2176 [2019-09-16 16:57:03,189 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:57:03,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2176 states. [2019-09-16 16:57:03,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2176 to 2166. [2019-09-16 16:57:03,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2166 states. [2019-09-16 16:57:03,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 2578 transitions. [2019-09-16 16:57:03,347 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 2578 transitions. Word has length 257 [2019-09-16 16:57:03,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:57:03,349 INFO L475 AbstractCegarLoop]: Abstraction has 2166 states and 2578 transitions. [2019-09-16 16:57:03,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-16 16:57:03,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 2578 transitions. [2019-09-16 16:57:03,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-16 16:57:03,359 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:57:03,360 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:57:03,360 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:57:03,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:57:03,361 INFO L82 PathProgramCache]: Analyzing trace with hash -68882670, now seen corresponding path program 1 times [2019-09-16 16:57:03,361 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:57:03,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:57:03,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:57:03,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:57:03,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:57:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:57:03,709 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-16 16:57:03,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:57:03,709 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:57:03,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:57:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:57:04,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 2219 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-16 16:57:04,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:57:04,396 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-16 16:57:04,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:57:04,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-09-16 16:57:04,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:57:04,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:57:04,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:57:04,405 INFO L87 Difference]: Start difference. First operand 2166 states and 2578 transitions. Second operand 5 states. [2019-09-16 16:57:06,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:57:06,050 INFO L93 Difference]: Finished difference Result 8583 states and 10230 transitions. [2019-09-16 16:57:06,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:57:06,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 302 [2019-09-16 16:57:06,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:57:06,097 INFO L225 Difference]: With dead ends: 8583 [2019-09-16 16:57:06,098 INFO L226 Difference]: Without dead ends: 8565 [2019-09-16 16:57:06,103 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:57:06,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8565 states. [2019-09-16 16:57:06,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8565 to 6416. [2019-09-16 16:57:06,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6416 states. [2019-09-16 16:57:06,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6416 states to 6416 states and 7652 transitions. [2019-09-16 16:57:06,586 INFO L78 Accepts]: Start accepts. Automaton has 6416 states and 7652 transitions. Word has length 302 [2019-09-16 16:57:06,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:57:06,587 INFO L475 AbstractCegarLoop]: Abstraction has 6416 states and 7652 transitions. [2019-09-16 16:57:06,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:57:06,588 INFO L276 IsEmpty]: Start isEmpty. Operand 6416 states and 7652 transitions. [2019-09-16 16:57:06,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-16 16:57:06,605 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:57:06,606 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:57:06,607 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:57:06,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:57:06,607 INFO L82 PathProgramCache]: Analyzing trace with hash -202896176, now seen corresponding path program 1 times [2019-09-16 16:57:06,608 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:57:06,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:57:06,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:57:06,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:57:06,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:57:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:57:06,872 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-16 16:57:06,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:57:06,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:57:06,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:57:06,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:57:06,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:57:06,874 INFO L87 Difference]: Start difference. First operand 6416 states and 7652 transitions. Second operand 5 states. [2019-09-16 16:57:07,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:57:07,581 INFO L93 Difference]: Finished difference Result 19298 states and 23030 transitions. [2019-09-16 16:57:07,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 16:57:07,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 302 [2019-09-16 16:57:07,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:57:07,783 INFO L225 Difference]: With dead ends: 19298 [2019-09-16 16:57:07,783 INFO L226 Difference]: Without dead ends: 12902 [2019-09-16 16:57:07,810 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:57:07,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12902 states. [2019-09-16 16:57:08,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12902 to 6476. [2019-09-16 16:57:08,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6476 states. [2019-09-16 16:57:08,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6476 states to 6476 states and 7724 transitions. [2019-09-16 16:57:08,336 INFO L78 Accepts]: Start accepts. Automaton has 6476 states and 7724 transitions. Word has length 302 [2019-09-16 16:57:08,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:57:08,337 INFO L475 AbstractCegarLoop]: Abstraction has 6476 states and 7724 transitions. [2019-09-16 16:57:08,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:57:08,337 INFO L276 IsEmpty]: Start isEmpty. Operand 6476 states and 7724 transitions. [2019-09-16 16:57:08,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-16 16:57:08,368 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:57:08,369 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:57:08,369 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:57:08,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:57:08,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1291783702, now seen corresponding path program 1 times [2019-09-16 16:57:08,370 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:57:08,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:57:08,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:57:08,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:57:08,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:57:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:57:09,106 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-16 16:57:09,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:57:09,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:57:09,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:57:09,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:57:09,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:57:09,113 INFO L87 Difference]: Start difference. First operand 6476 states and 7724 transitions. Second operand 5 states. [2019-09-16 16:57:09,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:57:09,669 INFO L93 Difference]: Finished difference Result 14348 states and 17714 transitions. [2019-09-16 16:57:09,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:57:09,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 308 [2019-09-16 16:57:09,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:57:09,730 INFO L225 Difference]: With dead ends: 14348 [2019-09-16 16:57:09,731 INFO L226 Difference]: Without dead ends: 7892 [2019-09-16 16:57:09,766 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:57:09,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7892 states. [2019-09-16 16:57:10,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7892 to 7340. [2019-09-16 16:57:10,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7340 states. [2019-09-16 16:57:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7340 states to 7340 states and 9122 transitions. [2019-09-16 16:57:10,567 INFO L78 Accepts]: Start accepts. Automaton has 7340 states and 9122 transitions. Word has length 308 [2019-09-16 16:57:10,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:57:10,567 INFO L475 AbstractCegarLoop]: Abstraction has 7340 states and 9122 transitions. [2019-09-16 16:57:10,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:57:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 7340 states and 9122 transitions. [2019-09-16 16:57:10,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-16 16:57:10,582 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:57:10,583 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-16 16:57:10,583 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:57:10,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:57:10,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1699807317, now seen corresponding path program 1 times [2019-09-16 16:57:10,584 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:57:10,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:57:10,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:57:10,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:57:10,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:57:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:57:12,731 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (const Int) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:478) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:250) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:250) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1305) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1186) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.TermTransferrer.convertApplicationTerm(TermTransferrer.java:182) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:339) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:574) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-16 16:57:12,740 INFO L168 Benchmark]: Toolchain (without parser) took 22321.76 ms. Allocated memory was 133.7 MB in the beginning and 1.0 GB in the end (delta: 880.3 MB). Free memory was 79.3 MB in the beginning and 271.8 MB in the end (delta: -192.5 MB). Peak memory consumption was 687.8 MB. Max. memory is 7.1 GB. [2019-09-16 16:57:12,742 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 133.7 MB. Free memory was 104.4 MB in the beginning and 104.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-09-16 16:57:12,743 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1882.34 ms. Allocated memory was 133.7 MB in the beginning and 215.0 MB in the end (delta: 81.3 MB). Free memory was 79.1 MB in the beginning and 132.3 MB in the end (delta: -53.2 MB). Peak memory consumption was 37.3 MB. Max. memory is 7.1 GB. [2019-09-16 16:57:12,746 INFO L168 Benchmark]: Boogie Preprocessor took 228.30 ms. Allocated memory is still 215.0 MB. Free memory was 132.3 MB in the beginning and 123.9 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 7.1 GB. [2019-09-16 16:57:12,747 INFO L168 Benchmark]: RCFGBuilder took 1886.34 ms. Allocated memory was 215.0 MB in the beginning and 275.3 MB in the end (delta: 60.3 MB). Free memory was 123.9 MB in the beginning and 130.9 MB in the end (delta: -7.0 MB). Peak memory consumption was 68.3 MB. Max. memory is 7.1 GB. [2019-09-16 16:57:12,751 INFO L168 Benchmark]: TraceAbstraction took 18320.20 ms. Allocated memory was 275.3 MB in the beginning and 1.0 GB in the end (delta: 738.7 MB). Free memory was 130.9 MB in the beginning and 271.8 MB in the end (delta: -141.0 MB). Peak memory consumption was 597.8 MB. Max. memory is 7.1 GB. [2019-09-16 16:57:12,756 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.51 ms. Allocated memory is still 133.7 MB. Free memory was 104.4 MB in the beginning and 104.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1882.34 ms. Allocated memory was 133.7 MB in the beginning and 215.0 MB in the end (delta: 81.3 MB). Free memory was 79.1 MB in the beginning and 132.3 MB in the end (delta: -53.2 MB). Peak memory consumption was 37.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 228.30 ms. Allocated memory is still 215.0 MB. Free memory was 132.3 MB in the beginning and 123.9 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1886.34 ms. Allocated memory was 215.0 MB in the beginning and 275.3 MB in the end (delta: 60.3 MB). Free memory was 123.9 MB in the beginning and 130.9 MB in the end (delta: -7.0 MB). Peak memory consumption was 68.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18320.20 ms. Allocated memory was 275.3 MB in the beginning and 1.0 GB in the end (delta: 738.7 MB). Free memory was 130.9 MB in the beginning and 271.8 MB in the end (delta: -141.0 MB). Peak memory consumption was 597.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Undeclared function symbol (const Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Undeclared function symbol (const Int): de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:478) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...