./Ultimate.py --spec ../../sv-benchmarks/c/Systems_DeviceDriversLinux64_ReachSafety.prp --file ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i.pp.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_62eec631-97ea-43d8-a703-383b0e349194/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_62eec631-97ea-43d8-a703-383b0e349194/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_62eec631-97ea-43d8-a703-383b0e349194/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_62eec631-97ea-43d8-a703-383b0e349194/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i.pp.i -s /tmp/vcloud-vcloud-master/worker/working_dir_62eec631-97ea-43d8-a703-383b0e349194/bin-2019/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_62eec631-97ea-43d8-a703-383b0e349194/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c4ab3a1b7a928c9fbfa3f31e196dab10da7fc09a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:51:42,649 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:51:42,650 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:51:42,659 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:51:42,659 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:51:42,660 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:51:42,660 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:51:42,662 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:51:42,663 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:51:42,663 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:51:42,664 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:51:42,664 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:51:42,665 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:51:42,666 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:51:42,666 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:51:42,667 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:51:42,668 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:51:42,669 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:51:42,670 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:51:42,671 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:51:42,672 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:51:42,673 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:51:42,675 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:51:42,675 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:51:42,675 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:51:42,676 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:51:42,676 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:51:42,677 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:51:42,677 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:51:42,678 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:51:42,678 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:51:42,679 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:51:42,679 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:51:42,679 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:51:42,680 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:51:42,680 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:51:42,681 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_62eec631-97ea-43d8-a703-383b0e349194/bin-2019/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-10 10:51:42,690 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:51:42,690 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:51:42,691 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:51:42,691 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 10:51:42,691 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:51:42,691 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:51:42,692 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:51:42,692 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:51:42,692 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:51:42,692 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:51:42,692 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:51:42,692 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:51:42,693 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:51:42,693 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:51:42,693 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:51:42,693 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:51:42,693 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:51:42,693 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:51:42,693 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:51:42,694 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:51:42,694 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:51:42,694 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:51:42,694 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:51:42,694 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 10:51:42,694 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:51:42,695 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 10:51:42,695 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 10:51:42,695 INFO L133 SettingsManager]: * To the following directory=dump/ Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_62eec631-97ea-43d8-a703-383b0e349194/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c4ab3a1b7a928c9fbfa3f31e196dab10da7fc09a [2018-11-10 10:51:42,719 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:51:42,727 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:51:42,729 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:51:42,729 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:51:42,730 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:51:42,730 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_62eec631-97ea-43d8-a703-383b0e349194/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i.pp.i [2018-11-10 10:51:42,765 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_62eec631-97ea-43d8-a703-383b0e349194/bin-2019/uautomizer/data/014dff59a/776d5c753c6042948e1c4942bbbb5cf2/FLAG577330e9f [2018-11-10 10:51:43,288 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:51:43,288 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_62eec631-97ea-43d8-a703-383b0e349194/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i.pp.i [2018-11-10 10:51:43,306 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_62eec631-97ea-43d8-a703-383b0e349194/bin-2019/uautomizer/data/014dff59a/776d5c753c6042948e1c4942bbbb5cf2/FLAG577330e9f [2018-11-10 10:51:43,318 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_62eec631-97ea-43d8-a703-383b0e349194/bin-2019/uautomizer/data/014dff59a/776d5c753c6042948e1c4942bbbb5cf2 [2018-11-10 10:51:43,320 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:51:43,322 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 10:51:43,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:51:43,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:51:43,325 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:51:43,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:51:43" (1/1) ... [2018-11-10 10:51:43,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fb1b2c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:51:43, skipping insertion in model container [2018-11-10 10:51:43,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:51:43" (1/1) ... [2018-11-10 10:51:43,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:51:43,386 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:51:43,958 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:51:44,084 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:51:44,241 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:51:44,281 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:51:44,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:51:44 WrapperNode [2018-11-10 10:51:44,282 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:51:44,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:51:44,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:51:44,283 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:51:44,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:51:44" (1/1) ... [2018-11-10 10:51:44,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:51:44" (1/1) ... [2018-11-10 10:51:44,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:51:44" (1/1) ... [2018-11-10 10:51:44,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:51:44" (1/1) ... [2018-11-10 10:51:44,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:51:44" (1/1) ... [2018-11-10 10:51:44,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:51:44" (1/1) ... [2018-11-10 10:51:44,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:51:44" (1/1) ... [2018-11-10 10:51:44,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:51:44,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:51:44,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:51:44,360 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:51:44,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:51:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_62eec631-97ea-43d8-a703-383b0e349194/bin-2019/uautomizer/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 [2018-11-10 10:51:44,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:51:44,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:51:44,420 INFO L138 BoogieDeclarations]: Found implementation of procedure __le16_to_cpup [2018-11-10 10:51:44,420 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2018-11-10 10:51:44,420 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2018-11-10 10:51:44,421 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2018-11-10 10:51:44,421 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2018-11-10 10:51:44,421 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2018-11-10 10:51:44,421 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2018-11-10 10:51:44,421 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2018-11-10 10:51:44,421 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2018-11-10 10:51:44,421 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2018-11-10 10:51:44,421 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2018-11-10 10:51:44,421 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2018-11-10 10:51:44,422 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_drvdata [2018-11-10 10:51:44,422 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2018-11-10 10:51:44,422 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2018-11-10 10:51:44,422 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2018-11-10 10:51:44,422 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2018-11-10 10:51:44,422 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_le16 [2018-11-10 10:51:44,422 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_irq [2018-11-10 10:51:44,422 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_open [2018-11-10 10:51:44,423 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_close [2018-11-10 10:51:44,423 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_probe [2018-11-10 10:51:44,423 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_disconnect [2018-11-10 10:51:44,423 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2018-11-10 10:51:44,423 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2018-11-10 10:51:44,423 INFO L138 BoogieDeclarations]: Found implementation of procedure init_module [2018-11-10 10:51:44,423 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup_module [2018-11-10 10:51:44,423 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:51:44,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2018-11-10 10:51:44,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2018-11-10 10:51:44,424 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2018-11-10 10:51:44,424 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2018-11-10 10:51:44,424 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2018-11-10 10:51:44,424 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2018-11-10 10:51:44,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-11-10 10:51:44,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 10:51:44,424 INFO L130 BoogieDeclarations]: Found specification of procedure __le16_to_cpup [2018-11-10 10:51:44,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 10:51:44,425 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2018-11-10 10:51:44,425 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2018-11-10 10:51:44,425 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2018-11-10 10:51:44,425 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2018-11-10 10:51:44,425 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2018-11-10 10:51:44,425 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2018-11-10 10:51:44,425 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2018-11-10 10:51:44,425 INFO L130 BoogieDeclarations]: Found specification of procedure init_module [2018-11-10 10:51:44,426 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup_module [2018-11-10 10:51:44,426 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2018-11-10 10:51:44,426 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2018-11-10 10:51:44,426 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2018-11-10 10:51:44,426 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2018-11-10 10:51:44,426 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2018-11-10 10:51:44,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 10:51:44,426 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2018-11-10 10:51:44,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 10:51:44,427 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2018-11-10 10:51:44,427 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2018-11-10 10:51:44,427 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2018-11-10 10:51:44,427 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2018-11-10 10:51:44,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 10:51:44,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 10:51:44,427 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2018-11-10 10:51:44,427 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2018-11-10 10:51:44,428 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2018-11-10 10:51:44,428 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2018-11-10 10:51:44,428 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2018-11-10 10:51:44,428 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2018-11-10 10:51:44,428 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2018-11-10 10:51:44,428 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2018-11-10 10:51:44,428 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2018-11-10 10:51:44,428 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2018-11-10 10:51:44,428 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_drvdata [2018-11-10 10:51:44,429 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2018-11-10 10:51:44,429 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2018-11-10 10:51:44,429 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2018-11-10 10:51:44,429 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2018-11-10 10:51:44,429 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2018-11-10 10:51:44,429 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2018-11-10 10:51:44,429 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2018-11-10 10:51:44,429 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2018-11-10 10:51:44,429 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_le16 [2018-11-10 10:51:44,430 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_irq [2018-11-10 10:51:44,430 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_open [2018-11-10 10:51:44,430 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_close [2018-11-10 10:51:44,430 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_probe [2018-11-10 10:51:44,430 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_disconnect [2018-11-10 10:51:44,430 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2018-11-10 10:51:44,430 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2018-11-10 10:51:44,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-11-10 10:51:44,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2018-11-10 10:51:44,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-11-10 10:51:44,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 10:51:44,431 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:51:44,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2018-11-10 10:51:44,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2018-11-10 10:51:44,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2018-11-10 10:51:44,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:51:44,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-10 10:51:44,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:51:44,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 10:51:44,771 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 10:51:44,771 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 10:51:45,025 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 10:51:45,026 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 10:51:45,369 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:51:45,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:51:45 BoogieIcfgContainer [2018-11-10 10:51:45,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:51:45,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:51:45,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:51:45,374 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:51:45,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:51:43" (1/3) ... [2018-11-10 10:51:45,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e3942d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:51:45, skipping insertion in model container [2018-11-10 10:51:45,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:51:44" (2/3) ... [2018-11-10 10:51:45,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e3942d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:51:45, skipping insertion in model container [2018-11-10 10:51:45,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:51:45" (3/3) ... [2018-11-10 10:51:45,378 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i.pp.i [2018-11-10 10:51:45,385 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:51:45,392 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 10:51:45,402 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 10:51:45,426 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:51:45,427 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:51:45,427 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 10:51:45,427 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:51:45,427 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:51:45,427 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:51:45,428 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:51:45,428 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:51:45,428 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:51:45,448 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states. [2018-11-10 10:51:45,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 10:51:45,457 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:51:45,458 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:51:45,461 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:51:45,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:51:45,466 INFO L82 PathProgramCache]: Analyzing trace with hash -547237650, now seen corresponding path program 1 times [2018-11-10 10:51:45,468 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:51:45,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:51:45,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:45,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:51:45,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:51:45,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:51:45,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:51:45,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:51:45,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:51:45,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:51:45,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:51:45,845 INFO L87 Difference]: Start difference. First operand 368 states. Second operand 3 states. [2018-11-10 10:51:45,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:51:45,948 INFO L93 Difference]: Finished difference Result 852 states and 995 transitions. [2018-11-10 10:51:45,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:51:45,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-11-10 10:51:45,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:51:45,963 INFO L225 Difference]: With dead ends: 852 [2018-11-10 10:51:45,963 INFO L226 Difference]: Without dead ends: 585 [2018-11-10 10:51:45,969 INFO L605 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 [2018-11-10 10:51:45,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-11-10 10:51:46,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 581. [2018-11-10 10:51:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 581 states. [2018-11-10 10:51:46,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 634 transitions. [2018-11-10 10:51:46,042 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 634 transitions. Word has length 113 [2018-11-10 10:51:46,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:51:46,043 INFO L481 AbstractCegarLoop]: Abstraction has 581 states and 634 transitions. [2018-11-10 10:51:46,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:51:46,043 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 634 transitions. [2018-11-10 10:51:46,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-10 10:51:46,044 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:51:46,044 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:51:46,045 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:51:46,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:51:46,045 INFO L82 PathProgramCache]: Analyzing trace with hash 215361608, now seen corresponding path program 1 times [2018-11-10 10:51:46,046 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:51:46,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:51:46,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:46,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:51:46,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:51:46,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:51:46,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:51:46,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:51:46,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:51:46,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:51:46,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:51:46,242 INFO L87 Difference]: Start difference. First operand 581 states and 634 transitions. Second operand 3 states. [2018-11-10 10:51:46,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:51:46,291 INFO L93 Difference]: Finished difference Result 1522 states and 1691 transitions. [2018-11-10 10:51:46,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:51:46,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2018-11-10 10:51:46,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:51:46,300 INFO L225 Difference]: With dead ends: 1522 [2018-11-10 10:51:46,300 INFO L226 Difference]: Without dead ends: 1043 [2018-11-10 10:51:46,303 INFO L605 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 [2018-11-10 10:51:46,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2018-11-10 10:51:46,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1036. [2018-11-10 10:51:46,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2018-11-10 10:51:46,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1140 transitions. [2018-11-10 10:51:46,341 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1140 transitions. Word has length 114 [2018-11-10 10:51:46,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:51:46,342 INFO L481 AbstractCegarLoop]: Abstraction has 1036 states and 1140 transitions. [2018-11-10 10:51:46,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:51:46,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1140 transitions. [2018-11-10 10:51:46,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-10 10:51:46,344 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:51:46,344 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:51:46,344 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:51:46,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:51:46,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1649449217, now seen corresponding path program 1 times [2018-11-10 10:51:46,345 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:51:46,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:51:46,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:46,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:51:46,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:51:46,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:51:46,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:51:46,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:51:46,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:51:46,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:51:46,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:51:46,455 INFO L87 Difference]: Start difference. First operand 1036 states and 1140 transitions. Second operand 3 states. [2018-11-10 10:51:46,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:51:46,508 INFO L93 Difference]: Finished difference Result 2003 states and 2233 transitions. [2018-11-10 10:51:46,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:51:46,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2018-11-10 10:51:46,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:51:46,512 INFO L225 Difference]: With dead ends: 2003 [2018-11-10 10:51:46,512 INFO L226 Difference]: Without dead ends: 1075 [2018-11-10 10:51:46,514 INFO L605 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 [2018-11-10 10:51:46,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2018-11-10 10:51:46,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1075. [2018-11-10 10:51:46,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2018-11-10 10:51:46,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1190 transitions. [2018-11-10 10:51:46,539 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1190 transitions. Word has length 145 [2018-11-10 10:51:46,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:51:46,539 INFO L481 AbstractCegarLoop]: Abstraction has 1075 states and 1190 transitions. [2018-11-10 10:51:46,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:51:46,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1190 transitions. [2018-11-10 10:51:46,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-10 10:51:46,542 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:51:46,543 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 10:51:46,543 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:51:46,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:51:46,543 INFO L82 PathProgramCache]: Analyzing trace with hash 62746175, now seen corresponding path program 1 times [2018-11-10 10:51:46,543 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:51:46,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:51:46,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:46,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:51:46,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:51:46,709 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 10:51:46,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:51:46,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:51:46,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:51:46,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:51:46,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:51:46,711 INFO L87 Difference]: Start difference. First operand 1075 states and 1190 transitions. Second operand 7 states. [2018-11-10 10:51:46,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:51:46,936 INFO L93 Difference]: Finished difference Result 1733 states and 1941 transitions. [2018-11-10 10:51:46,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:51:46,937 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 185 [2018-11-10 10:51:46,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:51:46,941 INFO L225 Difference]: With dead ends: 1733 [2018-11-10 10:51:46,942 INFO L226 Difference]: Without dead ends: 1241 [2018-11-10 10:51:46,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:51:46,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2018-11-10 10:51:46,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1223. [2018-11-10 10:51:46,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2018-11-10 10:51:46,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1362 transitions. [2018-11-10 10:51:46,974 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1362 transitions. Word has length 185 [2018-11-10 10:51:46,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:51:46,975 INFO L481 AbstractCegarLoop]: Abstraction has 1223 states and 1362 transitions. [2018-11-10 10:51:46,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:51:46,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1362 transitions. [2018-11-10 10:51:46,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-10 10:51:46,977 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:51:46,977 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 10:51:46,978 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:51:46,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:51:46,978 INFO L82 PathProgramCache]: Analyzing trace with hash -299323243, now seen corresponding path program 1 times [2018-11-10 10:51:46,978 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:51:46,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:51:46,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:46,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:51:46,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:51:47,115 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 10:51:47,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:51:47,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:51:47,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:51:47,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:51:47,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:51:47,117 INFO L87 Difference]: Start difference. First operand 1223 states and 1362 transitions. Second operand 7 states. [2018-11-10 10:51:47,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:51:47,273 INFO L93 Difference]: Finished difference Result 1866 states and 2084 transitions. [2018-11-10 10:51:47,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:51:47,273 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 192 [2018-11-10 10:51:47,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:51:47,276 INFO L225 Difference]: With dead ends: 1866 [2018-11-10 10:51:47,276 INFO L226 Difference]: Without dead ends: 752 [2018-11-10 10:51:47,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:51:47,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2018-11-10 10:51:47,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 737. [2018-11-10 10:51:47,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-11-10 10:51:47,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 809 transitions. [2018-11-10 10:51:47,299 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 809 transitions. Word has length 192 [2018-11-10 10:51:47,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:51:47,299 INFO L481 AbstractCegarLoop]: Abstraction has 737 states and 809 transitions. [2018-11-10 10:51:47,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:51:47,300 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 809 transitions. [2018-11-10 10:51:47,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-10 10:51:47,301 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:51:47,301 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 10:51:47,302 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:51:47,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:51:47,302 INFO L82 PathProgramCache]: Analyzing trace with hash 51476694, now seen corresponding path program 1 times [2018-11-10 10:51:47,302 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:51:47,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:51:47,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:47,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:51:47,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:51:47,486 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 10:51:47,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:51:47,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:51:47,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:51:47,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:51:47,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:51:47,487 INFO L87 Difference]: Start difference. First operand 737 states and 809 transitions. Second operand 6 states. [2018-11-10 10:51:48,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:51:48,119 INFO L93 Difference]: Finished difference Result 1274 states and 1412 transitions. [2018-11-10 10:51:48,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 10:51:48,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 192 [2018-11-10 10:51:48,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:51:48,123 INFO L225 Difference]: With dead ends: 1274 [2018-11-10 10:51:48,123 INFO L226 Difference]: Without dead ends: 1271 [2018-11-10 10:51:48,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:51:48,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2018-11-10 10:51:48,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1241. [2018-11-10 10:51:48,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2018-11-10 10:51:48,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1380 transitions. [2018-11-10 10:51:48,155 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1380 transitions. Word has length 192 [2018-11-10 10:51:48,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:51:48,156 INFO L481 AbstractCegarLoop]: Abstraction has 1241 states and 1380 transitions. [2018-11-10 10:51:48,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:51:48,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1380 transitions. [2018-11-10 10:51:48,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-10 10:51:48,158 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:51:48,158 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 10:51:48,158 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:51:48,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:51:48,158 INFO L82 PathProgramCache]: Analyzing trace with hash -915479752, now seen corresponding path program 1 times [2018-11-10 10:51:48,158 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:51:48,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:51:48,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:48,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:51:48,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:51:48,262 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 10:51:48,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:51:48,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:51:48,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:51:48,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:51:48,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:51:48,263 INFO L87 Difference]: Start difference. First operand 1241 states and 1380 transitions. Second operand 6 states. [2018-11-10 10:51:48,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:51:48,330 INFO L93 Difference]: Finished difference Result 2385 states and 2676 transitions. [2018-11-10 10:51:48,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:51:48,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 198 [2018-11-10 10:51:48,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:51:48,334 INFO L225 Difference]: With dead ends: 2385 [2018-11-10 10:51:48,334 INFO L226 Difference]: Without dead ends: 1239 [2018-11-10 10:51:48,336 INFO L605 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 [2018-11-10 10:51:48,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2018-11-10 10:51:48,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1216. [2018-11-10 10:51:48,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2018-11-10 10:51:48,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1362 transitions. [2018-11-10 10:51:48,371 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1362 transitions. Word has length 198 [2018-11-10 10:51:48,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:51:48,372 INFO L481 AbstractCegarLoop]: Abstraction has 1216 states and 1362 transitions. [2018-11-10 10:51:48,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:51:48,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1362 transitions. [2018-11-10 10:51:48,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-11-10 10:51:48,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:51:48,374 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 10:51:48,374 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:51:48,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:51:48,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1036763398, now seen corresponding path program 1 times [2018-11-10 10:51:48,375 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:51:48,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:51:48,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:48,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:51:48,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:51:48,489 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 10:51:48,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:51:48,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:51:48,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:51:48,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:51:48,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:51:48,490 INFO L87 Difference]: Start difference. First operand 1216 states and 1362 transitions. Second operand 3 states. [2018-11-10 10:51:48,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:51:48,522 INFO L93 Difference]: Finished difference Result 2214 states and 2508 transitions. [2018-11-10 10:51:48,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:51:48,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2018-11-10 10:51:48,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:51:48,526 INFO L225 Difference]: With dead ends: 2214 [2018-11-10 10:51:48,526 INFO L226 Difference]: Without dead ends: 1152 [2018-11-10 10:51:48,529 INFO L605 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 [2018-11-10 10:51:48,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2018-11-10 10:51:48,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1152. [2018-11-10 10:51:48,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2018-11-10 10:51:48,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1277 transitions. [2018-11-10 10:51:48,558 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1277 transitions. Word has length 208 [2018-11-10 10:51:48,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:51:48,558 INFO L481 AbstractCegarLoop]: Abstraction has 1152 states and 1277 transitions. [2018-11-10 10:51:48,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:51:48,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1277 transitions. [2018-11-10 10:51:48,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-10 10:51:48,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:51:48,561 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 10:51:48,561 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:51:48,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:51:48,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1835412245, now seen corresponding path program 1 times [2018-11-10 10:51:48,561 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:51:48,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:51:48,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:48,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:51:48,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:51:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 10:51:48,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:51:48,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:51:48,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:51:48,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:51:48,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:51:48,694 INFO L87 Difference]: Start difference. First operand 1152 states and 1277 transitions. Second operand 6 states. [2018-11-10 10:51:48,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:51:48,882 INFO L93 Difference]: Finished difference Result 1220 states and 1352 transitions. [2018-11-10 10:51:48,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:51:48,883 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2018-11-10 10:51:48,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:51:48,886 INFO L225 Difference]: With dead ends: 1220 [2018-11-10 10:51:48,886 INFO L226 Difference]: Without dead ends: 1178 [2018-11-10 10:51:48,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:51:48,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2018-11-10 10:51:48,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1164. [2018-11-10 10:51:48,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1164 states. [2018-11-10 10:51:48,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1286 transitions. [2018-11-10 10:51:48,954 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1286 transitions. Word has length 210 [2018-11-10 10:51:48,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:51:48,954 INFO L481 AbstractCegarLoop]: Abstraction has 1164 states and 1286 transitions. [2018-11-10 10:51:48,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:51:48,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1286 transitions. [2018-11-10 10:51:48,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-10 10:51:48,956 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:51:48,956 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 10:51:48,957 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:51:48,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:51:48,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1393110934, now seen corresponding path program 1 times [2018-11-10 10:51:48,957 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:51:48,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:51:48,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:48,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:51:48,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:51:49,098 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 10:51:49,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:51:49,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:51:49,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:51:49,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:51:49,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:51:49,100 INFO L87 Difference]: Start difference. First operand 1164 states and 1286 transitions. Second operand 6 states. [2018-11-10 10:51:49,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:51:49,152 INFO L93 Difference]: Finished difference Result 2224 states and 2467 transitions. [2018-11-10 10:51:49,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:51:49,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2018-11-10 10:51:49,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:51:49,156 INFO L225 Difference]: With dead ends: 2224 [2018-11-10 10:51:49,156 INFO L226 Difference]: Without dead ends: 1164 [2018-11-10 10:51:49,159 INFO L605 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 [2018-11-10 10:51:49,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2018-11-10 10:51:49,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1164. [2018-11-10 10:51:49,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1164 states. [2018-11-10 10:51:49,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1285 transitions. [2018-11-10 10:51:49,189 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1285 transitions. Word has length 211 [2018-11-10 10:51:49,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:51:49,190 INFO L481 AbstractCegarLoop]: Abstraction has 1164 states and 1285 transitions. [2018-11-10 10:51:49,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:51:49,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1285 transitions. [2018-11-10 10:51:49,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-10 10:51:49,192 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:51:49,192 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 10:51:49,193 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:51:49,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:51:49,193 INFO L82 PathProgramCache]: Analyzing trace with hash 928690984, now seen corresponding path program 1 times [2018-11-10 10:51:49,193 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:51:49,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:51:49,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:49,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:51:49,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:51:49,409 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 10:51:49,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:51:49,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 10:51:49,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 10:51:49,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 10:51:49,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:51:49,411 INFO L87 Difference]: Start difference. First operand 1164 states and 1285 transitions. Second operand 8 states. [2018-11-10 10:51:50,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:51:50,014 INFO L93 Difference]: Finished difference Result 2133 states and 2471 transitions. [2018-11-10 10:51:50,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 10:51:50,014 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 211 [2018-11-10 10:51:50,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:51:50,019 INFO L225 Difference]: With dead ends: 2133 [2018-11-10 10:51:50,019 INFO L226 Difference]: Without dead ends: 1564 [2018-11-10 10:51:50,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-10 10:51:50,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2018-11-10 10:51:50,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1349. [2018-11-10 10:51:50,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1349 states. [2018-11-10 10:51:50,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1498 transitions. [2018-11-10 10:51:50,066 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1498 transitions. Word has length 211 [2018-11-10 10:51:50,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:51:50,066 INFO L481 AbstractCegarLoop]: Abstraction has 1349 states and 1498 transitions. [2018-11-10 10:51:50,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 10:51:50,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1498 transitions. [2018-11-10 10:51:50,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-11-10 10:51:50,069 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:51:50,069 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:51:50,069 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:51:50,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:51:50,069 INFO L82 PathProgramCache]: Analyzing trace with hash -743720003, now seen corresponding path program 1 times [2018-11-10 10:51:50,070 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:51:50,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:51:50,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:50,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:51:50,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:51:50,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 10:51:50,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:51:50,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:51:50,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:51:50,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:51:50,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:51:50,259 INFO L87 Difference]: Start difference. First operand 1349 states and 1498 transitions. Second operand 6 states. [2018-11-10 10:51:50,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:51:50,389 INFO L93 Difference]: Finished difference Result 2011 states and 2238 transitions. [2018-11-10 10:51:50,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:51:50,390 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 284 [2018-11-10 10:51:50,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:51:50,392 INFO L225 Difference]: With dead ends: 2011 [2018-11-10 10:51:50,392 INFO L226 Difference]: Without dead ends: 792 [2018-11-10 10:51:50,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:51:50,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2018-11-10 10:51:50,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 792. [2018-11-10 10:51:50,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2018-11-10 10:51:50,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 867 transitions. [2018-11-10 10:51:50,414 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 867 transitions. Word has length 284 [2018-11-10 10:51:50,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:51:50,415 INFO L481 AbstractCegarLoop]: Abstraction has 792 states and 867 transitions. [2018-11-10 10:51:50,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:51:50,415 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 867 transitions. [2018-11-10 10:51:50,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-11-10 10:51:50,417 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:51:50,417 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:51:50,418 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:51:50,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:51:50,418 INFO L82 PathProgramCache]: Analyzing trace with hash 338088284, now seen corresponding path program 1 times [2018-11-10 10:51:50,418 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:51:50,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:51:50,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:50,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:51:50,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:51:50,572 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 10:51:50,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:51:50,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:51:50,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:51:50,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:51:50,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:51:50,573 INFO L87 Difference]: Start difference. First operand 792 states and 867 transitions. Second operand 6 states. [2018-11-10 10:51:51,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:51:51,042 INFO L93 Difference]: Finished difference Result 1221 states and 1350 transitions. [2018-11-10 10:51:51,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 10:51:51,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 284 [2018-11-10 10:51:51,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:51:51,046 INFO L225 Difference]: With dead ends: 1221 [2018-11-10 10:51:51,046 INFO L226 Difference]: Without dead ends: 1216 [2018-11-10 10:51:51,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:51:51,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2018-11-10 10:51:51,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1174. [2018-11-10 10:51:51,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2018-11-10 10:51:51,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1303 transitions. [2018-11-10 10:51:51,085 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1303 transitions. Word has length 284 [2018-11-10 10:51:51,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:51:51,086 INFO L481 AbstractCegarLoop]: Abstraction has 1174 states and 1303 transitions. [2018-11-10 10:51:51,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:51:51,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1303 transitions. [2018-11-10 10:51:51,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-11-10 10:51:51,089 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:51:51,089 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:51:51,089 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:51:51,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:51:51,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1004835427, now seen corresponding path program 1 times [2018-11-10 10:51:51,090 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:51:51,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:51:51,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:51,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:51:51,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:51:51,210 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 10:51:51,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:51:51,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:51:51,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:51:51,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:51:51,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:51:51,211 INFO L87 Difference]: Start difference. First operand 1174 states and 1303 transitions. Second operand 5 states. [2018-11-10 10:51:51,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:51:51,272 INFO L93 Difference]: Finished difference Result 1214 states and 1345 transitions. [2018-11-10 10:51:51,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:51:51,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 294 [2018-11-10 10:51:51,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:51:51,276 INFO L225 Difference]: With dead ends: 1214 [2018-11-10 10:51:51,276 INFO L226 Difference]: Without dead ends: 1197 [2018-11-10 10:51:51,277 INFO L605 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 [2018-11-10 10:51:51,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2018-11-10 10:51:51,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1180. [2018-11-10 10:51:51,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1180 states. [2018-11-10 10:51:51,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1308 transitions. [2018-11-10 10:51:51,321 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1308 transitions. Word has length 294 [2018-11-10 10:51:51,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:51:51,322 INFO L481 AbstractCegarLoop]: Abstraction has 1180 states and 1308 transitions. [2018-11-10 10:51:51,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:51:51,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1308 transitions. [2018-11-10 10:51:51,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-11-10 10:51:51,326 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:51:51,326 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:51:51,326 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:51:51,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:51:51,327 INFO L82 PathProgramCache]: Analyzing trace with hash 840694266, now seen corresponding path program 1 times [2018-11-10 10:51:51,327 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:51:51,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:51:51,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:51,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:51:51,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:51:51,511 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 10:51:51,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:51:51,511 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_62eec631-97ea-43d8-a703-383b0e349194/bin-2019/uautomizer/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 [2018-11-10 10:51:51,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:51:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:51:51,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:51:51,839 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 10:51:51,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:51:51,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-11-10 10:51:51,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:51:51,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:51:51,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:51:51,868 INFO L87 Difference]: Start difference. First operand 1180 states and 1308 transitions. Second operand 5 states. [2018-11-10 10:51:51,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:51:51,986 INFO L93 Difference]: Finished difference Result 2030 states and 2251 transitions. [2018-11-10 10:51:51,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:51:51,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 299 [2018-11-10 10:51:51,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:51:51,991 INFO L225 Difference]: With dead ends: 2030 [2018-11-10 10:51:51,991 INFO L226 Difference]: Without dead ends: 1017 [2018-11-10 10:51:51,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:51:51,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2018-11-10 10:51:52,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1007. [2018-11-10 10:51:52,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2018-11-10 10:51:52,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1097 transitions. [2018-11-10 10:51:52,047 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1097 transitions. Word has length 299 [2018-11-10 10:51:52,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:51:52,047 INFO L481 AbstractCegarLoop]: Abstraction has 1007 states and 1097 transitions. [2018-11-10 10:51:52,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:51:52,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1097 transitions. [2018-11-10 10:51:52,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-11-10 10:51:52,051 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:51:52,052 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:51:52,052 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:51:52,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:51:52,052 INFO L82 PathProgramCache]: Analyzing trace with hash 811956807, now seen corresponding path program 1 times [2018-11-10 10:51:52,052 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:51:52,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:51:52,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:52,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:51:52,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:51:52,230 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 10:51:52,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:51:52,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:51:52,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:51:52,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:51:52,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:51:52,231 INFO L87 Difference]: Start difference. First operand 1007 states and 1097 transitions. Second operand 3 states. [2018-11-10 10:51:52,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:51:52,265 INFO L93 Difference]: Finished difference Result 1306 states and 1423 transitions. [2018-11-10 10:51:52,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:51:52,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2018-11-10 10:51:52,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:51:52,268 INFO L225 Difference]: With dead ends: 1306 [2018-11-10 10:51:52,268 INFO L226 Difference]: Without dead ends: 671 [2018-11-10 10:51:52,270 INFO L605 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 [2018-11-10 10:51:52,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2018-11-10 10:51:52,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2018-11-10 10:51:52,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2018-11-10 10:51:52,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 717 transitions. [2018-11-10 10:51:52,306 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 717 transitions. Word has length 313 [2018-11-10 10:51:52,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:51:52,307 INFO L481 AbstractCegarLoop]: Abstraction has 671 states and 717 transitions. [2018-11-10 10:51:52,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:51:52,307 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 717 transitions. [2018-11-10 10:51:52,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-11-10 10:51:52,311 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:51:52,311 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:51:52,311 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:51:52,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:51:52,312 INFO L82 PathProgramCache]: Analyzing trace with hash -232363518, now seen corresponding path program 1 times [2018-11-10 10:51:52,312 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:51:52,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:51:52,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:52,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:51:52,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:51:52,928 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 10:51:52,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:51:52,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 10:51:52,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 10:51:52,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 10:51:52,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:51:52,930 INFO L87 Difference]: Start difference. First operand 671 states and 717 transitions. Second operand 8 states. [2018-11-10 10:51:53,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:51:53,849 INFO L93 Difference]: Finished difference Result 727 states and 787 transitions. [2018-11-10 10:51:53,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 10:51:53,850 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 315 [2018-11-10 10:51:53,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:51:53,853 INFO L225 Difference]: With dead ends: 727 [2018-11-10 10:51:53,853 INFO L226 Difference]: Without dead ends: 703 [2018-11-10 10:51:53,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-10 10:51:53,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2018-11-10 10:51:53,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 651. [2018-11-10 10:51:53,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-11-10 10:51:53,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 695 transitions. [2018-11-10 10:51:53,886 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 695 transitions. Word has length 315 [2018-11-10 10:51:53,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:51:53,887 INFO L481 AbstractCegarLoop]: Abstraction has 651 states and 695 transitions. [2018-11-10 10:51:53,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 10:51:53,887 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 695 transitions. [2018-11-10 10:51:53,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-11-10 10:51:53,891 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:51:53,892 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:51:53,892 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:51:53,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:51:53,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1465223501, now seen corresponding path program 1 times [2018-11-10 10:51:53,892 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:51:53,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:51:53,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:53,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:51:53,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:51:54,073 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 10:51:54,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:51:54,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:51:54,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:51:54,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:51:54,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:51:54,074 INFO L87 Difference]: Start difference. First operand 651 states and 695 transitions. Second operand 6 states. [2018-11-10 10:51:54,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:51:54,138 INFO L93 Difference]: Finished difference Result 941 states and 1008 transitions. [2018-11-10 10:51:54,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:51:54,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 343 [2018-11-10 10:51:54,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:51:54,141 INFO L225 Difference]: With dead ends: 941 [2018-11-10 10:51:54,141 INFO L226 Difference]: Without dead ends: 617 [2018-11-10 10:51:54,142 INFO L605 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 [2018-11-10 10:51:54,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-11-10 10:51:54,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 594. [2018-11-10 10:51:54,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-11-10 10:51:54,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 628 transitions. [2018-11-10 10:51:54,169 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 628 transitions. Word has length 343 [2018-11-10 10:51:54,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:51:54,169 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 628 transitions. [2018-11-10 10:51:54,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:51:54,170 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 628 transitions. [2018-11-10 10:51:54,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-11-10 10:51:54,174 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:51:54,174 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:51:54,174 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:51:54,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:51:54,174 INFO L82 PathProgramCache]: Analyzing trace with hash 303115367, now seen corresponding path program 1 times [2018-11-10 10:51:54,175 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:51:54,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:51:54,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:54,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:51:54,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:51:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 10:51:54,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:51:54,640 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_62eec631-97ea-43d8-a703-383b0e349194/bin-2019/uautomizer/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 [2018-11-10 10:51:54,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:51:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:51:54,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:51:55,247 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 10:51:55,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:51:55,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2018-11-10 10:51:55,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 10:51:55,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 10:51:55,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-10 10:51:55,269 INFO L87 Difference]: Start difference. First operand 594 states and 628 transitions. Second operand 15 states. [2018-11-10 10:51:55,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:51:55,791 INFO L93 Difference]: Finished difference Result 605 states and 639 transitions. [2018-11-10 10:51:55,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:51:55,793 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 355 [2018-11-10 10:51:55,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:51:55,796 INFO L225 Difference]: With dead ends: 605 [2018-11-10 10:51:55,796 INFO L226 Difference]: Without dead ends: 601 [2018-11-10 10:51:55,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 354 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-11-10 10:51:55,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-11-10 10:51:55,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 592. [2018-11-10 10:51:55,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-11-10 10:51:55,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 624 transitions. [2018-11-10 10:51:55,828 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 624 transitions. Word has length 355 [2018-11-10 10:51:55,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:51:55,829 INFO L481 AbstractCegarLoop]: Abstraction has 592 states and 624 transitions. [2018-11-10 10:51:55,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 10:51:55,829 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 624 transitions. [2018-11-10 10:51:55,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-11-10 10:51:55,835 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:51:55,835 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:51:55,835 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:51:55,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:51:55,836 INFO L82 PathProgramCache]: Analyzing trace with hash 806501359, now seen corresponding path program 1 times [2018-11-10 10:51:55,836 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:51:55,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:51:55,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:55,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:51:55,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:51:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:51:56,287 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 10:51:56,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:51:56,288 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_62eec631-97ea-43d8-a703-383b0e349194/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:51:56,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:51:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:51:56,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:51:56,708 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 10:51:56,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:51:56,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2018-11-10 10:51:56,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 10:51:56,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 10:51:56,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:51:56,738 INFO L87 Difference]: Start difference. First operand 592 states and 624 transitions. Second operand 14 states. [2018-11-10 10:51:57,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:51:57,269 INFO L93 Difference]: Finished difference Result 597 states and 629 transitions. [2018-11-10 10:51:57,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:51:57,271 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 356 [2018-11-10 10:51:57,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:51:57,272 INFO L225 Difference]: With dead ends: 597 [2018-11-10 10:51:57,272 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 10:51:57,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 356 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-11-10 10:51:57,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 10:51:57,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 10:51:57,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 10:51:57,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 10:51:57,274 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 356 [2018-11-10 10:51:57,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:51:57,274 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:51:57,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 10:51:57,275 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 10:51:57,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 10:51:57,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 10:51:57,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:51:57,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:51:57,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:51:57,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:51:57,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:51:57,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 10:51:58,224 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 37 [2018-11-10 10:51:59,043 INFO L425 ceAbstractionStarter]: For program point L3489-1(lines 3489 3493) no Hoare annotation was computed. [2018-11-10 10:51:59,043 INFO L425 ceAbstractionStarter]: For program point L3489(line 3489) no Hoare annotation was computed. [2018-11-10 10:51:59,043 INFO L425 ceAbstractionStarter]: For program point L3486(lines 3486 3493) no Hoare annotation was computed. [2018-11-10 10:51:59,043 INFO L425 ceAbstractionStarter]: For program point L3487(line 3487) no Hoare annotation was computed. [2018-11-10 10:51:59,043 INFO L425 ceAbstractionStarter]: For program point L3484(line 3484) no Hoare annotation was computed. [2018-11-10 10:51:59,043 INFO L425 ceAbstractionStarter]: For program point L3485(line 3485) no Hoare annotation was computed. [2018-11-10 10:51:59,044 INFO L425 ceAbstractionStarter]: For program point L3482(line 3482) no Hoare annotation was computed. [2018-11-10 10:51:59,044 INFO L425 ceAbstractionStarter]: For program point L3483(line 3483) no Hoare annotation was computed. [2018-11-10 10:51:59,044 INFO L425 ceAbstractionStarter]: For program point L3480(line 3480) no Hoare annotation was computed. [2018-11-10 10:51:59,044 INFO L425 ceAbstractionStarter]: For program point L3481(line 3481) no Hoare annotation was computed. [2018-11-10 10:51:59,044 INFO L425 ceAbstractionStarter]: For program point L3480-1(line 3480) no Hoare annotation was computed. [2018-11-10 10:51:59,044 INFO L425 ceAbstractionStarter]: For program point usb_fill_int_urbFINAL(lines 3473 3497) no Hoare annotation was computed. [2018-11-10 10:51:59,044 INFO L425 ceAbstractionStarter]: For program point usb_fill_int_urbEXIT(lines 3473 3497) no Hoare annotation was computed. [2018-11-10 10:51:59,044 INFO L425 ceAbstractionStarter]: For program point L3492(line 3492) no Hoare annotation was computed. [2018-11-10 10:51:59,044 INFO L428 ceAbstractionStarter]: At program point usb_fill_int_urbENTRY(lines 3473 3497) the Hoare annotation is: true [2018-11-10 10:51:59,044 INFO L425 ceAbstractionStarter]: For program point L3490(line 3490) no Hoare annotation was computed. [2018-11-10 10:51:59,044 INFO L425 ceAbstractionStarter]: For program point L3492-1(lines 3486 3493) no Hoare annotation was computed. [2018-11-10 10:51:59,044 INFO L428 ceAbstractionStarter]: At program point kbtab_initENTRY(lines 3928 3946) the Hoare annotation is: true [2018-11-10 10:51:59,045 INFO L425 ceAbstractionStarter]: For program point L3935(lines 3935 3939) no Hoare annotation was computed. [2018-11-10 10:51:59,045 INFO L425 ceAbstractionStarter]: For program point L3933-1(line 3933) no Hoare annotation was computed. [2018-11-10 10:51:59,045 INFO L428 ceAbstractionStarter]: At program point L3933(line 3933) the Hoare annotation is: true [2018-11-10 10:51:59,045 INFO L425 ceAbstractionStarter]: For program point kbtab_initFINAL(lines 3928 3946) no Hoare annotation was computed. [2018-11-10 10:51:59,045 INFO L428 ceAbstractionStarter]: At program point L3943(lines 3931 3945) the Hoare annotation is: true [2018-11-10 10:51:59,045 INFO L425 ceAbstractionStarter]: For program point kbtab_initEXIT(lines 3928 3946) no Hoare annotation was computed. [2018-11-10 10:51:59,045 INFO L425 ceAbstractionStarter]: For program point L3522-1(line 3522) no Hoare annotation was computed. [2018-11-10 10:51:59,045 INFO L425 ceAbstractionStarter]: For program point input_get_drvdataEXIT(lines 3517 3526) no Hoare annotation was computed. [2018-11-10 10:51:59,045 INFO L425 ceAbstractionStarter]: For program point input_get_drvdataENTRY(lines 3517 3526) no Hoare annotation was computed. [2018-11-10 10:51:59,045 INFO L425 ceAbstractionStarter]: For program point input_get_drvdataFINAL(lines 3517 3526) no Hoare annotation was computed. [2018-11-10 10:51:59,045 INFO L425 ceAbstractionStarter]: For program point L3522(line 3522) no Hoare annotation was computed. [2018-11-10 10:51:59,045 INFO L425 ceAbstractionStarter]: For program point L3904(line 3904) no Hoare annotation was computed. [2018-11-10 10:51:59,046 INFO L425 ceAbstractionStarter]: For program point L3905(line 3905) no Hoare annotation was computed. [2018-11-10 10:51:59,046 INFO L425 ceAbstractionStarter]: For program point L3902(line 3902) no Hoare annotation was computed. [2018-11-10 10:51:59,046 INFO L421 ceAbstractionStarter]: At program point L3903-1(line 3903) the Hoare annotation is: (or (< 1 |old(~ldv_coherent_state~0)|) (< 1 |old(~ldv_urb_state~0)|) (< |old(~ldv_coherent_state~0)| 1) (not (= ~res_kbtab_probe_3~0 0)) (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= 1 ~ldv_urb_state~0)) (< |old(~ldv_urb_state~0)| 1)) [2018-11-10 10:51:59,046 INFO L425 ceAbstractionStarter]: For program point L3904-2(line 3904) no Hoare annotation was computed. [2018-11-10 10:51:59,046 INFO L425 ceAbstractionStarter]: For program point L3903(line 3903) no Hoare annotation was computed. [2018-11-10 10:51:59,046 INFO L425 ceAbstractionStarter]: For program point L3904-1(line 3904) no Hoare annotation was computed. [2018-11-10 10:51:59,046 INFO L425 ceAbstractionStarter]: For program point L3901-1(line 3901) no Hoare annotation was computed. [2018-11-10 10:51:59,046 INFO L425 ceAbstractionStarter]: For program point L3904-4(line 3904) no Hoare annotation was computed. [2018-11-10 10:51:59,046 INFO L421 ceAbstractionStarter]: At program point L3901(line 3901) the Hoare annotation is: (or (< 1 |old(~ldv_coherent_state~0)|) (< 1 |old(~ldv_urb_state~0)|) (< |old(~ldv_coherent_state~0)| 1) (not (= ~res_kbtab_probe_3~0 0)) (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= 1 ~ldv_urb_state~0)) (< |old(~ldv_urb_state~0)| 1)) [2018-11-10 10:51:59,046 INFO L425 ceAbstractionStarter]: For program point L3902-1(line 3902) no Hoare annotation was computed. [2018-11-10 10:51:59,047 INFO L425 ceAbstractionStarter]: For program point L3903-2(line 3903) no Hoare annotation was computed. [2018-11-10 10:51:59,047 INFO L421 ceAbstractionStarter]: At program point L3904-3(line 3904) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0)) (< 1 |old(~ldv_coherent_state~0)|) (< 1 |old(~ldv_urb_state~0)|) (< |old(~ldv_coherent_state~0)| 1) (not (= ~res_kbtab_probe_3~0 0)) (< |old(~ldv_urb_state~0)| 1)) [2018-11-10 10:51:59,047 INFO L425 ceAbstractionStarter]: For program point L3899-1(line 3899) no Hoare annotation was computed. [2018-11-10 10:51:59,047 INFO L421 ceAbstractionStarter]: At program point L3899(line 3899) the Hoare annotation is: (or (< 1 |old(~ldv_coherent_state~0)|) (< 1 |old(~ldv_urb_state~0)|) (< |old(~ldv_coherent_state~0)| 1) (not (= ~res_kbtab_probe_3~0 0)) (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= 1 ~ldv_urb_state~0)) (< |old(~ldv_urb_state~0)| 1)) [2018-11-10 10:51:59,047 INFO L421 ceAbstractionStarter]: At program point kbtab_disconnectENTRY(lines 3893 3909) the Hoare annotation is: (or (< 1 |old(~ldv_coherent_state~0)|) (< 1 |old(~ldv_urb_state~0)|) (< |old(~ldv_coherent_state~0)| 1) (not (= ~res_kbtab_probe_3~0 0)) (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (<= 1 ~ldv_urb_state~0)) (< |old(~ldv_urb_state~0)| 1)) [2018-11-10 10:51:59,047 INFO L425 ceAbstractionStarter]: For program point kbtab_disconnectEXIT(lines 3893 3909) no Hoare annotation was computed. [2018-11-10 10:51:59,047 INFO L425 ceAbstractionStarter]: For program point kbtab_disconnectFINAL(lines 3893 3909) no Hoare annotation was computed. [2018-11-10 10:51:59,047 INFO L425 ceAbstractionStarter]: For program point L3378-1(line 3378) no Hoare annotation was computed. [2018-11-10 10:51:59,047 INFO L425 ceAbstractionStarter]: For program point __le16_to_cpupFINAL(lines 3374 3380) no Hoare annotation was computed. [2018-11-10 10:51:59,047 INFO L425 ceAbstractionStarter]: For program point __le16_to_cpupEXIT(lines 3374 3380) no Hoare annotation was computed. [2018-11-10 10:51:59,047 INFO L425 ceAbstractionStarter]: For program point __le16_to_cpupENTRY(lines 3374 3380) no Hoare annotation was computed. [2018-11-10 10:51:59,048 INFO L425 ceAbstractionStarter]: For program point L3378(line 3378) no Hoare annotation was computed. [2018-11-10 10:51:59,048 INFO L425 ceAbstractionStarter]: For program point L3999(lines 3999 4003) no Hoare annotation was computed. [2018-11-10 10:51:59,048 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 3985 4076) no Hoare annotation was computed. [2018-11-10 10:51:59,048 INFO L425 ceAbstractionStarter]: For program point L4049-1(line 4049) no Hoare annotation was computed. [2018-11-10 10:51:59,048 INFO L421 ceAbstractionStarter]: At program point L4049(line 4049) the Hoare annotation is: (or (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (<= 1 ~ldv_coherent_state~0) (<= 1 main_~ldv_s_kbtab_driver_usb_driver~0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 10:51:59,048 INFO L425 ceAbstractionStarter]: For program point L4033-1(line 4033) no Hoare annotation was computed. [2018-11-10 10:51:59,048 INFO L421 ceAbstractionStarter]: At program point L4033(line 4033) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (= 0 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= main_~ldv_s_kbtab_driver_usb_driver~0 0)) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 10:51:59,048 INFO L425 ceAbstractionStarter]: For program point L3996(line 3996) no Hoare annotation was computed. [2018-11-10 10:51:59,048 INFO L421 ceAbstractionStarter]: At program point L3996-1(line 3996) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (= 0 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0)) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 10:51:59,048 INFO L425 ceAbstractionStarter]: For program point L4025(lines 4025 4061) no Hoare annotation was computed. [2018-11-10 10:51:59,049 INFO L425 ceAbstractionStarter]: For program point L4034(line 4034) no Hoare annotation was computed. [2018-11-10 10:51:59,049 INFO L425 ceAbstractionStarter]: For program point L4034-1(lines 4031 4042) no Hoare annotation was computed. [2018-11-10 10:51:59,049 INFO L421 ceAbstractionStarter]: At program point L4063(lines 4005 4064) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (= 0 ~ldv_coherent_state~0)) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 10:51:59,049 INFO L425 ceAbstractionStarter]: For program point L3997(line 3997) no Hoare annotation was computed. [2018-11-10 10:51:59,049 INFO L421 ceAbstractionStarter]: At program point L4026(lines 4025 4061) the Hoare annotation is: (let ((.cse0 (= 0 ~res_kbtab_probe_3~0))) (or (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (= 0 ~ldv_coherent_state~0) .cse0 (= main_~ldv_s_kbtab_driver_usb_driver~0 0) (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1)))) (and (<= 1 ~ldv_coherent_state~0) (<= 1 main_~ldv_s_kbtab_driver_usb_driver~0) .cse0 (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= 0 |old(~ldv_coherent_state~0)|)))) [2018-11-10 10:51:59,049 INFO L421 ceAbstractionStarter]: At program point L4059(lines 4006 4062) the Hoare annotation is: (let ((.cse0 (= 0 ~res_kbtab_probe_3~0))) (or (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (= 0 ~ldv_coherent_state~0) .cse0 (= main_~ldv_s_kbtab_driver_usb_driver~0 0) (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1)))) (and (<= 1 ~ldv_coherent_state~0) (<= 1 main_~ldv_s_kbtab_driver_usb_driver~0) .cse0 (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= 0 |old(~ldv_coherent_state~0)|)))) [2018-11-10 10:51:59,049 INFO L425 ceAbstractionStarter]: For program point L4022(lines 4022 4061) no Hoare annotation was computed. [2018-11-10 10:51:59,049 INFO L425 ceAbstractionStarter]: For program point $Ultimate##18(lines 4029 4060) no Hoare annotation was computed. [2018-11-10 10:51:59,049 INFO L425 ceAbstractionStarter]: For program point L4014(lines 4014 4018) no Hoare annotation was computed. [2018-11-10 10:51:59,050 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 3985 4076) no Hoare annotation was computed. [2018-11-10 10:51:59,050 INFO L425 ceAbstractionStarter]: For program point L4014-1(lines 4011 4018) no Hoare annotation was computed. [2018-11-10 10:51:59,050 INFO L425 ceAbstractionStarter]: For program point $Ultimate##19(lines 4029 4060) no Hoare annotation was computed. [2018-11-10 10:51:59,050 INFO L425 ceAbstractionStarter]: For program point L4072(line 4072) no Hoare annotation was computed. [2018-11-10 10:51:59,050 INFO L421 ceAbstractionStarter]: At program point L4068(lines 3993 4075) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (= 0 ~ldv_coherent_state~0)) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 10:51:59,050 INFO L425 ceAbstractionStarter]: For program point L4006-1(lines 4006 4062) no Hoare annotation was computed. [2018-11-10 10:51:59,050 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 3985 4076) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (= 0 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0)) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 10:51:59,050 INFO L421 ceAbstractionStarter]: At program point L4023(lines 4022 4061) the Hoare annotation is: (let ((.cse0 (= 0 ~res_kbtab_probe_3~0))) (or (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (= 0 ~ldv_coherent_state~0) .cse0 (= main_~ldv_s_kbtab_driver_usb_driver~0 0) (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1)))) (and (<= 1 ~ldv_coherent_state~0) (<= 1 main_~ldv_s_kbtab_driver_usb_driver~0) .cse0 (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= 0 |old(~ldv_coherent_state~0)|)))) [2018-11-10 10:51:59,050 INFO L425 ceAbstractionStarter]: For program point L4011(lines 4011 4018) no Hoare annotation was computed. [2018-11-10 10:51:59,050 INFO L425 ceAbstractionStarter]: For program point L4007(line 4007) no Hoare annotation was computed. [2018-11-10 10:51:59,051 INFO L425 ceAbstractionStarter]: For program point L3964(line 3964) no Hoare annotation was computed. [2018-11-10 10:51:59,051 INFO L425 ceAbstractionStarter]: For program point init_moduleFINAL(lines 3959 3968) no Hoare annotation was computed. [2018-11-10 10:51:59,051 INFO L425 ceAbstractionStarter]: For program point init_moduleENTRY(lines 3959 3968) no Hoare annotation was computed. [2018-11-10 10:51:59,051 INFO L425 ceAbstractionStarter]: For program point L3964-1(line 3964) no Hoare annotation was computed. [2018-11-10 10:51:59,051 INFO L425 ceAbstractionStarter]: For program point init_moduleEXIT(lines 3959 3968) no Hoare annotation was computed. [2018-11-10 10:51:59,051 INFO L425 ceAbstractionStarter]: For program point usb_get_intfdataEXIT(lines 3415 3424) no Hoare annotation was computed. [2018-11-10 10:51:59,051 INFO L425 ceAbstractionStarter]: For program point L3420(line 3420) no Hoare annotation was computed. [2018-11-10 10:51:59,051 INFO L428 ceAbstractionStarter]: At program point usb_get_intfdataENTRY(lines 3415 3424) the Hoare annotation is: true [2018-11-10 10:51:59,051 INFO L425 ceAbstractionStarter]: For program point L3420-1(line 3420) no Hoare annotation was computed. [2018-11-10 10:51:59,051 INFO L425 ceAbstractionStarter]: For program point usb_get_intfdataFINAL(lines 3415 3424) no Hoare annotation was computed. [2018-11-10 10:51:59,051 INFO L425 ceAbstractionStarter]: For program point kbtab_exitFINAL(lines 3949 3958) no Hoare annotation was computed. [2018-11-10 10:51:59,051 INFO L428 ceAbstractionStarter]: At program point kbtab_exitENTRY(lines 3949 3958) the Hoare annotation is: true [2018-11-10 10:51:59,052 INFO L425 ceAbstractionStarter]: For program point kbtab_exitEXIT(lines 3949 3958) no Hoare annotation was computed. [2018-11-10 10:51:59,052 INFO L425 ceAbstractionStarter]: For program point L3582(line 3582) no Hoare annotation was computed. [2018-11-10 10:51:59,052 INFO L425 ceAbstractionStarter]: For program point L3580(line 3580) no Hoare annotation was computed. [2018-11-10 10:51:59,052 INFO L425 ceAbstractionStarter]: For program point L3581-1(line 3581) no Hoare annotation was computed. [2018-11-10 10:51:59,052 INFO L425 ceAbstractionStarter]: For program point L3582-2(line 3582) no Hoare annotation was computed. [2018-11-10 10:51:59,052 INFO L428 ceAbstractionStarter]: At program point usb_to_input_idENTRY(lines 3575 3585) the Hoare annotation is: true [2018-11-10 10:51:59,052 INFO L425 ceAbstractionStarter]: For program point L3581(line 3581) no Hoare annotation was computed. [2018-11-10 10:51:59,052 INFO L425 ceAbstractionStarter]: For program point L3582-1(line 3582) no Hoare annotation was computed. [2018-11-10 10:51:59,052 INFO L425 ceAbstractionStarter]: For program point L3579-1(line 3579) no Hoare annotation was computed. [2018-11-10 10:51:59,052 INFO L425 ceAbstractionStarter]: For program point L3579(line 3579) no Hoare annotation was computed. [2018-11-10 10:51:59,052 INFO L425 ceAbstractionStarter]: For program point L3580-1(line 3580) no Hoare annotation was computed. [2018-11-10 10:51:59,052 INFO L425 ceAbstractionStarter]: For program point L3581-2(line 3581) no Hoare annotation was computed. [2018-11-10 10:51:59,052 INFO L425 ceAbstractionStarter]: For program point usb_to_input_idEXIT(lines 3575 3585) no Hoare annotation was computed. [2018-11-10 10:51:59,053 INFO L425 ceAbstractionStarter]: For program point usb_to_input_idFINAL(lines 3575 3585) no Hoare annotation was computed. [2018-11-10 10:51:59,053 INFO L428 ceAbstractionStarter]: At program point L3402(line 3402) the Hoare annotation is: true [2018-11-10 10:51:59,053 INFO L425 ceAbstractionStarter]: For program point kzallocEXIT(lines 3397 3406) no Hoare annotation was computed. [2018-11-10 10:51:59,053 INFO L425 ceAbstractionStarter]: For program point L3402-1(line 3402) no Hoare annotation was computed. [2018-11-10 10:51:59,053 INFO L428 ceAbstractionStarter]: At program point kzallocENTRY(lines 3397 3406) the Hoare annotation is: true [2018-11-10 10:51:59,053 INFO L425 ceAbstractionStarter]: For program point kzallocFINAL(lines 3397 3406) no Hoare annotation was computed. [2018-11-10 10:51:59,053 INFO L425 ceAbstractionStarter]: For program point input_syncENTRY(lines 3563 3572) no Hoare annotation was computed. [2018-11-10 10:51:59,053 INFO L425 ceAbstractionStarter]: For program point L3568(line 3568) no Hoare annotation was computed. [2018-11-10 10:51:59,053 INFO L425 ceAbstractionStarter]: For program point input_syncFINAL(lines 3563 3572) no Hoare annotation was computed. [2018-11-10 10:51:59,053 INFO L425 ceAbstractionStarter]: For program point input_syncEXIT(lines 3563 3572) no Hoare annotation was computed. [2018-11-10 10:51:59,053 INFO L428 ceAbstractionStarter]: At program point kmallocENTRY(lines 3386 3396) the Hoare annotation is: true [2018-11-10 10:51:59,053 INFO L425 ceAbstractionStarter]: For program point L3392(line 3392) no Hoare annotation was computed. [2018-11-10 10:51:59,054 INFO L425 ceAbstractionStarter]: For program point L3392-1(line 3392) no Hoare annotation was computed. [2018-11-10 10:51:59,054 INFO L425 ceAbstractionStarter]: For program point kmallocFINAL(lines 3386 3396) no Hoare annotation was computed. [2018-11-10 10:51:59,054 INFO L425 ceAbstractionStarter]: For program point kmallocEXIT(lines 3386 3396) no Hoare annotation was computed. [2018-11-10 10:51:59,054 INFO L425 ceAbstractionStarter]: For program point ldv_assume_stopFINAL(lines 4087 4094) no Hoare annotation was computed. [2018-11-10 10:51:59,054 INFO L428 ceAbstractionStarter]: At program point ldv_assume_stopENTRY(lines 4087 4094) the Hoare annotation is: true [2018-11-10 10:51:59,054 INFO L425 ceAbstractionStarter]: For program point ldv_assume_stopEXIT(lines 4087 4094) no Hoare annotation was computed. [2018-11-10 10:51:59,054 INFO L425 ceAbstractionStarter]: For program point kbtab_openENTRY(lines 3762 3781) no Hoare annotation was computed. [2018-11-10 10:51:59,054 INFO L425 ceAbstractionStarter]: For program point L3774(lines 3774 3778) no Hoare annotation was computed. [2018-11-10 10:51:59,054 INFO L425 ceAbstractionStarter]: For program point L3772(line 3772) no Hoare annotation was computed. [2018-11-10 10:51:59,054 INFO L425 ceAbstractionStarter]: For program point L3771-1(line 3771) no Hoare annotation was computed. [2018-11-10 10:51:59,054 INFO L425 ceAbstractionStarter]: For program point L3772-2(line 3772) no Hoare annotation was computed. [2018-11-10 10:51:59,054 INFO L425 ceAbstractionStarter]: For program point L3771(line 3771) no Hoare annotation was computed. [2018-11-10 10:51:59,054 INFO L425 ceAbstractionStarter]: For program point L3772-1(line 3772) no Hoare annotation was computed. [2018-11-10 10:51:59,055 INFO L425 ceAbstractionStarter]: For program point L3769-1(line 3769) no Hoare annotation was computed. [2018-11-10 10:51:59,055 INFO L425 ceAbstractionStarter]: For program point L3771-3(line 3771) no Hoare annotation was computed. [2018-11-10 10:51:59,055 INFO L425 ceAbstractionStarter]: For program point L3769(line 3769) no Hoare annotation was computed. [2018-11-10 10:51:59,055 INFO L425 ceAbstractionStarter]: For program point L3771-2(line 3771) no Hoare annotation was computed. [2018-11-10 10:51:59,055 INFO L425 ceAbstractionStarter]: For program point kbtab_openEXIT(lines 3762 3781) no Hoare annotation was computed. [2018-11-10 10:51:59,055 INFO L425 ceAbstractionStarter]: For program point kbtab_openFINAL(lines 3762 3781) no Hoare annotation was computed. [2018-11-10 10:51:59,055 INFO L421 ceAbstractionStarter]: At program point L4156(lines 4128 4161) the Hoare annotation is: (let ((.cse0 (let ((.cse2 (+ ~ldv_coherent_state~0 1))) (and (<= .cse2 |old(~ldv_coherent_state~0)|) (< 0 .cse2) (let ((.cse4 (+ usb_free_coherent_~addr.base usb_free_coherent_~addr.offset))) (let ((.cse3 (div .cse4 18446744073709551616))) (or (< (* 18446744073709551616 .cse3) .cse4) (<= (+ .cse3 1) 0))))))) (.cse1 (< |old(~ldv_coherent_state~0)| 1))) (and (or .cse0 .cse1 (not (= ~res_kbtab_probe_3~0 0))) (or .cse0 .cse1 (not (= 0 ~ldv_urb_state~0))))) [2018-11-10 10:51:59,055 INFO L421 ceAbstractionStarter]: At program point usb_free_coherentENTRY(lines 4128 4161) the Hoare annotation is: (let ((.cse1 (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0)) (.cse0 (< |old(~ldv_coherent_state~0)| 1))) (and (or .cse0 (not (= ~res_kbtab_probe_3~0 0)) .cse1) (or .cse1 .cse0 (not (= 0 ~ldv_urb_state~0))))) [2018-11-10 10:51:59,055 INFO L425 ceAbstractionStarter]: For program point L4134(lines 4133 4155) no Hoare annotation was computed. [2018-11-10 10:51:59,055 INFO L425 ceAbstractionStarter]: For program point usb_free_coherentEXIT(lines 4128 4161) no Hoare annotation was computed. [2018-11-10 10:51:59,055 INFO L425 ceAbstractionStarter]: For program point L4147-1(lines 4143 4149) no Hoare annotation was computed. [2018-11-10 10:51:59,056 INFO L421 ceAbstractionStarter]: At program point L4147(line 4147) the Hoare annotation is: (let ((.cse0 (< |old(~ldv_coherent_state~0)| 1))) (and (or .cse0 (not (= ~res_kbtab_probe_3~0 0))) (or .cse0 (not (= 0 ~ldv_urb_state~0))))) [2018-11-10 10:51:59,056 INFO L425 ceAbstractionStarter]: For program point L4143(lines 4143 4149) no Hoare annotation was computed. [2018-11-10 10:51:59,056 INFO L428 ceAbstractionStarter]: At program point L4137(line 4137) the Hoare annotation is: true [2018-11-10 10:51:59,056 INFO L425 ceAbstractionStarter]: For program point L4135(lines 4133 4155) no Hoare annotation was computed. [2018-11-10 10:51:59,056 INFO L425 ceAbstractionStarter]: For program point L4133-1(lines 4133 4155) no Hoare annotation was computed. [2018-11-10 10:51:59,056 INFO L421 ceAbstractionStarter]: At program point L4133loopEntry(lines 4133 4155) the Hoare annotation is: (let ((.cse1 (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0)) (.cse0 (< |old(~ldv_coherent_state~0)| 1))) (and (or .cse0 (not (= ~res_kbtab_probe_3~0 0)) .cse1) (or .cse1 .cse0 (not (= 0 ~ldv_urb_state~0))))) [2018-11-10 10:51:59,056 INFO L425 ceAbstractionStarter]: For program point usb_alloc_coherentFINAL(lines 4099 4126) no Hoare annotation was computed. [2018-11-10 10:51:59,056 INFO L421 ceAbstractionStarter]: At program point usb_alloc_coherentENTRY(lines 4099 4126) the Hoare annotation is: (or (= 0 ~ldv_coherent_state~0) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 ~ldv_urb_state~0)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 10:51:59,056 INFO L425 ceAbstractionStarter]: For program point L4121(lines 4105 4122) no Hoare annotation was computed. [2018-11-10 10:51:59,056 INFO L425 ceAbstractionStarter]: For program point usb_alloc_coherentEXIT(lines 4099 4126) no Hoare annotation was computed. [2018-11-10 10:51:59,056 INFO L425 ceAbstractionStarter]: For program point L4112(lines 4112 4116) no Hoare annotation was computed. [2018-11-10 10:51:59,057 INFO L425 ceAbstractionStarter]: For program point L4109(line 4109) no Hoare annotation was computed. [2018-11-10 10:51:59,057 INFO L421 ceAbstractionStarter]: At program point L4106loopEntry(lines 4106 4120) the Hoare annotation is: (or (= 0 ~ldv_coherent_state~0) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 ~ldv_urb_state~0)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 10:51:59,057 INFO L425 ceAbstractionStarter]: For program point L4107(line 4107) no Hoare annotation was computed. [2018-11-10 10:51:59,057 INFO L425 ceAbstractionStarter]: For program point L4106-1(lines 4106 4120) no Hoare annotation was computed. [2018-11-10 10:51:59,057 INFO L428 ceAbstractionStarter]: At program point usb_set_intfdataENTRY(lines 3427 3436) the Hoare annotation is: true [2018-11-10 10:51:59,057 INFO L425 ceAbstractionStarter]: For program point usb_set_intfdataFINAL(lines 3427 3436) no Hoare annotation was computed. [2018-11-10 10:51:59,057 INFO L425 ceAbstractionStarter]: For program point L3432(line 3432) no Hoare annotation was computed. [2018-11-10 10:51:59,057 INFO L425 ceAbstractionStarter]: For program point L3432-1(line 3432) no Hoare annotation was computed. [2018-11-10 10:51:59,057 INFO L425 ceAbstractionStarter]: For program point usb_set_intfdataEXIT(lines 3427 3436) no Hoare annotation was computed. [2018-11-10 10:51:59,057 INFO L425 ceAbstractionStarter]: For program point L3809-1(line 3809) no Hoare annotation was computed. [2018-11-10 10:51:59,057 INFO L421 ceAbstractionStarter]: At program point L3809(line 3809) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (= 0 ~ldv_coherent_state~0)) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 10:51:59,057 INFO L425 ceAbstractionStarter]: For program point L3842-1(line 3842) no Hoare annotation was computed. [2018-11-10 10:51:59,058 INFO L421 ceAbstractionStarter]: At program point L3834(line 3834) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (or (not (= kbtab_probe_~tmp___9~1.base 0)) (not (= kbtab_probe_~tmp___9~1.offset 0))) (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (or (not (= (select (select |#memory_$Pointer$.offset| kbtab_probe_~kbtab~3.base) kbtab_probe_~kbtab~3.offset) 0)) (not (= (select (select |#memory_$Pointer$.base| kbtab_probe_~kbtab~3.base) kbtab_probe_~kbtab~3.offset) 0))) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 10:51:59,058 INFO L425 ceAbstractionStarter]: For program point L3834-2(line 3834) no Hoare annotation was computed. [2018-11-10 10:51:59,058 INFO L425 ceAbstractionStarter]: For program point L3834-1(line 3834) no Hoare annotation was computed. [2018-11-10 10:51:59,058 INFO L425 ceAbstractionStarter]: For program point L3826(line 3826) no Hoare annotation was computed. [2018-11-10 10:51:59,058 INFO L425 ceAbstractionStarter]: For program point L3859-1(line 3859) no Hoare annotation was computed. [2018-11-10 10:51:59,058 INFO L425 ceAbstractionStarter]: For program point L3859(line 3859) no Hoare annotation was computed. [2018-11-10 10:51:59,058 INFO L425 ceAbstractionStarter]: For program point L3826-1(line 3826) no Hoare annotation was computed. [2018-11-10 10:51:59,058 INFO L425 ceAbstractionStarter]: For program point L3851(line 3851) no Hoare annotation was computed. [2018-11-10 10:51:59,058 INFO L421 ceAbstractionStarter]: At program point L3843(line 3843) the Hoare annotation is: (or (and (and (or (not (= kbtab_probe_~tmp___9~1.base 0)) (not (= kbtab_probe_~tmp___9~1.offset 0))) (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (or (not (= (select (select |#memory_$Pointer$.offset| kbtab_probe_~kbtab~3.base) kbtab_probe_~kbtab~3.offset) 0)) (not (= (select (select |#memory_$Pointer$.base| kbtab_probe_~kbtab~3.base) kbtab_probe_~kbtab~3.offset) 0)))) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 10:51:59,058 INFO L425 ceAbstractionStarter]: For program point L3868(lines 3868 3872) no Hoare annotation was computed. [2018-11-10 10:51:59,058 INFO L425 ceAbstractionStarter]: For program point L3860(line 3860) no Hoare annotation was computed. [2018-11-10 10:51:59,059 INFO L425 ceAbstractionStarter]: For program point L3860-2(line 3860) no Hoare annotation was computed. [2018-11-10 10:51:59,059 INFO L421 ceAbstractionStarter]: At program point L3860-1(line 3860) the Hoare annotation is: (or (and (or (not (= kbtab_probe_~tmp___9~1.base 0)) (not (= kbtab_probe_~tmp___9~1.offset 0))) (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 10:51:59,059 INFO L425 ceAbstractionStarter]: For program point L3852(line 3852) no Hoare annotation was computed. [2018-11-10 10:51:59,059 INFO L421 ceAbstractionStarter]: At program point L3885(lines 3807 3891) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (or (and (or (not (= kbtab_probe_~tmp___9~1.base 0)) (not (= kbtab_probe_~tmp___9~1.offset 0))) (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1))) (not (= 0 kbtab_probe_~error~0))) (and (= |old(~ldv_urb_state~0)| ~ldv_urb_state~0) (<= (+ kbtab_probe_~error~0 12) 0))) (= 0 ~ldv_coherent_state~0)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 10:51:59,059 INFO L425 ceAbstractionStarter]: For program point L3819(lines 3819 3823) no Hoare annotation was computed. [2018-11-10 10:51:59,059 INFO L425 ceAbstractionStarter]: For program point L3844(line 3844) no Hoare annotation was computed. [2018-11-10 10:51:59,059 INFO L425 ceAbstractionStarter]: For program point L3836(line 3836) no Hoare annotation was computed. [2018-11-10 10:51:59,059 INFO L421 ceAbstractionStarter]: At program point L3869(lines 3807 3891) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 0)) (and (or (not (= kbtab_probe_~tmp___9~1.base 0)) (not (= kbtab_probe_~tmp___9~1.offset 0))) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (not (= 0 kbtab_probe_~error~0)) (<= 1 ~ldv_urb_state~0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 10:51:59,059 INFO L425 ceAbstractionStarter]: For program point L3836-1(lines 3836 3840) no Hoare annotation was computed. [2018-11-10 10:51:59,059 INFO L425 ceAbstractionStarter]: For program point L3828(lines 3828 3832) no Hoare annotation was computed. [2018-11-10 10:51:59,059 INFO L425 ceAbstractionStarter]: For program point L3861-1(line 3861) no Hoare annotation was computed. [2018-11-10 10:51:59,060 INFO L425 ceAbstractionStarter]: For program point L3861(line 3861) no Hoare annotation was computed. [2018-11-10 10:51:59,060 INFO L425 ceAbstractionStarter]: For program point L3861-2(lines 3861 3862) no Hoare annotation was computed. [2018-11-10 10:51:59,060 INFO L425 ceAbstractionStarter]: For program point L3853-1(line 3853) no Hoare annotation was computed. [2018-11-10 10:51:59,060 INFO L425 ceAbstractionStarter]: For program point L3853(line 3853) no Hoare annotation was computed. [2018-11-10 10:51:59,060 INFO L421 ceAbstractionStarter]: At program point L3812(line 3812) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (= 0 ~ldv_coherent_state~0)) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 10:51:59,060 INFO L425 ceAbstractionStarter]: For program point L3845-1(line 3845) no Hoare annotation was computed. [2018-11-10 10:51:59,060 INFO L425 ceAbstractionStarter]: For program point L3845(line 3845) no Hoare annotation was computed. [2018-11-10 10:51:59,060 INFO L425 ceAbstractionStarter]: For program point L3812-1(line 3812) no Hoare annotation was computed. [2018-11-10 10:51:59,060 INFO L425 ceAbstractionStarter]: For program point L3862(line 3862) no Hoare annotation was computed. [2018-11-10 10:51:59,060 INFO L421 ceAbstractionStarter]: At program point L3862-1(line 3862) the Hoare annotation is: (or (and (or (not (= kbtab_probe_~tmp___9~1.base 0)) (not (= kbtab_probe_~tmp___9~1.offset 0))) (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 10:51:59,060 INFO L425 ceAbstractionStarter]: For program point L3854(line 3854) no Hoare annotation was computed. [2018-11-10 10:51:59,060 INFO L425 ceAbstractionStarter]: For program point L3887(line 3887) no Hoare annotation was computed. [2018-11-10 10:51:59,061 INFO L425 ceAbstractionStarter]: For program point L3854-2(line 3854) no Hoare annotation was computed. [2018-11-10 10:51:59,061 INFO L425 ceAbstractionStarter]: For program point L3854-1(line 3854) no Hoare annotation was computed. [2018-11-10 10:51:59,061 INFO L425 ceAbstractionStarter]: For program point L3846(line 3846) no Hoare annotation was computed. [2018-11-10 10:51:59,061 INFO L425 ceAbstractionStarter]: For program point L3879-1(line 3879) no Hoare annotation was computed. [2018-11-10 10:51:59,061 INFO L421 ceAbstractionStarter]: At program point L3879(line 3879) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 0)) (and (or (not (= kbtab_probe_~tmp___9~1.base 0)) (not (= kbtab_probe_~tmp___9~1.offset 0))) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (not (= 0 kbtab_probe_~error~0)) (<= 1 ~ldv_urb_state~0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 10:51:59,061 INFO L425 ceAbstractionStarter]: For program point L3846-1(line 3846) no Hoare annotation was computed. [2018-11-10 10:51:59,061 INFO L425 ceAbstractionStarter]: For program point L3863-1(line 3863) no Hoare annotation was computed. [2018-11-10 10:51:59,061 INFO L425 ceAbstractionStarter]: For program point L3863(line 3863) no Hoare annotation was computed. [2018-11-10 10:51:59,061 INFO L425 ceAbstractionStarter]: For program point L3863-3(line 3863) no Hoare annotation was computed. [2018-11-10 10:51:59,061 INFO L425 ceAbstractionStarter]: For program point L3863-2(line 3863) no Hoare annotation was computed. [2018-11-10 10:51:59,061 INFO L425 ceAbstractionStarter]: For program point L3888(line 3888) no Hoare annotation was computed. [2018-11-10 10:51:59,061 INFO L425 ceAbstractionStarter]: For program point L3855-1(line 3855) no Hoare annotation was computed. [2018-11-10 10:51:59,062 INFO L425 ceAbstractionStarter]: For program point L3855(line 3855) no Hoare annotation was computed. [2018-11-10 10:51:59,062 INFO L425 ceAbstractionStarter]: For program point L3855-2(line 3855) no Hoare annotation was computed. [2018-11-10 10:51:59,062 INFO L421 ceAbstractionStarter]: At program point L3814(line 3814) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (= 0 ~ldv_coherent_state~0)) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 10:51:59,062 INFO L421 ceAbstractionStarter]: At program point L3847(line 3847) the Hoare annotation is: (or (and (or (not (= kbtab_probe_~tmp___9~1.base 0)) (not (= kbtab_probe_~tmp___9~1.offset 0))) (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 10:51:59,062 INFO L425 ceAbstractionStarter]: For program point L3814-1(line 3814) no Hoare annotation was computed. [2018-11-10 10:51:59,062 INFO L425 ceAbstractionStarter]: For program point L3864(line 3864) no Hoare annotation was computed. [2018-11-10 10:51:59,062 INFO L425 ceAbstractionStarter]: For program point L3864-2(line 3864) no Hoare annotation was computed. [2018-11-10 10:51:59,062 INFO L425 ceAbstractionStarter]: For program point L3864-1(line 3864) no Hoare annotation was computed. [2018-11-10 10:51:59,062 INFO L425 ceAbstractionStarter]: For program point L3864-4(line 3864) no Hoare annotation was computed. [2018-11-10 10:51:59,062 INFO L425 ceAbstractionStarter]: For program point L3864-3(line 3864) no Hoare annotation was computed. [2018-11-10 10:51:59,062 INFO L425 ceAbstractionStarter]: For program point L3856(line 3856) no Hoare annotation was computed. [2018-11-10 10:51:59,062 INFO L425 ceAbstractionStarter]: For program point L3856-1(line 3856) no Hoare annotation was computed. [2018-11-10 10:51:59,063 INFO L425 ceAbstractionStarter]: For program point L3848(line 3848) no Hoare annotation was computed. [2018-11-10 10:51:59,063 INFO L421 ceAbstractionStarter]: At program point L3881(lines 3807 3891) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (and (or (not (= kbtab_probe_~tmp___9~1.base 0)) (not (= kbtab_probe_~tmp___9~1.offset 0))) (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1))) (not (= 0 kbtab_probe_~error~0))) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 10:51:59,063 INFO L425 ceAbstractionStarter]: For program point L3865-1(line 3865) no Hoare annotation was computed. [2018-11-10 10:51:59,063 INFO L425 ceAbstractionStarter]: For program point L3865(line 3865) no Hoare annotation was computed. [2018-11-10 10:51:59,063 INFO L421 ceAbstractionStarter]: At program point kbtab_probeENTRY(lines 3795 3892) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (= 0 ~ldv_coherent_state~0)) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 10:51:59,063 INFO L425 ceAbstractionStarter]: For program point L3865-2(line 3865) no Hoare annotation was computed. [2018-11-10 10:51:59,063 INFO L425 ceAbstractionStarter]: For program point L3857(line 3857) no Hoare annotation was computed. [2018-11-10 10:51:59,063 INFO L425 ceAbstractionStarter]: For program point kbtab_probeFINAL(lines 3795 3892) no Hoare annotation was computed. [2018-11-10 10:51:59,063 INFO L425 ceAbstractionStarter]: For program point L3816(lines 3816 3823) no Hoare annotation was computed. [2018-11-10 10:51:59,063 INFO L421 ceAbstractionStarter]: At program point L3849(line 3849) the Hoare annotation is: (or (and (or (not (= kbtab_probe_~tmp___9~1.base 0)) (not (= kbtab_probe_~tmp___9~1.offset 0))) (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 10:51:59,064 INFO L421 ceAbstractionStarter]: At program point L3874(line 3874) the Hoare annotation is: (or (and (or (not (= kbtab_probe_~tmp___9~1.base 0)) (not (= kbtab_probe_~tmp___9~1.offset 0))) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 10:51:59,064 INFO L425 ceAbstractionStarter]: For program point L3874-1(line 3874) no Hoare annotation was computed. [2018-11-10 10:51:59,064 INFO L425 ceAbstractionStarter]: For program point L3858(line 3858) no Hoare annotation was computed. [2018-11-10 10:51:59,064 INFO L425 ceAbstractionStarter]: For program point kbtab_probeEXIT(lines 3795 3892) no Hoare annotation was computed. [2018-11-10 10:51:59,064 INFO L425 ceAbstractionStarter]: For program point L3825-1(line 3825) no Hoare annotation was computed. [2018-11-10 10:51:59,064 INFO L421 ceAbstractionStarter]: At program point L3825(line 3825) the Hoare annotation is: (or (and (= 0 ~ldv_urb_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (= 0 ~ldv_coherent_state~0)) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 10:51:59,064 INFO L425 ceAbstractionStarter]: For program point L3850(line 3850) no Hoare annotation was computed. [2018-11-10 10:51:59,064 INFO L421 ceAbstractionStarter]: At program point L3883-1(line 3883) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (and (or (not (= kbtab_probe_~tmp___9~1.base 0)) (not (= kbtab_probe_~tmp___9~1.offset 0))) (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1))) (not (= 0 kbtab_probe_~error~0))) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2018-11-10 10:51:59,064 INFO L425 ceAbstractionStarter]: For program point L3883(line 3883) no Hoare annotation was computed. [2018-11-10 10:51:59,064 INFO L425 ceAbstractionStarter]: For program point L3883-2(line 3883) no Hoare annotation was computed. [2018-11-10 10:51:59,064 INFO L425 ceAbstractionStarter]: For program point L3842(line 3842) no Hoare annotation was computed. [2018-11-10 10:51:59,064 INFO L425 ceAbstractionStarter]: For program point L3532(line 3532) no Hoare annotation was computed. [2018-11-10 10:51:59,065 INFO L428 ceAbstractionStarter]: At program point input_set_drvdataENTRY(lines 3527 3536) the Hoare annotation is: true [2018-11-10 10:51:59,065 INFO L425 ceAbstractionStarter]: For program point input_set_drvdataFINAL(lines 3527 3536) no Hoare annotation was computed. [2018-11-10 10:51:59,065 INFO L425 ceAbstractionStarter]: For program point L3532-1(line 3532) no Hoare annotation was computed. [2018-11-10 10:51:59,065 INFO L425 ceAbstractionStarter]: For program point input_set_drvdataEXIT(lines 3527 3536) no Hoare annotation was computed. [2018-11-10 10:51:59,065 INFO L425 ceAbstractionStarter]: For program point usb_make_pathEXIT(lines 3445 3460) no Hoare annotation was computed. [2018-11-10 10:51:59,065 INFO L425 ceAbstractionStarter]: For program point L3453(lines 3453 3457) no Hoare annotation was computed. [2018-11-10 10:51:59,065 INFO L425 ceAbstractionStarter]: For program point L3451-1(line 3451) no Hoare annotation was computed. [2018-11-10 10:51:59,065 INFO L425 ceAbstractionStarter]: For program point L3451(line 3451) no Hoare annotation was computed. [2018-11-10 10:51:59,065 INFO L425 ceAbstractionStarter]: For program point L3453-2(lines 3453 3457) no Hoare annotation was computed. [2018-11-10 10:51:59,065 INFO L425 ceAbstractionStarter]: For program point L3451-2(line 3451) no Hoare annotation was computed. [2018-11-10 10:51:59,065 INFO L428 ceAbstractionStarter]: At program point usb_make_pathENTRY(lines 3445 3460) the Hoare annotation is: true [2018-11-10 10:51:59,065 INFO L425 ceAbstractionStarter]: For program point usb_make_pathFINAL(lines 3445 3460) no Hoare annotation was computed. [2018-11-10 10:51:59,065 INFO L421 ceAbstractionStarter]: At program point L4210(line 4210) the Hoare annotation is: (or (< ~ldv_coherent_state~0 1) (not (= ~res_kbtab_probe_3~0 0)) (< |old(~ldv_urb_state~0)| 1)) [2018-11-10 10:51:59,066 INFO L425 ceAbstractionStarter]: For program point L4206(lines 4206 4212) no Hoare annotation was computed. [2018-11-10 10:51:59,066 INFO L425 ceAbstractionStarter]: For program point L4210-1(lines 4206 4212) no Hoare annotation was computed. [2018-11-10 10:51:59,066 INFO L425 ceAbstractionStarter]: For program point L4198(lines 4196 4218) no Hoare annotation was computed. [2018-11-10 10:51:59,066 INFO L425 ceAbstractionStarter]: For program point usb_free_urbEXIT(lines 4191 4224) no Hoare annotation was computed. [2018-11-10 10:51:59,066 INFO L428 ceAbstractionStarter]: At program point L4200(line 4200) the Hoare annotation is: true [2018-11-10 10:51:59,066 INFO L421 ceAbstractionStarter]: At program point L4196loopEntry(lines 4196 4218) the Hoare annotation is: (or (< ~ldv_coherent_state~0 1) (not (= ~res_kbtab_probe_3~0 0)) (< |old(~ldv_urb_state~0)| 1) (= |old(~ldv_urb_state~0)| ~ldv_urb_state~0)) [2018-11-10 10:51:59,066 INFO L421 ceAbstractionStarter]: At program point usb_free_urbENTRY(lines 4191 4224) the Hoare annotation is: (or (< ~ldv_coherent_state~0 1) (not (= ~res_kbtab_probe_3~0 0)) (< |old(~ldv_urb_state~0)| 1) (= |old(~ldv_urb_state~0)| ~ldv_urb_state~0)) [2018-11-10 10:51:59,066 INFO L425 ceAbstractionStarter]: For program point L4196-1(lines 4196 4218) no Hoare annotation was computed. [2018-11-10 10:51:59,066 INFO L421 ceAbstractionStarter]: At program point L4219(lines 4191 4224) the Hoare annotation is: (or (let ((.cse0 (+ ~ldv_urb_state~0 1))) (and (< 0 .cse0) (<= .cse0 |old(~ldv_urb_state~0)|) (let ((.cse1 (div (+ usb_free_urb_~urb.base usb_free_urb_~urb.offset) 18446744073709551616))) (or (<= (+ .cse1 1) 0) (< (* 18446744073709551616 .cse1) (+ usb_free_urb_~urb.offset usb_free_urb_~urb.base)))))) (< ~ldv_coherent_state~0 1) (not (= ~res_kbtab_probe_3~0 0)) (< |old(~ldv_urb_state~0)| 1)) [2018-11-10 10:51:59,066 INFO L425 ceAbstractionStarter]: For program point L4197(lines 4196 4218) no Hoare annotation was computed. [2018-11-10 10:51:59,067 INFO L428 ceAbstractionStarter]: At program point __create_pipeENTRY(lines 3505 3511) the Hoare annotation is: true [2018-11-10 10:51:59,067 INFO L425 ceAbstractionStarter]: For program point __create_pipeFINAL(lines 3505 3511) no Hoare annotation was computed. [2018-11-10 10:51:59,067 INFO L425 ceAbstractionStarter]: For program point __create_pipeEXIT(lines 3505 3511) no Hoare annotation was computed. [2018-11-10 10:51:59,067 INFO L425 ceAbstractionStarter]: For program point L3509-1(line 3509) no Hoare annotation was computed. [2018-11-10 10:51:59,067 INFO L425 ceAbstractionStarter]: For program point L3509(line 3509) no Hoare annotation was computed. [2018-11-10 10:51:59,067 INFO L425 ceAbstractionStarter]: For program point input_report_keyENTRY(lines 3541 3551) no Hoare annotation was computed. [2018-11-10 10:51:59,067 INFO L425 ceAbstractionStarter]: For program point L3547(line 3547) no Hoare annotation was computed. [2018-11-10 10:51:59,067 INFO L425 ceAbstractionStarter]: For program point input_report_keyFINAL(lines 3541 3551) no Hoare annotation was computed. [2018-11-10 10:51:59,067 INFO L425 ceAbstractionStarter]: For program point input_report_keyEXIT(lines 3541 3551) no Hoare annotation was computed. [2018-11-10 10:51:59,067 INFO L425 ceAbstractionStarter]: For program point input_allocate_deviceFINAL(lines 3512 3514) no Hoare annotation was computed. [2018-11-10 10:51:59,067 INFO L428 ceAbstractionStarter]: At program point input_allocate_deviceENTRY(lines 3512 3514) the Hoare annotation is: true [2018-11-10 10:51:59,067 INFO L425 ceAbstractionStarter]: For program point input_allocate_deviceEXIT(lines 3512 3514) no Hoare annotation was computed. [2018-11-10 10:51:59,068 INFO L425 ceAbstractionStarter]: For program point L3513(line 3513) no Hoare annotation was computed. [2018-11-10 10:51:59,068 INFO L425 ceAbstractionStarter]: For program point L3628(lines 3628 3633) no Hoare annotation was computed. [2018-11-10 10:51:59,068 INFO L425 ceAbstractionStarter]: For program point L3628-2(lines 3628 3633) no Hoare annotation was computed. [2018-11-10 10:51:59,068 INFO L425 ceAbstractionStarter]: For program point L3467(line 3467) no Hoare annotation was computed. [2018-11-10 10:51:59,068 INFO L425 ceAbstractionStarter]: For program point L3628-1(lines 3628 3633) no Hoare annotation was computed. [2018-11-10 10:51:59,068 INFO L425 ceAbstractionStarter]: For program point L3628-4(lines 3628 3633) no Hoare annotation was computed. [2018-11-10 10:51:59,068 INFO L425 ceAbstractionStarter]: For program point L3628-3(lines 3628 3633) no Hoare annotation was computed. [2018-11-10 10:51:59,068 INFO L425 ceAbstractionStarter]: For program point L3628-6(lines 3628 3633) no Hoare annotation was computed. [2018-11-10 10:51:59,068 INFO L425 ceAbstractionStarter]: For program point L3628-5(lines 3628 3633) no Hoare annotation was computed. [2018-11-10 10:51:59,068 INFO L425 ceAbstractionStarter]: For program point L3628-8(lines 3628 3633) no Hoare annotation was computed. [2018-11-10 10:51:59,068 INFO L425 ceAbstractionStarter]: For program point L3628-7(lines 3628 3633) no Hoare annotation was computed. [2018-11-10 10:51:59,068 INFO L425 ceAbstractionStarter]: For program point L3628-10(lines 3628 3633) no Hoare annotation was computed. [2018-11-10 10:51:59,068 INFO L425 ceAbstractionStarter]: For program point L3628-9(lines 3628 3633) no Hoare annotation was computed. [2018-11-10 10:51:59,068 INFO L425 ceAbstractionStarter]: For program point L3628-12(lines 3628 3633) no Hoare annotation was computed. [2018-11-10 10:51:59,069 INFO L425 ceAbstractionStarter]: For program point L3628-11(lines 3628 3633) no Hoare annotation was computed. [2018-11-10 10:51:59,069 INFO L425 ceAbstractionStarter]: For program point L3628-14(lines 3628 3633) no Hoare annotation was computed. [2018-11-10 10:51:59,069 INFO L425 ceAbstractionStarter]: For program point L3628-13(lines 3628 3633) no Hoare annotation was computed. [2018-11-10 10:51:59,069 INFO L425 ceAbstractionStarter]: For program point L3628-16(lines 3628 3633) no Hoare annotation was computed. [2018-11-10 10:51:59,069 INFO L425 ceAbstractionStarter]: For program point L3628-15(lines 3628 3633) no Hoare annotation was computed. [2018-11-10 10:51:59,069 INFO L425 ceAbstractionStarter]: For program point L3451-1(line 3451) no Hoare annotation was computed. [2018-11-10 10:51:59,069 INFO L425 ceAbstractionStarter]: For program point L3628-18(lines 3628 3633) no Hoare annotation was computed. [2018-11-10 10:51:59,069 INFO L425 ceAbstractionStarter]: For program point L3451(line 3451) no Hoare annotation was computed. [2018-11-10 10:51:59,069 INFO L425 ceAbstractionStarter]: For program point L3628-17(lines 3628 3633) no Hoare annotation was computed. [2018-11-10 10:51:59,069 INFO L425 ceAbstractionStarter]: For program point L3757-1(lines 3757 3759) no Hoare annotation was computed. [2018-11-10 10:51:59,069 INFO L425 ceAbstractionStarter]: For program point L3757(lines 3757 3759) no Hoare annotation was computed. [2018-11-10 10:51:59,069 INFO L425 ceAbstractionStarter]: For program point L3757-3(lines 3757 3759) no Hoare annotation was computed. [2018-11-10 10:51:59,069 INFO L425 ceAbstractionStarter]: For program point L3757-2(lines 3757 3759) no Hoare annotation was computed. [2018-11-10 10:51:59,069 INFO L425 ceAbstractionStarter]: For program point L3757-5(lines 3757 3759) no Hoare annotation was computed. [2018-11-10 10:51:59,070 INFO L425 ceAbstractionStarter]: For program point L3757-4(lines 3757 3759) no Hoare annotation was computed. [2018-11-10 10:51:59,070 INFO L425 ceAbstractionStarter]: For program point L3757-7(lines 3757 3759) no Hoare annotation was computed. [2018-11-10 10:51:59,070 INFO L425 ceAbstractionStarter]: For program point L3910(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,070 INFO L425 ceAbstractionStarter]: For program point L3757-6(lines 3757 3759) no Hoare annotation was computed. [2018-11-10 10:51:59,070 INFO L425 ceAbstractionStarter]: For program point L3749-1(line 3749) no Hoare annotation was computed. [2018-11-10 10:51:59,070 INFO L425 ceAbstractionStarter]: For program point L3757-9(lines 3757 3759) no Hoare annotation was computed. [2018-11-10 10:51:59,070 INFO L425 ceAbstractionStarter]: For program point L3910-2(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,070 INFO L425 ceAbstractionStarter]: For program point L3749(line 3749) no Hoare annotation was computed. [2018-11-10 10:51:59,070 INFO L425 ceAbstractionStarter]: For program point L3757-8(lines 3757 3759) no Hoare annotation was computed. [2018-11-10 10:51:59,070 INFO L425 ceAbstractionStarter]: For program point L3910-1(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,070 INFO L425 ceAbstractionStarter]: For program point L3757-11(lines 3757 3759) no Hoare annotation was computed. [2018-11-10 10:51:59,070 INFO L425 ceAbstractionStarter]: For program point L3910-4(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,070 INFO L425 ceAbstractionStarter]: For program point L3749-2(line 3749) no Hoare annotation was computed. [2018-11-10 10:51:59,070 INFO L425 ceAbstractionStarter]: For program point L3757-10(lines 3757 3759) no Hoare annotation was computed. [2018-11-10 10:51:59,071 INFO L425 ceAbstractionStarter]: For program point L3910-3(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,071 INFO L425 ceAbstractionStarter]: For program point L3757-13(lines 3757 3759) no Hoare annotation was computed. [2018-11-10 10:51:59,071 INFO L425 ceAbstractionStarter]: For program point L3910-6(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,071 INFO L425 ceAbstractionStarter]: For program point L3757-12(lines 3757 3759) no Hoare annotation was computed. [2018-11-10 10:51:59,071 INFO L425 ceAbstractionStarter]: For program point L3910-5(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,071 INFO L425 ceAbstractionStarter]: For program point L3910-8(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,071 INFO L425 ceAbstractionStarter]: For program point L3910-7(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,071 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,071 INFO L425 ceAbstractionStarter]: For program point L3910-10(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,071 INFO L425 ceAbstractionStarter]: For program point L3910-9(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,071 INFO L425 ceAbstractionStarter]: For program point L3910-12(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,071 INFO L425 ceAbstractionStarter]: For program point L3910-11(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,071 INFO L425 ceAbstractionStarter]: For program point L3910-14(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,071 INFO L425 ceAbstractionStarter]: For program point L3910-13(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,072 INFO L425 ceAbstractionStarter]: For program point L3910-16(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,072 INFO L425 ceAbstractionStarter]: For program point L3910-15(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,072 INFO L425 ceAbstractionStarter]: For program point L3910-18(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,072 INFO L425 ceAbstractionStarter]: For program point L3910-17(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,072 INFO L425 ceAbstractionStarter]: For program point L3910-20(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,072 INFO L425 ceAbstractionStarter]: For program point L3910-19(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,072 INFO L425 ceAbstractionStarter]: For program point L3910-22(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,072 INFO L425 ceAbstractionStarter]: For program point L3910-21(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,072 INFO L425 ceAbstractionStarter]: For program point L3910-24(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,072 INFO L425 ceAbstractionStarter]: For program point L3910-23(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,072 INFO L425 ceAbstractionStarter]: For program point L3910-26(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,072 INFO L425 ceAbstractionStarter]: For program point L3910-25(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,072 INFO L425 ceAbstractionStarter]: For program point L3910-28(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,072 INFO L425 ceAbstractionStarter]: For program point L3910-27(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,073 INFO L425 ceAbstractionStarter]: For program point L3910-30(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,073 INFO L425 ceAbstractionStarter]: For program point L3910-29(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,073 INFO L425 ceAbstractionStarter]: For program point L3910-32(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,073 INFO L425 ceAbstractionStarter]: For program point L3911(line 3911) no Hoare annotation was computed. [2018-11-10 10:51:59,073 INFO L425 ceAbstractionStarter]: For program point L3910-31(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,073 INFO L425 ceAbstractionStarter]: For program point L3910-34(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,073 INFO L425 ceAbstractionStarter]: For program point L3845(line 3845) no Hoare annotation was computed. [2018-11-10 10:51:59,073 INFO L425 ceAbstractionStarter]: For program point L3910-33(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,073 INFO L425 ceAbstractionStarter]: For program point L3910-36(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,073 INFO L425 ceAbstractionStarter]: For program point L3910-35(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,073 INFO L425 ceAbstractionStarter]: For program point L3910-38(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,073 INFO L425 ceAbstractionStarter]: For program point L3910-37(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,073 INFO L425 ceAbstractionStarter]: For program point L3910-39(lines 3910 3925) no Hoare annotation was computed. [2018-11-10 10:51:59,074 INFO L425 ceAbstractionStarter]: For program point L3627-1(line 3627) no Hoare annotation was computed. [2018-11-10 10:51:59,074 INFO L425 ceAbstractionStarter]: For program point L3627(line 3627) no Hoare annotation was computed. [2018-11-10 10:51:59,074 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= |old(~ldv_urb_state~0)| ~ldv_urb_state~0)) [2018-11-10 10:51:59,074 INFO L425 ceAbstractionStarter]: For program point L3627-2(line 3627) no Hoare annotation was computed. [2018-11-10 10:51:59,074 INFO L425 ceAbstractionStarter]: For program point L3846(line 3846) no Hoare annotation was computed. [2018-11-10 10:51:59,074 INFO L425 ceAbstractionStarter]: For program point L3941-1(line 3941) no Hoare annotation was computed. [2018-11-10 10:51:59,074 INFO L425 ceAbstractionStarter]: For program point L3941(line 3941) no Hoare annotation was computed. [2018-11-10 10:51:59,074 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 10:51:59,074 INFO L425 ceAbstractionStarter]: For program point L3441-1(line 3441) no Hoare annotation was computed. [2018-11-10 10:51:59,074 INFO L425 ceAbstractionStarter]: For program point L3441(line 3441) no Hoare annotation was computed. [2018-11-10 10:51:59,074 INFO L425 ceAbstractionStarter]: For program point interface_to_usbdevFINAL(lines 3437 3444) no Hoare annotation was computed. [2018-11-10 10:51:59,074 INFO L428 ceAbstractionStarter]: At program point interface_to_usbdevENTRY(lines 3437 3444) the Hoare annotation is: true [2018-11-10 10:51:59,074 INFO L425 ceAbstractionStarter]: For program point interface_to_usbdevEXIT(lines 3437 3444) no Hoare annotation was computed. [2018-11-10 10:51:59,075 INFO L421 ceAbstractionStarter]: At program point usb_alloc_urbENTRY(lines 4163 4189) the Hoare annotation is: (or (= 0 ~ldv_urb_state~0) (< 1 ~ldv_coherent_state~0) (< ~ldv_coherent_state~0 1) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|))) [2018-11-10 10:51:59,075 INFO L425 ceAbstractionStarter]: For program point L4184(lines 4168 4185) no Hoare annotation was computed. [2018-11-10 10:51:59,075 INFO L425 ceAbstractionStarter]: For program point usb_alloc_urbFINAL(lines 4163 4189) no Hoare annotation was computed. [2018-11-10 10:51:59,075 INFO L425 ceAbstractionStarter]: For program point L4175(lines 4175 4179) no Hoare annotation was computed. [2018-11-10 10:51:59,075 INFO L425 ceAbstractionStarter]: For program point L4172(line 4172) no Hoare annotation was computed. [2018-11-10 10:51:59,075 INFO L425 ceAbstractionStarter]: For program point L4170(line 4170) no Hoare annotation was computed. [2018-11-10 10:51:59,075 INFO L425 ceAbstractionStarter]: For program point L4169-1(lines 4169 4183) no Hoare annotation was computed. [2018-11-10 10:51:59,075 INFO L421 ceAbstractionStarter]: At program point L4169loopEntry(lines 4169 4183) the Hoare annotation is: (or (= 0 ~ldv_urb_state~0) (< 1 ~ldv_coherent_state~0) (< ~ldv_coherent_state~0 1) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|))) [2018-11-10 10:51:59,075 INFO L425 ceAbstractionStarter]: For program point usb_alloc_urbEXIT(lines 4163 4189) no Hoare annotation was computed. [2018-11-10 10:51:59,075 INFO L428 ceAbstractionStarter]: At program point ldv_check_final_stateENTRY(lines 4226 4246) the Hoare annotation is: true [2018-11-10 10:51:59,075 INFO L421 ceAbstractionStarter]: At program point L4241(line 4241) the Hoare annotation is: (or (not (= 0 ~ldv_urb_state~0)) (not (= 0 ~ldv_coherent_state~0))) [2018-11-10 10:51:59,075 INFO L425 ceAbstractionStarter]: For program point L4241-1(lines 4226 4246) no Hoare annotation was computed. [2018-11-10 10:51:59,076 INFO L421 ceAbstractionStarter]: At program point L4234(line 4234) the Hoare annotation is: (or (not (= 0 ~ldv_urb_state~0)) (not (= 0 ~ldv_coherent_state~0))) [2018-11-10 10:51:59,076 INFO L425 ceAbstractionStarter]: For program point L4234-1(lines 4229 4245) no Hoare annotation was computed. [2018-11-10 10:51:59,076 INFO L425 ceAbstractionStarter]: For program point ldv_check_final_stateEXIT(lines 4226 4246) no Hoare annotation was computed. [2018-11-10 10:51:59,076 INFO L428 ceAbstractionStarter]: At program point usb_registerENTRY(lines 3462 3471) the Hoare annotation is: true [2018-11-10 10:51:59,076 INFO L425 ceAbstractionStarter]: For program point L3467-1(line 3467) no Hoare annotation was computed. [2018-11-10 10:51:59,076 INFO L425 ceAbstractionStarter]: For program point usb_registerEXIT(lines 3462 3471) no Hoare annotation was computed. [2018-11-10 10:51:59,076 INFO L425 ceAbstractionStarter]: For program point L3467(line 3467) no Hoare annotation was computed. [2018-11-10 10:51:59,076 INFO L425 ceAbstractionStarter]: For program point usb_registerFINAL(lines 3462 3471) no Hoare annotation was computed. [2018-11-10 10:51:59,076 INFO L425 ceAbstractionStarter]: For program point cleanup_moduleENTRY(lines 3969 3978) no Hoare annotation was computed. [2018-11-10 10:51:59,076 INFO L425 ceAbstractionStarter]: For program point cleanup_moduleEXIT(lines 3969 3978) no Hoare annotation was computed. [2018-11-10 10:51:59,076 INFO L425 ceAbstractionStarter]: For program point cleanup_moduleFINAL(lines 3969 3978) no Hoare annotation was computed. [2018-11-10 10:51:59,076 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 10:51:59,077 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~ldv_urb_state~0) (= 0 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0)) [2018-11-10 10:51:59,077 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 10:51:59,077 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 10:51:59,077 INFO L425 ceAbstractionStarter]: For program point L3790(line 3790) no Hoare annotation was computed. [2018-11-10 10:51:59,077 INFO L425 ceAbstractionStarter]: For program point kbtab_closeEXIT(lines 3782 3794) no Hoare annotation was computed. [2018-11-10 10:51:59,077 INFO L425 ceAbstractionStarter]: For program point L3788(line 3788) no Hoare annotation was computed. [2018-11-10 10:51:59,077 INFO L425 ceAbstractionStarter]: For program point L3790-2(line 3790) no Hoare annotation was computed. [2018-11-10 10:51:59,077 INFO L425 ceAbstractionStarter]: For program point L3790-1(line 3790) no Hoare annotation was computed. [2018-11-10 10:51:59,077 INFO L425 ceAbstractionStarter]: For program point kbtab_closeENTRY(lines 3782 3794) no Hoare annotation was computed. [2018-11-10 10:51:59,077 INFO L425 ceAbstractionStarter]: For program point L3788-1(line 3788) no Hoare annotation was computed. [2018-11-10 10:51:59,077 INFO L425 ceAbstractionStarter]: For program point kbtab_closeFINAL(lines 3782 3794) no Hoare annotation was computed. [2018-11-10 10:51:59,077 INFO L425 ceAbstractionStarter]: For program point input_report_absENTRY(lines 3552 3562) no Hoare annotation was computed. [2018-11-10 10:51:59,077 INFO L425 ceAbstractionStarter]: For program point input_report_absEXIT(lines 3552 3562) no Hoare annotation was computed. [2018-11-10 10:51:59,077 INFO L425 ceAbstractionStarter]: For program point input_report_absFINAL(lines 3552 3562) no Hoare annotation was computed. [2018-11-10 10:51:59,078 INFO L425 ceAbstractionStarter]: For program point L3558(line 3558) no Hoare annotation was computed. [2018-11-10 10:51:59,078 INFO L425 ceAbstractionStarter]: For program point get_unaligned_le16EXIT(lines 3586 3595) no Hoare annotation was computed. [2018-11-10 10:51:59,078 INFO L425 ceAbstractionStarter]: For program point L3591-1(line 3591) no Hoare annotation was computed. [2018-11-10 10:51:59,078 INFO L425 ceAbstractionStarter]: For program point L3591(line 3591) no Hoare annotation was computed. [2018-11-10 10:51:59,078 INFO L425 ceAbstractionStarter]: For program point get_unaligned_le16ENTRY(lines 3586 3595) no Hoare annotation was computed. [2018-11-10 10:51:59,078 INFO L425 ceAbstractionStarter]: For program point get_unaligned_le16FINAL(lines 3586 3595) no Hoare annotation was computed. [2018-11-10 10:51:59,078 INFO L428 ceAbstractionStarter]: At program point ldv_blast_assertENTRY(lines 4077 4083) the Hoare annotation is: true [2018-11-10 10:51:59,078 INFO L425 ceAbstractionStarter]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4081) no Hoare annotation was computed. [2018-11-10 10:51:59,078 INFO L425 ceAbstractionStarter]: For program point ldv_blast_assertEXIT(lines 4077 4083) no Hoare annotation was computed. [2018-11-10 10:51:59,078 INFO L425 ceAbstractionStarter]: For program point ldv_blast_assertFINAL(lines 4077 4083) no Hoare annotation was computed. [2018-11-10 10:51:59,078 INFO L425 ceAbstractionStarter]: For program point L3747-2(lines 3663 3756) no Hoare annotation was computed. [2018-11-10 10:51:59,078 INFO L425 ceAbstractionStarter]: For program point L3677-1(lines 3677 3716) no Hoare annotation was computed. [2018-11-10 10:51:59,078 INFO L425 ceAbstractionStarter]: For program point L3677(line 3677) no Hoare annotation was computed. [2018-11-10 10:51:59,079 INFO L425 ceAbstractionStarter]: For program point L3731-1(lines 3731 3735) no Hoare annotation was computed. [2018-11-10 10:51:59,079 INFO L425 ceAbstractionStarter]: For program point L3731(line 3731) no Hoare annotation was computed. [2018-11-10 10:51:59,079 INFO L425 ceAbstractionStarter]: For program point L3731-3(lines 3731 3735) no Hoare annotation was computed. [2018-11-10 10:51:59,079 INFO L425 ceAbstractionStarter]: For program point L3723-1(line 3723) no Hoare annotation was computed. [2018-11-10 10:51:59,079 INFO L425 ceAbstractionStarter]: For program point L3723(line 3723) no Hoare annotation was computed. [2018-11-10 10:51:59,079 INFO L425 ceAbstractionStarter]: For program point L3686(line 3686) no Hoare annotation was computed. [2018-11-10 10:51:59,079 INFO L425 ceAbstractionStarter]: For program point L3719(line 3719) no Hoare annotation was computed. [2018-11-10 10:51:59,079 INFO L425 ceAbstractionStarter]: For program point L3686-1(lines 3686 3716) no Hoare annotation was computed. [2018-11-10 10:51:59,079 INFO L425 ceAbstractionStarter]: For program point $Ultimate##9(lines 3690 3715) no Hoare annotation was computed. [2018-11-10 10:51:59,079 INFO L425 ceAbstractionStarter]: For program point L3674(line 3674) no Hoare annotation was computed. [2018-11-10 10:51:59,079 INFO L425 ceAbstractionStarter]: For program point L3674-1(line 3674) no Hoare annotation was computed. [2018-11-10 10:51:59,079 INFO L425 ceAbstractionStarter]: For program point kbtab_irqENTRY(lines 3663 3756) no Hoare annotation was computed. [2018-11-10 10:51:59,079 INFO L425 ceAbstractionStarter]: For program point L3728(line 3728) no Hoare annotation was computed. [2018-11-10 10:51:59,080 INFO L425 ceAbstractionStarter]: For program point L3695(lines 3695 3698) no Hoare annotation was computed. [2018-11-10 10:51:59,080 INFO L425 ceAbstractionStarter]: For program point L3724(line 3724) no Hoare annotation was computed. [2018-11-10 10:51:59,080 INFO L425 ceAbstractionStarter]: For program point L3724-1(line 3724) no Hoare annotation was computed. [2018-11-10 10:51:59,080 INFO L425 ceAbstractionStarter]: For program point L3720(line 3720) no Hoare annotation was computed. [2018-11-10 10:51:59,080 INFO L425 ceAbstractionStarter]: For program point L3687(lines 3680 3716) no Hoare annotation was computed. [2018-11-10 10:51:59,080 INFO L425 ceAbstractionStarter]: For program point L3720-1(line 3720) no Hoare annotation was computed. [2018-11-10 10:51:59,080 INFO L425 ceAbstractionStarter]: For program point L3683-1(lines 3683 3716) no Hoare annotation was computed. [2018-11-10 10:51:59,080 INFO L425 ceAbstractionStarter]: For program point L3683(line 3683) no Hoare annotation was computed. [2018-11-10 10:51:59,080 INFO L425 ceAbstractionStarter]: For program point L3745(line 3745) no Hoare annotation was computed. [2018-11-10 10:51:59,080 INFO L425 ceAbstractionStarter]: For program point L3741(lines 3673 3755) no Hoare annotation was computed. [2018-11-10 10:51:59,080 INFO L425 ceAbstractionStarter]: For program point L3675-1(line 3675) no Hoare annotation was computed. [2018-11-10 10:51:59,080 INFO L425 ceAbstractionStarter]: For program point L3675(line 3675) no Hoare annotation was computed. [2018-11-10 10:51:59,080 INFO L425 ceAbstractionStarter]: For program point L3737(lines 3726 3739) no Hoare annotation was computed. [2018-11-10 10:51:59,080 INFO L425 ceAbstractionStarter]: For program point kbtab_irqEXIT(lines 3663 3756) no Hoare annotation was computed. [2018-11-10 10:51:59,081 INFO L425 ceAbstractionStarter]: For program point $Ultimate##10(lines 3690 3715) no Hoare annotation was computed. [2018-11-10 10:51:59,081 INFO L425 ceAbstractionStarter]: For program point L3721(line 3721) no Hoare annotation was computed. [2018-11-10 10:51:59,081 INFO L425 ceAbstractionStarter]: For program point L3680(line 3680) no Hoare annotation was computed. [2018-11-10 10:51:59,081 INFO L425 ceAbstractionStarter]: For program point L3680-1(lines 3680 3716) no Hoare annotation was computed. [2018-11-10 10:51:59,081 INFO L425 ceAbstractionStarter]: For program point L3676(line 3676) no Hoare annotation was computed. [2018-11-10 10:51:59,081 INFO L425 ceAbstractionStarter]: For program point L3676-1(line 3676) no Hoare annotation was computed. [2018-11-10 10:51:59,081 INFO L425 ceAbstractionStarter]: For program point L3705(lines 3705 3708) no Hoare annotation was computed. [2018-11-10 10:51:59,081 INFO L425 ceAbstractionStarter]: For program point L3726(line 3726) no Hoare annotation was computed. [2018-11-10 10:51:59,081 INFO L425 ceAbstractionStarter]: For program point L3726-1(lines 3726 3739) no Hoare annotation was computed. [2018-11-10 10:51:59,081 INFO L425 ceAbstractionStarter]: For program point L3722(line 3722) no Hoare annotation was computed. [2018-11-10 10:51:59,081 INFO L425 ceAbstractionStarter]: For program point L3689(lines 3688 3716) no Hoare annotation was computed. [2018-11-10 10:51:59,081 INFO L425 ceAbstractionStarter]: For program point L3722-1(line 3722) no Hoare annotation was computed. [2018-11-10 10:51:59,081 INFO L425 ceAbstractionStarter]: For program point L3718(line 3718) no Hoare annotation was computed. [2018-11-10 10:51:59,082 INFO L425 ceAbstractionStarter]: For program point L3714(lines 3677 3716) no Hoare annotation was computed. [2018-11-10 10:51:59,082 INFO L425 ceAbstractionStarter]: For program point L3747(lines 3747 3753) no Hoare annotation was computed. [2018-11-10 10:51:59,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:51:59 BoogieIcfgContainer [2018-11-10 10:51:59,105 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 10:51:59,105 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:51:59,105 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:51:59,105 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:51:59,106 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:51:45" (3/4) ... [2018-11-10 10:51:59,109 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 10:51:59,120 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_fill_int_urb [2018-11-10 10:51:59,120 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure input_get_drvdata [2018-11-10 10:51:59,120 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_init [2018-11-10 10:51:59,120 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_disconnect [2018-11-10 10:51:59,120 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __le16_to_cpup [2018-11-10 10:51:59,120 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_module [2018-11-10 10:51:59,120 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 10:51:59,120 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_get_intfdata [2018-11-10 10:51:59,120 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_exit [2018-11-10 10:51:59,120 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_to_input_id [2018-11-10 10:51:59,121 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2018-11-10 10:51:59,121 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure input_sync [2018-11-10 10:51:59,121 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2018-11-10 10:51:59,121 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2018-11-10 10:51:59,121 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_open [2018-11-10 10:51:59,121 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_coherent [2018-11-10 10:51:59,121 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_alloc_coherent [2018-11-10 10:51:59,121 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_set_intfdata [2018-11-10 10:51:59,121 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_probe [2018-11-10 10:51:59,121 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure input_set_drvdata [2018-11-10 10:51:59,121 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_make_path [2018-11-10 10:51:59,121 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2018-11-10 10:51:59,122 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __create_pipe [2018-11-10 10:51:59,122 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure input_report_key [2018-11-10 10:51:59,122 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure input_allocate_device [2018-11-10 10:51:59,122 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 10:51:59,122 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure interface_to_usbdev [2018-11-10 10:51:59,122 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_alloc_urb [2018-11-10 10:51:59,122 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_final_state [2018-11-10 10:51:59,122 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_register [2018-11-10 10:51:59,123 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup_module [2018-11-10 10:51:59,123 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure input_report_abs [2018-11-10 10:51:59,123 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure get_unaligned_le16 [2018-11-10 10:51:59,123 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_close [2018-11-10 10:51:59,123 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2018-11-10 10:51:59,123 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_irq [2018-11-10 10:51:59,138 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 190 nodes and edges [2018-11-10 10:51:59,139 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 86 nodes and edges [2018-11-10 10:51:59,140 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 40 nodes and edges [2018-11-10 10:51:59,140 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-11-10 10:51:59,141 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-10 10:51:59,150 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-10 10:51:59,182 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == ldv_urb_state && 0 == ldv_coherent_state) || !(\old(res_kbtab_probe_3) == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) [2018-11-10 10:51:59,182 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(res_kbtab_probe_3) == 0) || !(0 == \old(ldv_urb_state))) || (((0 == ldv_coherent_state && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1)) || (((((1 <= ldv_coherent_state && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && ldv_urb_state <= \old(ldv_urb_state) + 1) && 1 <= ldv_urb_state) && ldv_coherent_state <= \old(ldv_coherent_state) + 1)) || !(0 == \old(ldv_coherent_state)) [2018-11-10 10:51:59,182 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == ldv_urb_state && 0 == ldv_coherent_state) || !(\old(res_kbtab_probe_3) == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) [2018-11-10 10:51:59,183 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((ldv_coherent_state + 1 <= \old(ldv_coherent_state) && 0 < ldv_coherent_state + 1) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || \old(ldv_coherent_state) < 1) || !(res_kbtab_probe_3 == 0)) && ((((ldv_coherent_state + 1 <= \old(ldv_coherent_state) && 0 < ldv_coherent_state + 1) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || \old(ldv_coherent_state) < 1) || !(0 == ldv_urb_state)) [2018-11-10 10:51:59,183 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 < ldv_urb_state + 1 && ldv_urb_state + 1 <= \old(ldv_urb_state)) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) || ldv_coherent_state < 1) || !(res_kbtab_probe_3 == 0)) || \old(ldv_urb_state) < 1 [2018-11-10 10:51:59,183 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((1 <= ldv_coherent_state && ((!(tmp___9 == 0) || !(tmp___9 == 0)) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1) && !(0 == error)) && ldv_coherent_state <= \old(ldv_coherent_state) + 1) || !(res_kbtab_probe_3 == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) [2018-11-10 10:51:59,183 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(res_kbtab_probe_3 == 0) || !(0 == \old(ldv_urb_state))) || (((((!(tmp___9 == 0) || !(tmp___9 == 0)) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1) && !(0 == error)) || (\old(ldv_urb_state) == ldv_urb_state && error + 12 <= 0)) && 0 == ldv_coherent_state)) || !(0 == \old(ldv_coherent_state)) [2018-11-10 10:51:59,183 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(res_kbtab_probe_3) == 0) || !(0 == \old(ldv_urb_state))) || (((0 == ldv_coherent_state && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1)) || (((((1 <= ldv_coherent_state && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && ldv_urb_state <= \old(ldv_urb_state) + 1) && 1 <= ldv_urb_state) && ldv_coherent_state <= \old(ldv_coherent_state) + 1)) || !(0 == \old(ldv_coherent_state)) [2018-11-10 10:51:59,183 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(res_kbtab_probe_3) == 0) || !(0 == \old(ldv_urb_state))) || (((0 == ldv_coherent_state && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1)) || (((((1 <= ldv_coherent_state && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && ldv_urb_state <= \old(ldv_urb_state) + 1) && 1 <= ldv_urb_state) && ldv_coherent_state <= \old(ldv_coherent_state) + 1)) || !(0 == \old(ldv_coherent_state)) [2018-11-10 10:51:59,184 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(ldv_coherent_state) < 1 || !(res_kbtab_probe_3 == 0)) || \old(ldv_coherent_state) == ldv_coherent_state) && ((\old(ldv_coherent_state) == ldv_coherent_state || \old(ldv_coherent_state) < 1) || !(0 == ldv_urb_state)) [2018-11-10 10:51:59,184 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_coherent_state < 1 || !(res_kbtab_probe_3 == 0)) || \old(ldv_urb_state) < 1) || \old(ldv_urb_state) == ldv_urb_state [2018-11-10 10:51:59,186 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == ldv_coherent_state || !(res_kbtab_probe_3 == 0)) || !(0 == ldv_urb_state)) || !(0 == \old(ldv_coherent_state)) [2018-11-10 10:51:59,186 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == ldv_urb_state || 1 < ldv_coherent_state) || ldv_coherent_state < 1) || !(res_kbtab_probe_3 == 0)) || !(0 == \old(ldv_urb_state)) [2018-11-10 10:51:59,187 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(res_kbtab_probe_3 == 0) || ((((((!(tmp___9 == 0) || !(tmp___9 == 0)) && 1 <= ldv_coherent_state) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && !(0 == error)) && 1 <= ldv_urb_state)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) [2018-11-10 10:51:59,263 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_62eec631-97ea-43d8-a703-383b0e349194/bin-2019/uautomizer/witness.graphml [2018-11-10 10:51:59,263 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:51:59,264 INFO L168 Benchmark]: Toolchain (without parser) took 15942.66 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 906.5 MB). Free memory was 952.8 MB in the beginning and 1.4 GB in the end (delta: -408.5 MB). Peak memory consumption was 497.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:51:59,264 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:51:59,264 INFO L168 Benchmark]: CACSL2BoogieTranslator took 959.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 952.8 MB in the beginning and 1.0 GB in the end (delta: -65.1 MB). Peak memory consumption was 179.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:51:59,265 INFO L168 Benchmark]: Boogie Preprocessor took 77.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. [2018-11-10 10:51:59,265 INFO L168 Benchmark]: RCFGBuilder took 1010.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 874.8 MB in the end (delta: 130.7 MB). Peak memory consumption was 130.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:51:59,265 INFO L168 Benchmark]: TraceAbstraction took 13733.84 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 756.5 MB). Free memory was 874.8 MB in the beginning and 1.4 GB in the end (delta: -508.2 MB). Peak memory consumption was 666.0 MB. Max. memory is 11.5 GB. [2018-11-10 10:51:59,265 INFO L168 Benchmark]: Witness Printer took 157.91 ms. Allocated memory is still 1.9 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. [2018-11-10 10:51:59,267 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 959.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 952.8 MB in the beginning and 1.0 GB in the end (delta: -65.1 MB). Peak memory consumption was 179.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1010.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 874.8 MB in the end (delta: 130.7 MB). Peak memory consumption was 130.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13733.84 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 756.5 MB). Free memory was 874.8 MB in the beginning and 1.4 GB in the end (delta: -508.2 MB). Peak memory consumption was 666.0 MB. Max. memory is 11.5 GB. * Witness Printer took 157.91 ms. Allocated memory is still 1.9 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4081]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4106]: Loop Invariant Derived loop invariant: ((0 == ldv_coherent_state || !(res_kbtab_probe_3 == 0)) || !(0 == ldv_urb_state)) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 4191]: Loop Invariant Derived loop invariant: ((((0 < ldv_urb_state + 1 && ldv_urb_state + 1 <= \old(ldv_urb_state)) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb)) || ldv_coherent_state < 1) || !(res_kbtab_probe_3 == 0)) || \old(ldv_urb_state) < 1 - InvariantResult [Line: 4169]: Loop Invariant Derived loop invariant: (((0 == ldv_urb_state || 1 < ldv_coherent_state) || ldv_coherent_state < 1) || !(res_kbtab_probe_3 == 0)) || !(0 == \old(ldv_urb_state)) - InvariantResult [Line: 4005]: Loop Invariant Derived loop invariant: (((0 == ldv_urb_state && 0 == ldv_coherent_state) || !(\old(res_kbtab_probe_3) == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 4128]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state + 1 <= \old(ldv_coherent_state) && 0 < ldv_coherent_state + 1) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || \old(ldv_coherent_state) < 1) || !(res_kbtab_probe_3 == 0)) && ((((ldv_coherent_state + 1 <= \old(ldv_coherent_state) && 0 < ldv_coherent_state + 1) && (18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr || (addr + addr) / 18446744073709551616 + 1 <= 0)) || \old(ldv_coherent_state) < 1) || !(0 == ldv_urb_state)) - InvariantResult [Line: 4006]: Loop Invariant Derived loop invariant: (((!(\old(res_kbtab_probe_3) == 0) || !(0 == \old(ldv_urb_state))) || (((0 == ldv_coherent_state && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1)) || (((((1 <= ldv_coherent_state && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && ldv_urb_state <= \old(ldv_urb_state) + 1) && 1 <= ldv_urb_state) && ldv_coherent_state <= \old(ldv_coherent_state) + 1)) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 3807]: Loop Invariant Derived loop invariant: ((!(res_kbtab_probe_3 == 0) || !(0 == \old(ldv_urb_state))) || (((((!(tmp___9 == 0) || !(tmp___9 == 0)) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1) && !(0 == error)) || (\old(ldv_urb_state) == ldv_urb_state && error + 12 <= 0)) && 0 == ldv_coherent_state)) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 4196]: Loop Invariant Derived loop invariant: ((ldv_coherent_state < 1 || !(res_kbtab_probe_3 == 0)) || \old(ldv_urb_state) < 1) || \old(ldv_urb_state) == ldv_urb_state - InvariantResult [Line: 4133]: Loop Invariant Derived loop invariant: ((\old(ldv_coherent_state) < 1 || !(res_kbtab_probe_3 == 0)) || \old(ldv_coherent_state) == ldv_coherent_state) && ((\old(ldv_coherent_state) == ldv_coherent_state || \old(ldv_coherent_state) < 1) || !(0 == ldv_urb_state)) - InvariantResult [Line: 3993]: Loop Invariant Derived loop invariant: (((0 == ldv_urb_state && 0 == ldv_coherent_state) || !(\old(res_kbtab_probe_3) == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 4025]: Loop Invariant Derived loop invariant: (((!(\old(res_kbtab_probe_3) == 0) || !(0 == \old(ldv_urb_state))) || (((0 == ldv_coherent_state && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1)) || (((((1 <= ldv_coherent_state && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && ldv_urb_state <= \old(ldv_urb_state) + 1) && 1 <= ldv_urb_state) && ldv_coherent_state <= \old(ldv_coherent_state) + 1)) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 3807]: Loop Invariant Derived loop invariant: ((((1 <= ldv_coherent_state && ((!(tmp___9 == 0) || !(tmp___9 == 0)) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1) && !(0 == error)) && ldv_coherent_state <= \old(ldv_coherent_state) + 1) || !(res_kbtab_probe_3 == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 3931]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3807]: Loop Invariant Derived loop invariant: ((!(res_kbtab_probe_3 == 0) || ((((((!(tmp___9 == 0) || !(tmp___9 == 0)) && 1 <= ldv_coherent_state) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && !(0 == error)) && 1 <= ldv_urb_state)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 4022]: Loop Invariant Derived loop invariant: (((!(\old(res_kbtab_probe_3) == 0) || !(0 == \old(ldv_urb_state))) || (((0 == ldv_coherent_state && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1)) || (((((1 <= ldv_coherent_state && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && ldv_urb_state <= \old(ldv_urb_state) + 1) && 1 <= ldv_urb_state) && ldv_coherent_state <= \old(ldv_coherent_state) + 1)) || !(0 == \old(ldv_coherent_state)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 37 procedures, 468 locations, 1 error locations. SAFE Result, 13.6s OverallTime, 20 OverallIterations, 3 TraceHistogramMax, 5.1s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 7869 SDtfs, 6499 SDslu, 18118 SDs, 0 SdLazy, 3300 SolverSat, 1119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1194 GetRequests, 1061 SyntacticMatches, 11 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1349occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 479 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 70 LocationsWithAnnotation, 3049 PreInvPairs, 3120 NumberOfFragments, 1518 HoareAnnotationTreeSize, 3049 FomulaSimplifications, 7568 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 70 FomulaSimplificationsInter, 3607 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 5832 NumberOfCodeBlocks, 5832 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 5809 ConstructedInterpolants, 0 QuantifiedInterpolants, 3608849 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3754 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 23 InterpolantComputations, 18 PerfectInterpolantSequences, 266/302 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...