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_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 17:33:43,424 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 17:33:43,426 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 17:33:43,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 17:33:43,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 17:33:43,439 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 17:33:43,440 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 17:33:43,442 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 17:33:43,444 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 17:33:43,445 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 17:33:43,445 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 17:33:43,447 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 17:33:43,447 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 17:33:43,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 17:33:43,449 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 17:33:43,450 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 17:33:43,451 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 17:33:43,451 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 17:33:43,453 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 17:33:43,455 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 17:33:43,456 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 17:33:43,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 17:33:43,458 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 17:33:43,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 17:33:43,461 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 17:33:43,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 17:33:43,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 17:33:43,463 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 17:33:43,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 17:33:43,464 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 17:33:43,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 17:33:43,465 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 17:33:43,466 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 17:33:43,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 17:33:43,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 17:33:43,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 17:33:43,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 17:33:43,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 17:33:43,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 17:33:43,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 17:33:43,470 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 17:33:43,471 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-08 17:33:43,487 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 17:33:43,487 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 17:33:43,488 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 17:33:43,490 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 17:33:43,490 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 17:33:43,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 17:33:43,490 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 17:33:43,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 17:33:43,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 17:33:43,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 17:33:43,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 17:33:43,492 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 17:33:43,492 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 17:33:43,492 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 17:33:43,492 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 17:33:43,492 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 17:33:43,493 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 17:33:43,493 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 17:33:43,493 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 17:33:43,494 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 17:33:43,494 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 17:33:43,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 17:33:43,495 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 17:33:43,495 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 17:33:43,495 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 17:33:43,495 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 17:33:43,496 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 17:33:43,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 17:33:43,496 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 17:33:43,528 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 17:33:43,539 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 17:33:43,542 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 17:33:43,544 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 17:33:43,544 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 17:33:43,545 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-09-08 17:33:43,604 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb61b2a45/29342008abd146c785da86c2a076ed48/FLAG1ced97e17 [2019-09-08 17:33:44,330 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 17:33:44,331 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-09-08 17:33:44,371 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb61b2a45/29342008abd146c785da86c2a076ed48/FLAG1ced97e17 [2019-09-08 17:33:44,436 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb61b2a45/29342008abd146c785da86c2a076ed48 [2019-09-08 17:33:44,444 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 17:33:44,446 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 17:33:44,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 17:33:44,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 17:33:44,450 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 17:33:44,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:33:44" (1/1) ... [2019-09-08 17:33:44,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@330ed430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:33:44, skipping insertion in model container [2019-09-08 17:33:44,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:33:44" (1/1) ... [2019-09-08 17:33:44,460 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 17:33:44,549 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 17:33:45,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 17:33:45,648 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 17:33:45,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 17:33:45,853 INFO L192 MainTranslator]: Completed translation [2019-09-08 17:33:45,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:33:45 WrapperNode [2019-09-08 17:33:45,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 17:33:45,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 17:33:45,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 17:33:45,856 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 17:33:45,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:33:45" (1/1) ... [2019-09-08 17:33:45,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:33:45" (1/1) ... [2019-09-08 17:33:45,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:33:45" (1/1) ... [2019-09-08 17:33:45,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:33:45" (1/1) ... [2019-09-08 17:33:46,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:33:45" (1/1) ... [2019-09-08 17:33:46,039 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:33:45" (1/1) ... [2019-09-08 17:33:46,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:33:45" (1/1) ... [2019-09-08 17:33:46,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 17:33:46,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 17:33:46,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 17:33:46,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 17:33:46,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:33:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 17:33:46,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 17:33:46,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 17:33:46,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-09-08 17:33:46,195 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2019-09-08 17:33:46,196 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_int [2019-09-08 17:33:46,196 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_int_in [2019-09-08 17:33:46,197 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2019-09-08 17:33:46,197 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2019-09-08 17:33:46,197 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-09-08 17:33:46,197 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_maxpacket [2019-09-08 17:33:46,198 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-09-08 17:33:46,198 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-09-08 17:33:46,199 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-09-08 17:33:46,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-09-08 17:33:46,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-09-08 17:33:46,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-09-08 17:33:46,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2019-09-08 17:33:46,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-09-08 17:33:46,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-09-08 17:33:46,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-09-08 17:33:46,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-09-08 17:33:46,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-09-08 17:33:46,207 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2019-09-08 17:33:46,207 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2019-09-08 17:33:46,207 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_drvdata [2019-09-08 17:33:46,208 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2019-09-08 17:33:46,208 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2019-09-08 17:33:46,208 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2019-09-08 17:33:46,209 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2019-09-08 17:33:46,209 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_irq [2019-09-08 17:33:46,209 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_open [2019-09-08 17:33:46,210 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_close [2019-09-08 17:33:46,210 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_probe [2019-09-08 17:33:46,210 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2019-09-08 17:33:46,211 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_init [2019-09-08 17:33:46,211 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_exit [2019-09-08 17:33:46,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_driver_1 [2019-09-08 17:33:46,212 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 17:33:46,212 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2019-09-08 17:33:46,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_register_driver_2 [2019-09-08 17:33:46,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_3 [2019-09-08 17:33:46,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_4 [2019-09-08 17:33:46,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_alloc_urb_5 [2019-09-08 17:33:46,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_int_urb_6 [2019-09-08 17:33:46,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2019-09-08 17:33:46,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_8 [2019-09-08 17:33:46,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_10 [2019-09-08 17:33:46,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_deregister_11 [2019-09-08 17:33:46,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-09-08 17:33:46,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata [2019-09-08 17:33:46,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata [2019-09-08 17:33:46,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_put_intf [2019-09-08 17:33:46,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2019-09-08 17:33:46,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2019-09-08 17:33:46,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_int_urb [2019-09-08 17:33:46,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_bulk_urb [2019-09-08 17:33:46,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2019-09-08 17:33:46,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interface_to_usbdev [2019-09-08 17:33:46,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_dev [2019-09-08 17:33:46,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_dev [2019-09-08 17:33:46,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_interface [2019-09-08 17:33:46,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_interface [2019-09-08 17:33:46,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_register [2019-09-08 17:33:46,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_deregister [2019-09-08 17:33:46,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-09-08 17:33:46,221 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-09-08 17:33:46,221 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-09-08 17:33:46,221 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2019-09-08 17:33:46,222 INFO L138 BoogieDeclarations]: Found implementation of procedure input_free_device [2019-09-08 17:33:46,222 INFO L138 BoogieDeclarations]: Found implementation of procedure input_register_device [2019-09-08 17:33:46,223 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2019-09-08 17:33:46,223 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2019-09-08 17:33:46,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-09-08 17:33:46,223 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-09-08 17:33:46,224 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2019-09-08 17:33:46,225 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2019-09-08 17:33:46,225 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2019-09-08 17:33:46,225 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2019-09-08 17:33:46,225 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-09-08 17:33:46,226 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-09-08 17:33:46,226 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2019-09-08 17:33:46,226 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2019-09-08 17:33:46,227 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-09-08 17:33:46,228 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2019-09-08 17:33:46,228 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-09-08 17:33:46,228 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-09-08 17:33:46,229 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-09-08 17:33:46,230 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-08 17:33:46,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 17:33:46,230 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-09-08 17:33:46,231 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2019-09-08 17:33:46,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 17:33:46,232 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_int [2019-09-08 17:33:46,232 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_int_in [2019-09-08 17:33:46,232 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2019-09-08 17:33:46,233 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-09-08 17:33:46,233 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-09-08 17:33:46,233 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-09-08 17:33:46,234 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-09-08 17:33:46,234 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2019-09-08 17:33:46,234 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2019-09-08 17:33:46,234 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-09-08 17:33:46,235 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-09-08 17:33:46,235 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_8 [2019-09-08 17:33:46,235 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2019-09-08 17:33:46,235 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2019-09-08 17:33:46,236 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2019-09-08 17:33:46,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 17:33:46,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 17:33:46,237 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-09-08 17:33:46,237 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_register_driver_2 [2019-09-08 17:33:46,237 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2019-09-08 17:33:46,237 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-09-08 17:33:46,238 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_deregister_11 [2019-09-08 17:33:46,238 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_int_urb_6 [2019-09-08 17:33:46,239 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2019-09-08 17:33:46,239 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_alloc_urb_5 [2019-09-08 17:33:46,239 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2019-09-08 17:33:46,239 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_10 [2019-09-08 17:33:46,240 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_3 [2019-09-08 17:33:46,240 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_4 [2019-09-08 17:33:46,240 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2019-09-08 17:33:46,241 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2019-09-08 17:33:46,241 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-09-08 17:33:46,242 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-09-08 17:33:46,242 INFO L130 BoogieDeclarations]: Found specification of procedure usb_maxpacket [2019-09-08 17:33:46,243 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2019-09-08 17:33:46,243 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2019-09-08 17:33:46,243 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_int_urb [2019-09-08 17:33:46,243 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2019-09-08 17:33:46,244 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interface_to_usbdev [2019-09-08 17:33:46,244 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata [2019-09-08 17:33:46,244 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata [2019-09-08 17:33:46,245 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-09-08 17:33:46,245 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-09-08 17:33:46,245 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-09-08 17:33:46,245 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-09-08 17:33:46,245 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-09-08 17:33:46,246 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 17:33:46,247 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-08 17:33:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 17:33:46,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-08 17:33:46,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-08 17:33:46,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 17:33:46,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 17:33:46,258 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-09-08 17:33:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-08 17:33:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-09-08 17:33:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2019-09-08 17:33:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-09-08 17:33:46,260 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-09-08 17:33:46,260 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-09-08 17:33:46,261 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-09-08 17:33:46,261 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-09-08 17:33:46,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_driver_1 [2019-09-08 17:33:46,262 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2019-09-08 17:33:46,262 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2019-09-08 17:33:46,263 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2019-09-08 17:33:46,263 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_drvdata [2019-09-08 17:33:46,263 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2019-09-08 17:33:46,263 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2019-09-08 17:33:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2019-09-08 17:33:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2019-09-08 17:33:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2019-09-08 17:33:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2019-09-08 17:33:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2019-09-08 17:33:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2019-09-08 17:33:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 17:33:46,266 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_irq [2019-09-08 17:33:46,266 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_open [2019-09-08 17:33:46,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 17:33:46,267 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_close [2019-09-08 17:33:46,267 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_probe [2019-09-08 17:33:46,267 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2019-09-08 17:33:46,267 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_init [2019-09-08 17:33:46,268 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_exit [2019-09-08 17:33:46,268 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-09-08 17:33:46,268 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-09-08 17:33:46,268 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 17:33:46,269 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-09-08 17:33:46,269 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_put_intf [2019-09-08 17:33:46,269 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_bulk_urb [2019-09-08 17:33:46,270 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-09-08 17:33:46,270 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_dev [2019-09-08 17:33:46,270 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_dev [2019-09-08 17:33:46,270 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_interface [2019-09-08 17:33:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_interface [2019-09-08 17:33:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_register [2019-09-08 17:33:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_deregister [2019-09-08 17:33:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-09-08 17:33:46,272 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 17:33:46,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 17:33:46,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 17:33:46,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 17:33:46,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-08 17:33:46,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 17:33:46,977 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-09-08 17:33:48,054 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 17:33:48,057 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 17:33:48,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:33:48 BoogieIcfgContainer [2019-09-08 17:33:48,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 17:33:48,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 17:33:48,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 17:33:48,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 17:33:48,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:33:44" (1/3) ... [2019-09-08 17:33:48,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c96baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:33:48, skipping insertion in model container [2019-09-08 17:33:48,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:33:45" (2/3) ... [2019-09-08 17:33:48,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c96baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:33:48, skipping insertion in model container [2019-09-08 17:33:48,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:33:48" (3/3) ... [2019-09-08 17:33:48,073 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-09-08 17:33:48,084 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 17:33:48,099 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 17:33:48,121 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 17:33:48,155 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 17:33:48,156 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 17:33:48,156 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 17:33:48,156 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 17:33:48,156 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 17:33:48,156 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 17:33:48,157 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 17:33:48,157 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 17:33:48,157 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 17:33:48,186 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states. [2019-09-08 17:33:48,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-08 17:33:48,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:33:48,197 INFO L399 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-08 17:33:48,199 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:33:48,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:33:48,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1810453021, now seen corresponding path program 1 times [2019-09-08 17:33:48,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:33:48,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:33:48,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:33:48,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:33:48,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:33:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:33:48,674 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-08 17:33:48,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:33:48,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 17:33:48,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 17:33:48,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 17:33:48,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:33:48,699 INFO L87 Difference]: Start difference. First operand 504 states. Second operand 3 states. [2019-09-08 17:33:48,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:33:48,921 INFO L93 Difference]: Finished difference Result 1069 states and 1276 transitions. [2019-09-08 17:33:48,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 17:33:48,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-09-08 17:33:48,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:33:48,946 INFO L225 Difference]: With dead ends: 1069 [2019-09-08 17:33:48,947 INFO L226 Difference]: Without dead ends: 678 [2019-09-08 17:33:48,953 INFO L628 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-08 17:33:48,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2019-09-08 17:33:49,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 678. [2019-09-08 17:33:49,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2019-09-08 17:33:49,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 797 transitions. [2019-09-08 17:33:49,121 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 797 transitions. Word has length 43 [2019-09-08 17:33:49,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:33:49,122 INFO L475 AbstractCegarLoop]: Abstraction has 678 states and 797 transitions. [2019-09-08 17:33:49,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 17:33:49,122 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 797 transitions. [2019-09-08 17:33:49,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 17:33:49,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:33:49,127 INFO L399 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-08 17:33:49,127 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:33:49,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:33:49,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1648833292, now seen corresponding path program 1 times [2019-09-08 17:33:49,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:33:49,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:33:49,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:33:49,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:33:49,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:33:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:33:49,369 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-08 17:33:49,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:33:49,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 17:33:49,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 17:33:49,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 17:33:49,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 17:33:49,372 INFO L87 Difference]: Start difference. First operand 678 states and 797 transitions. Second operand 6 states. [2019-09-08 17:33:49,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:33:49,544 INFO L93 Difference]: Finished difference Result 1352 states and 1593 transitions. [2019-09-08 17:33:49,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 17:33:49,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 17:33:49,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:33:49,553 INFO L225 Difference]: With dead ends: 1352 [2019-09-08 17:33:49,554 INFO L226 Difference]: Without dead ends: 694 [2019-09-08 17:33:49,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-08 17:33:49,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-09-08 17:33:49,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 683. [2019-09-08 17:33:49,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2019-09-08 17:33:49,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 801 transitions. [2019-09-08 17:33:49,636 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 801 transitions. Word has length 70 [2019-09-08 17:33:49,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:33:49,638 INFO L475 AbstractCegarLoop]: Abstraction has 683 states and 801 transitions. [2019-09-08 17:33:49,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 17:33:49,638 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 801 transitions. [2019-09-08 17:33:49,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 17:33:49,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:33:49,647 INFO L399 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-08 17:33:49,650 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:33:49,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:33:49,650 INFO L82 PathProgramCache]: Analyzing trace with hash -890510412, now seen corresponding path program 1 times [2019-09-08 17:33:49,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:33:49,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:33:49,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:33:49,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:33:49,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:33:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:33:49,761 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-08 17:33:49,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:33:49,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 17:33:49,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 17:33:49,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 17:33:49,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:33:49,763 INFO L87 Difference]: Start difference. First operand 683 states and 801 transitions. Second operand 3 states. [2019-09-08 17:33:49,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:33:49,849 INFO L93 Difference]: Finished difference Result 2002 states and 2372 transitions. [2019-09-08 17:33:49,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 17:33:49,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-08 17:33:49,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:33:49,862 INFO L225 Difference]: With dead ends: 2002 [2019-09-08 17:33:49,862 INFO L226 Difference]: Without dead ends: 1339 [2019-09-08 17:33:49,865 INFO L628 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-08 17:33:49,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2019-09-08 17:33:49,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2019-09-08 17:33:49,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-08 17:33:49,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1573 transitions. [2019-09-08 17:33:49,941 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1573 transitions. Word has length 70 [2019-09-08 17:33:49,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:33:49,942 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1573 transitions. [2019-09-08 17:33:49,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 17:33:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1573 transitions. [2019-09-08 17:33:49,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 17:33:49,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:33:49,944 INFO L399 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-08 17:33:49,944 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:33:49,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:33:49,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1836161467, now seen corresponding path program 1 times [2019-09-08 17:33:49,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:33:49,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:33:49,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:33:49,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:33:49,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:33:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:33:50,042 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-08 17:33:50,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:33:50,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 17:33:50,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 17:33:50,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 17:33:50,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:33:50,044 INFO L87 Difference]: Start difference. First operand 1337 states and 1573 transitions. Second operand 3 states. [2019-09-08 17:33:50,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:33:50,138 INFO L93 Difference]: Finished difference Result 1339 states and 1574 transitions. [2019-09-08 17:33:50,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 17:33:50,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-09-08 17:33:50,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:33:50,147 INFO L225 Difference]: With dead ends: 1339 [2019-09-08 17:33:50,148 INFO L226 Difference]: Without dead ends: 1336 [2019-09-08 17:33:50,148 INFO L628 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-08 17:33:50,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2019-09-08 17:33:50,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1336. [2019-09-08 17:33:50,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2019-09-08 17:33:50,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1571 transitions. [2019-09-08 17:33:50,220 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1571 transitions. Word has length 71 [2019-09-08 17:33:50,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:33:50,222 INFO L475 AbstractCegarLoop]: Abstraction has 1336 states and 1571 transitions. [2019-09-08 17:33:50,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 17:33:50,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1571 transitions. [2019-09-08 17:33:50,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 17:33:50,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:33:50,225 INFO L399 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-08 17:33:50,225 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:33:50,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:33:50,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1086568233, now seen corresponding path program 1 times [2019-09-08 17:33:50,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:33:50,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:33:50,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:33:50,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:33:50,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:33:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:33:50,331 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-08 17:33:50,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:33:50,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 17:33:50,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 17:33:50,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 17:33:50,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:33:50,332 INFO L87 Difference]: Start difference. First operand 1336 states and 1571 transitions. Second operand 3 states. [2019-09-08 17:33:50,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:33:50,381 INFO L93 Difference]: Finished difference Result 1338 states and 1572 transitions. [2019-09-08 17:33:50,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 17:33:50,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-09-08 17:33:50,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:33:50,389 INFO L225 Difference]: With dead ends: 1338 [2019-09-08 17:33:50,389 INFO L226 Difference]: Without dead ends: 1335 [2019-09-08 17:33:50,390 INFO L628 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-08 17:33:50,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-09-08 17:33:50,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1335. [2019-09-08 17:33:50,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1335 states. [2019-09-08 17:33:50,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1569 transitions. [2019-09-08 17:33:50,464 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1569 transitions. Word has length 72 [2019-09-08 17:33:50,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:33:50,465 INFO L475 AbstractCegarLoop]: Abstraction has 1335 states and 1569 transitions. [2019-09-08 17:33:50,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 17:33:50,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1569 transitions. [2019-09-08 17:33:50,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 17:33:50,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:33:50,467 INFO L399 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-08 17:33:50,467 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:33:50,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:33:50,467 INFO L82 PathProgramCache]: Analyzing trace with hash 675990408, now seen corresponding path program 1 times [2019-09-08 17:33:50,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:33:50,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:33:50,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:33:50,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:33:50,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:33:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:33:50,566 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-08 17:33:50,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:33:50,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 17:33:50,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 17:33:50,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 17:33:50,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:33:50,568 INFO L87 Difference]: Start difference. First operand 1335 states and 1569 transitions. Second operand 3 states. [2019-09-08 17:33:50,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:33:50,614 INFO L93 Difference]: Finished difference Result 1337 states and 1570 transitions. [2019-09-08 17:33:50,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 17:33:50,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-08 17:33:50,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:33:50,621 INFO L225 Difference]: With dead ends: 1337 [2019-09-08 17:33:50,621 INFO L226 Difference]: Without dead ends: 1316 [2019-09-08 17:33:50,622 INFO L628 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-08 17:33:50,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2019-09-08 17:33:50,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1316. [2019-09-08 17:33:50,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316 states. [2019-09-08 17:33:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1547 transitions. [2019-09-08 17:33:50,693 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1547 transitions. Word has length 73 [2019-09-08 17:33:50,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:33:50,693 INFO L475 AbstractCegarLoop]: Abstraction has 1316 states and 1547 transitions. [2019-09-08 17:33:50,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 17:33:50,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1547 transitions. [2019-09-08 17:33:50,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-08 17:33:50,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:33:50,700 INFO L399 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] [2019-09-08 17:33:50,700 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:33:50,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:33:50,700 INFO L82 PathProgramCache]: Analyzing trace with hash 870207449, now seen corresponding path program 1 times [2019-09-08 17:33:50,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:33:50,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:33:50,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:33:50,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:33:50,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:33:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:33:50,901 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-08 17:33:50,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:33:50,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 17:33:50,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 17:33:50,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 17:33:50,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 17:33:50,903 INFO L87 Difference]: Start difference. First operand 1316 states and 1547 transitions. Second operand 3 states. [2019-09-08 17:33:51,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:33:51,002 INFO L93 Difference]: Finished difference Result 2699 states and 3195 transitions. [2019-09-08 17:33:51,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 17:33:51,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-09-08 17:33:51,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:33:51,010 INFO L225 Difference]: With dead ends: 2699 [2019-09-08 17:33:51,010 INFO L226 Difference]: Without dead ends: 1403 [2019-09-08 17:33:51,014 INFO L628 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-08 17:33:51,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2019-09-08 17:33:51,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1366. [2019-09-08 17:33:51,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1366 states. [2019-09-08 17:33:51,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1618 transitions. [2019-09-08 17:33:51,087 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1618 transitions. Word has length 229 [2019-09-08 17:33:51,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:33:51,087 INFO L475 AbstractCegarLoop]: Abstraction has 1366 states and 1618 transitions. [2019-09-08 17:33:51,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 17:33:51,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1618 transitions. [2019-09-08 17:33:51,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-08 17:33:51,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:33:51,093 INFO L399 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] [2019-09-08 17:33:51,093 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:33:51,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:33:51,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1880002846, now seen corresponding path program 1 times [2019-09-08 17:33:51,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:33:51,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:33:51,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:33:51,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:33:51,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:33:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:33:51,259 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-08 17:33:51,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:33:51,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 17:33:51,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 17:33:51,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 17:33:51,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 17:33:51,261 INFO L87 Difference]: Start difference. First operand 1366 states and 1618 transitions. Second operand 6 states. [2019-09-08 17:33:51,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:33:51,377 INFO L93 Difference]: Finished difference Result 2740 states and 3254 transitions. [2019-09-08 17:33:51,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 17:33:51,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 248 [2019-09-08 17:33:51,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:33:51,389 INFO L225 Difference]: With dead ends: 2740 [2019-09-08 17:33:51,389 INFO L226 Difference]: Without dead ends: 1394 [2019-09-08 17:33:51,395 INFO L628 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-08 17:33:51,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2019-09-08 17:33:51,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1390. [2019-09-08 17:33:51,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1390 states. [2019-09-08 17:33:51,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1642 transitions. [2019-09-08 17:33:51,481 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1642 transitions. Word has length 248 [2019-09-08 17:33:51,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:33:51,481 INFO L475 AbstractCegarLoop]: Abstraction has 1390 states and 1642 transitions. [2019-09-08 17:33:51,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 17:33:51,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1642 transitions. [2019-09-08 17:33:51,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-08 17:33:51,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:33:51,492 INFO L399 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] [2019-09-08 17:33:51,492 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:33:51,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:33:51,492 INFO L82 PathProgramCache]: Analyzing trace with hash -569313577, now seen corresponding path program 1 times [2019-09-08 17:33:51,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:33:51,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:33:51,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:33:51,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:33:51,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:33:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:33:51,924 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-08 17:33:51,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 17:33:51,925 INFO L223 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-08 17:33:51,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:33:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:33:52,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 1859 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 17:33:52,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 17:33:52,583 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 35 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-08 17:33:52,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 17:33:52,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2019-09-08 17:33:52,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 17:33:52,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 17:33:52,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-08 17:33:52,597 INFO L87 Difference]: Start difference. First operand 1390 states and 1642 transitions. Second operand 15 states. [2019-09-08 17:33:53,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:33:53,587 INFO L93 Difference]: Finished difference Result 4378 states and 5214 transitions. [2019-09-08 17:33:53,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 17:33:53,587 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 254 [2019-09-08 17:33:53,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:33:53,607 INFO L225 Difference]: With dead ends: 4378 [2019-09-08 17:33:53,608 INFO L226 Difference]: Without dead ends: 3008 [2019-09-08 17:33:53,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 17:33:53,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2019-09-08 17:33:53,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 1496. [2019-09-08 17:33:53,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2019-09-08 17:33:53,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1774 transitions. [2019-09-08 17:33:53,788 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 1774 transitions. Word has length 254 [2019-09-08 17:33:53,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:33:53,789 INFO L475 AbstractCegarLoop]: Abstraction has 1496 states and 1774 transitions. [2019-09-08 17:33:53,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 17:33:53,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 1774 transitions. [2019-09-08 17:33:53,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-08 17:33:53,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:33:53,800 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:33:53,801 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:33:53,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:33:53,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1849867596, now seen corresponding path program 1 times [2019-09-08 17:33:53,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:33:53,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:33:53,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:33:53,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:33:53,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:33:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:33:54,326 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 17:33:54,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:33:54,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 17:33:54,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 17:33:54,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 17:33:54,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 17:33:54,329 INFO L87 Difference]: Start difference. First operand 1496 states and 1774 transitions. Second operand 13 states. [2019-09-08 17:33:54,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:33:54,505 INFO L93 Difference]: Finished difference Result 3030 states and 3618 transitions. [2019-09-08 17:33:54,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 17:33:54,506 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 254 [2019-09-08 17:33:54,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:33:54,516 INFO L225 Difference]: With dead ends: 3030 [2019-09-08 17:33:54,516 INFO L226 Difference]: Without dead ends: 1554 [2019-09-08 17:33:54,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 17:33:54,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2019-09-08 17:33:54,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1508. [2019-09-08 17:33:54,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2019-09-08 17:33:54,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1790 transitions. [2019-09-08 17:33:54,663 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 1790 transitions. Word has length 254 [2019-09-08 17:33:54,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:33:54,665 INFO L475 AbstractCegarLoop]: Abstraction has 1508 states and 1790 transitions. [2019-09-08 17:33:54,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 17:33:54,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 1790 transitions. [2019-09-08 17:33:54,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-08 17:33:54,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:33:54,674 INFO L399 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] [2019-09-08 17:33:54,675 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:33:54,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:33:54,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1864117741, now seen corresponding path program 1 times [2019-09-08 17:33:54,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:33:54,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:33:54,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:33:54,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:33:54,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:33:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:33:55,073 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-08 17:33:55,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:33:55,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 17:33:55,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 17:33:55,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 17:33:55,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 17:33:55,075 INFO L87 Difference]: Start difference. First operand 1508 states and 1790 transitions. Second operand 8 states. [2019-09-08 17:33:55,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:33:55,234 INFO L93 Difference]: Finished difference Result 2280 states and 2708 transitions. [2019-09-08 17:33:55,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 17:33:55,235 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 254 [2019-09-08 17:33:55,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:33:55,243 INFO L225 Difference]: With dead ends: 2280 [2019-09-08 17:33:55,243 INFO L226 Difference]: Without dead ends: 1522 [2019-09-08 17:33:55,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 17:33:55,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2019-09-08 17:33:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1512. [2019-09-08 17:33:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2019-09-08 17:33:55,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1788 transitions. [2019-09-08 17:33:55,330 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1788 transitions. Word has length 254 [2019-09-08 17:33:55,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:33:55,331 INFO L475 AbstractCegarLoop]: Abstraction has 1512 states and 1788 transitions. [2019-09-08 17:33:55,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 17:33:55,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1788 transitions. [2019-09-08 17:33:55,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-08 17:33:55,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:33:55,339 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 17:33:55,339 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:33:55,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:33:55,339 INFO L82 PathProgramCache]: Analyzing trace with hash -443999738, now seen corresponding path program 1 times [2019-09-08 17:33:55,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:33:55,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:33:55,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:33:55,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:33:55,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:33:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:33:55,701 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 17:33:55,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 17:33:55,701 INFO L223 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-08 17:33:55,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:33:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:33:56,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 2235 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 17:33:56,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 17:33:56,488 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 17:33:56,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 17:33:56,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-09-08 17:33:56,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 17:33:56,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 17:33:56,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 17:33:56,514 INFO L87 Difference]: Start difference. First operand 1512 states and 1788 transitions. Second operand 5 states. [2019-09-08 17:33:57,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:33:57,706 INFO L93 Difference]: Finished difference Result 5967 states and 7070 transitions. [2019-09-08 17:33:57,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 17:33:57,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 310 [2019-09-08 17:33:57,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:33:57,740 INFO L225 Difference]: With dead ends: 5967 [2019-09-08 17:33:57,740 INFO L226 Difference]: Without dead ends: 5949 [2019-09-08 17:33:57,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 310 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-08 17:33:57,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2019-09-08 17:33:58,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 4456. [2019-09-08 17:33:58,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4456 states. [2019-09-08 17:33:58,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4456 states to 4456 states and 5284 transitions. [2019-09-08 17:33:58,069 INFO L78 Accepts]: Start accepts. Automaton has 4456 states and 5284 transitions. Word has length 310 [2019-09-08 17:33:58,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:33:58,069 INFO L475 AbstractCegarLoop]: Abstraction has 4456 states and 5284 transitions. [2019-09-08 17:33:58,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 17:33:58,070 INFO L276 IsEmpty]: Start isEmpty. Operand 4456 states and 5284 transitions. [2019-09-08 17:33:58,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-08 17:33:58,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:33:58,083 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 17:33:58,083 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:33:58,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:33:58,084 INFO L82 PathProgramCache]: Analyzing trace with hash -578013244, now seen corresponding path program 1 times [2019-09-08 17:33:58,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:33:58,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:33:58,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:33:58,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:33:58,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:33:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:33:58,295 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 17:33:58,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 17:33:58,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 17:33:58,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 17:33:58,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 17:33:58,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 17:33:58,297 INFO L87 Difference]: Start difference. First operand 4456 states and 5284 transitions. Second operand 5 states. [2019-09-08 17:33:58,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 17:33:58,698 INFO L93 Difference]: Finished difference Result 13388 states and 15884 transitions. [2019-09-08 17:33:58,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 17:33:58,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 310 [2019-09-08 17:33:58,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 17:33:58,767 INFO L225 Difference]: With dead ends: 13388 [2019-09-08 17:33:58,767 INFO L226 Difference]: Without dead ends: 8952 [2019-09-08 17:33:58,789 INFO L628 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-08 17:33:58,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8952 states. [2019-09-08 17:33:59,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8952 to 4496. [2019-09-08 17:33:59,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4496 states. [2019-09-08 17:33:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4496 states to 4496 states and 5330 transitions. [2019-09-08 17:33:59,171 INFO L78 Accepts]: Start accepts. Automaton has 4496 states and 5330 transitions. Word has length 310 [2019-09-08 17:33:59,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 17:33:59,175 INFO L475 AbstractCegarLoop]: Abstraction has 4496 states and 5330 transitions. [2019-09-08 17:33:59,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 17:33:59,175 INFO L276 IsEmpty]: Start isEmpty. Operand 4496 states and 5330 transitions. [2019-09-08 17:33:59,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-08 17:33:59,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 17:33:59,190 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-09-08 17:33:59,191 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 17:33:59,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 17:33:59,191 INFO L82 PathProgramCache]: Analyzing trace with hash -955300130, now seen corresponding path program 1 times [2019-09-08 17:33:59,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 17:33:59,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 17:33:59,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:33:59,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 17:33:59,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 17:33:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 17:33:59,741 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Function const is already defined. at de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:139) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:113) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.WrapperScript.declareFun(WrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.TermTransferrer.convertApplicationTerm(TermTransferrer.java:172) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:319) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:173) 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:232) 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:453) 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-08 17:33:59,747 INFO L168 Benchmark]: Toolchain (without parser) took 15300.42 ms. Allocated memory was 134.7 MB in the beginning and 663.2 MB in the end (delta: 528.5 MB). Free memory was 83.6 MB in the beginning and 538.5 MB in the end (delta: -454.9 MB). Peak memory consumption was 73.6 MB. Max. memory is 7.1 GB. [2019-09-08 17:33:59,748 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 134.7 MB. Free memory was 107.9 MB in the beginning and 107.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-09-08 17:33:59,748 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1408.12 ms. Allocated memory was 134.7 MB in the beginning and 220.2 MB in the end (delta: 85.5 MB). Free memory was 83.4 MB in the beginning and 138.5 MB in the end (delta: -55.0 MB). Peak memory consumption was 37.7 MB. Max. memory is 7.1 GB. [2019-09-08 17:33:59,749 INFO L168 Benchmark]: Boogie Preprocessor took 238.91 ms. Allocated memory is still 220.2 MB. Free memory was 138.5 MB in the beginning and 129.9 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. [2019-09-08 17:33:59,750 INFO L168 Benchmark]: RCFGBuilder took 1966.39 ms. Allocated memory was 220.2 MB in the beginning and 263.2 MB in the end (delta: 43.0 MB). Free memory was 129.9 MB in the beginning and 122.0 MB in the end (delta: 7.9 MB). Peak memory consumption was 68.5 MB. Max. memory is 7.1 GB. [2019-09-08 17:33:59,751 INFO L168 Benchmark]: TraceAbstraction took 11682.66 ms. Allocated memory was 263.2 MB in the beginning and 663.2 MB in the end (delta: 400.0 MB). Free memory was 122.0 MB in the beginning and 538.5 MB in the end (delta: -416.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-09-08 17:33:59,754 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.21 ms. Allocated memory is still 134.7 MB. Free memory was 107.9 MB in the beginning and 107.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1408.12 ms. Allocated memory was 134.7 MB in the beginning and 220.2 MB in the end (delta: 85.5 MB). Free memory was 83.4 MB in the beginning and 138.5 MB in the end (delta: -55.0 MB). Peak memory consumption was 37.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 238.91 ms. Allocated memory is still 220.2 MB. Free memory was 138.5 MB in the beginning and 129.9 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1966.39 ms. Allocated memory was 220.2 MB in the beginning and 263.2 MB in the end (delta: 43.0 MB). Free memory was 129.9 MB in the beginning and 122.0 MB in the end (delta: 7.9 MB). Peak memory consumption was 68.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11682.66 ms. Allocated memory was 263.2 MB in the beginning and 663.2 MB in the end (delta: 400.0 MB). Free memory was 122.0 MB in the beginning and 538.5 MB in the end (delta: -416.6 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Function const is already defined. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Function const is already defined.: de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:139) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...